An Analysis of Algorithmic Components for Multiobjective Ant Colony Optimization: A Case Study on the Biobjective TSP
In many practical problems, several conflicting criteria exist for evaluating solutions. In recent years, strong research efforts have been made to develop efficient algorithmic techniques for tackling such multi-objective optimization problems. Many of these algorithms are extensions of well-known metaheuristics. In particular, over the last few years, several extensions of ant colony optimization (ACO) algorithms have been proposed for solving multi-objective problems. These extensions often propose multiple answers to algorithmic design questions arising in a multi-objective ACO approach. However, the benefits of each one of these answers are rarely examined against alternative approaches. This article reports results of an empirical research effort aimed at analyzing the components of ACO algorithms for tackling multi-objective combinatorial problems. We use the bi-objective travelling salesman problem as a case study of the effect of algorithmic components and their possible interactions on performance. Examples of design choices are the use of local search, the use of one versus several pheromone matrices, and the use of one or several ant colonies.
KeywordsMultiobjective Optimization Ant Colony Optimization Travelling Salesman Problem
Unable to display preview. Download preview PDF.
- 1.Alaya, I., Solnon, C., Ghédira, K.: Ant colony optimization for multi-objective optimization problems. In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), Los Alamitos, CA, vol. 1, pp. 450–457. IEEE Computer Society Press, Los Alamitos (2007)CrossRefGoogle Scholar
- 4.Barán, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: Proceedings of the Twentyfirst Iasted International Conference on Applied Informatics, Insbruck, Austria, pp. 97–102 (2003)Google Scholar
- 8.Grunert da Fonseca, V., Fonseca, C.M., Hall, A.O.: Inferential performance assessment of stochastic optimisers and the attainment function. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 213–225. Springer, Heidelberg (2001)CrossRefGoogle Scholar
- 12.López-Ibáñez, M., Paquete, L., Stützle, T.: On the design of ACO for the biobjective quadratic assignment problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 214–225. Springer, Heidelberg (2004)Google Scholar
- 13.López-Ibáñez, M., Paquete, L., Stützle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Bartz-Beielstein, T., et al. (eds.) Experimental Methods for the Analysis of Optimization Algorithms. Springer, Heidelberg (2010) (to appear)Google Scholar
- 14.Lust, T., Jaszkiewicz, A.: Speed-up techniques for solving large-scale biobjective TSP. Computers & Operations Research (2009) (in press)Google Scholar
- 16.Paquete, L., Stützle, T.: Clusters of non-dominated solutions in multiobjective combinatorial optimization: An experimental analysis. In: Barichard, V., et al. (eds.) Multiobjective Programming and Goal Programming: Theoretical Results and Practical Applications. Lecture Notes in Economics and Mathematical Systems, vol. 618, pp. 69–77. Springer, Berlin (2009)Google Scholar
- 17.Stützle, T.: ACOTSP: A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem (2002), http://www.aco-metaheuristic.org/aco-code