Results 71 to 80 of about 6,398 (105)
Some of the next articles are maybe not open access.
Evolving Ant Colony Optimization
Advances in Complex Systems, 1998Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to find the best set of parameters, we demonstrate the good performance of ACO in finding good solutions to the TSP.
Hozefa M. Botee, Eric Bonabeau
openaire +1 more source
Modifying Ant Colony Optimization
2008 IEEE Conference on Soft Computing in Industrial Applications, 2008Ant colony optimization (ACO) allows fast near optimal solutions to be found. It is useful in industrial environments where computational resources and time are limited. Like several search methods, being trapped in local optima within a search space currently is still nontrivial difficulty for ACO.
Sarayut Nonsiri, Siriporn Supratid
openaire +1 more source
Meeting Ant Colony Optimization
2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop, 2008The ant system is a new meta-heuristic mainly for hard combinatorial optimization problems. It has been unexpectedly successful and known as ant colony optimization (ACO) in recent years. Nowadays, a series of improvements have been made to the ACO, most of which focus on the exploitation of gather information to guide the search of ant colony towards ...
Zhang Fei Jun, Gao Wei
openaire +1 more source
2012 International Conference on Computer Science and Electronics Engineering, 2012
Recently, the application of Ant Colony Optimization is much wider and it is always the highlight of key algorithm. There are also many improvements about the ACO algorithm, such as: the improvements of algorithm in self-adaptive, the improvements of increasing the diversity of various group, the improvements of enhancing local search, combining with ...
Ying Pei, Wenbo Wang, Song Zhang
openaire +1 more source
Recently, the application of Ant Colony Optimization is much wider and it is always the highlight of key algorithm. There are also many improvements about the ACO algorithm, such as: the improvements of algorithm in self-adaptive, the improvements of increasing the diversity of various group, the improvements of enhancing local search, combining with ...
Ying Pei, Wenbo Wang, Song Zhang
openaire +1 more source
Pipe Routing through Ant Colony Optimization
Journal of Infrastructure Systems, 2010As the need to better manage scarce water resources and water distribution systems increases, the problem of efficient routing of piping networks is gaining importance within the framework of an overall strategy for improving the networks’ efficiency and resilience to undesired emphoperational changes.
Christodoulou, Symeon E. +3 more
openaire +2 more sources
Ant colony optimization in lens design
Applied Optics, 2019As the most widely used optimization algorithm in optical design, the damped least square (DLS) method is advantageous for its fast convergence and deterministic optimization path. However, results are strongly dependent on the initial system and problematic when it is stuck in a local minimum in the searching space.
Ziyao, Tang +2 more
openaire +2 more sources
Do Ants Use Ant Colony Optimization?
2018Ant Colony Optimization (ACO) is a widespread optimization technique used to solve complex problems in a broad range of fields, including engineering, software development and logistics. It was inspired by the behaviour of ants which can collectively select the shorter of two paths leading to a food source.
Wolfhard von Thienen, Tomer J. Czaczkes
openaire +1 more source
2013
The ant colony optimization algorithm (ACO) is an evolutionary meta-heuristic algorithm based on a graph representation that has been applied successfully to solve various hard combinatorial optimization problems. Initially proposed by Marco Dorigo in 1992 in his PhD thesis [49], the main idea of ACO is to model the problem as the search for a minimum ...
Muhammet Ünal +3 more
openaire +1 more source
The ant colony optimization algorithm (ACO) is an evolutionary meta-heuristic algorithm based on a graph representation that has been applied successfully to solve various hard combinatorial optimization problems. Initially proposed by Marco Dorigo in 1992 in his PhD thesis [49], the main idea of ACO is to model the problem as the search for a minimum ...
Muhammet Ünal +3 more
openaire +1 more source