Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477789 | European Journal of Operational Research | 2007 | 33 Pages |
Abstract
The difficulty to solve multiple objective combinatorial optimization problems with traditional techniques has urged researchers to look for alternative, better performing approaches for them. Recently, several algorithms have been proposed which are based on the ant colony optimization metaheuristic. In this contribution, the existing algorithms of this kind are reviewed and a proposal of a taxonomy for them is presented. In addition, an empirical analysis is developed by analyzing their performance on several instances of the bi-criteria traveling salesman problem in comparison with two well-known multi-objective genetic algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
C. García-Martínez, O. Cordón, F. Herrera,