Results 231 to 240 of about 20,562 (272)
Some of the next articles are maybe not open access.
On the Faster Ant Colony Optimization Algorithm
2009 Fifth International Conference on Natural Computation, 2009The pheromone trails in ACO are used to reflect the ants’ search experience, so the quality of the pheromone is crucial to the success of ACO. The main factors affecting the quality of the pheromone include the strategy of updating the pheromone and the quality of the constructed solutions.
Yingzhou Bi, Lixin Ding, Jianbo Lu
openaire +1 more source
An Improved Ant Colony Algorithm for VRPTW
2008 International Conference on Computer Science and Software Engineering, 2008The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem. The primary objective of VRPTW is defined as the minimization of the number of routes or vehicles. Minimization of the total travel cost is secondary objective.
Chengming Qi, Yunchuan Sun
openaire +1 more source
2020
Ant colony optimization (ACO) algorithm, models the real-life behavior of ants to solve optimization problems. Information provided in this chapter include: path navigation of ants, foraging pattern of ants by depositing pheromones during exploration and ACO model development.
Modestus O. Okwu, Lagouge K. Tartibu
openaire +1 more source
Ant colony optimization (ACO) algorithm, models the real-life behavior of ants to solve optimization problems. Information provided in this chapter include: path navigation of ants, foraging pattern of ants by depositing pheromones during exploration and ACO model development.
Modestus O. Okwu, Lagouge K. Tartibu
openaire +1 more source
A Convergence Proof for Ant Colony Algorithm
2009 International Joint Conference on Computational Sciences and Optimization, 2009In this paper, a general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. Based on the two different conditions, some convergence properties for Ant Colony System (ACS) are presented. The global searching and convergence ability are improved by adaptively changing the lower pheromone bound.
Jifu Nong, Long Jin
openaire +1 more source
Ant colony algorithms in MANETs: A review
Journal of Network and Computer Applications, 2012Mobile ad-hoc networks (MANETs) consist of special kind of wireless mobile nodes which form a temporary network without using any infrastructure or centralized administration. MANETs can be used in wide range of future applications as they have the capability to establish networks at anytime, anywhere without aid of any established infrastructure.
Gurpreet Singh Bhamra +2 more
openaire +1 more source
Application of Improved Ant Colony Algorithm
2008 Fourth International Conference on Natural Computation, 2008A stochastic optimization algorithm is proposed by combining ant colony (ACO) algorithm with artificial fish-swarm algorithm (AFSA) for solving continuous space optimization problems. The algorithm is improved with the rapid search capability of AFSA and the good search characteristics of ACO, and the convergence speed of the presented algorithm is ...
Hongyan Shi, Zhaoyu Bei
openaire +1 more source
Ant Colony Algorithms for Data Learning
International Journal of Applied Evolutionary Computation, 2013Fuzzy Ant-Miner algorithm processes data with nominal class and has the disadvantage of not treating the data with continuous class. In this paper, after presenting the Fuzzy Ant Miner algorithm, the authors propose a new learning method to partition heterogeneous data with continuous class.
Mohamed Hamlich, Mohammed Ramdani
openaire +1 more source
Analysis the Uncertainties of the Ant Colony Algorithm
2010 International Conference on Computational Aspects of Social Networks, 2010In this paper, the subject of discussion is the uncertainties of Ant Colony Algorithm (ACA) . In order to find application and popularize the ACA, we try to find some disciplinarians which can eliminate the impact of uncertainties in our algorithm and find the best assembled of the parameters by a series of experiments.
Yi Zhang 0031 +2 more
openaire +1 more source
MC-ANT: A Multi-Colony Ant Algorithm
2010In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between colonies and a mutation operator that aims to adjust the parameter settings during the optimization.
Leonor Albuquerque Melo +2 more
openaire +1 more source
Commodity Search Algorithm based on Ant Colony Algorithm
2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), 2020In the Crowd Intelligent Trading Network (CIbTN), intelligent individuals connect with each other and make up a distributed network. Each intelligent individual store commodity information in local node. They realize the transmission and sharing of information through addressing and routing circle of friends.
Zhishuo Liu, Zhuonan Han
openaire +1 more source