Serban Iordache
ABSTRACT
In this paper, we present Consultant-Guided Search (CGS), a new metaheuristic for combinatorial optimization problems, based on the direct exchange of information between individuals in a population. CGS is a swarm intelligence technique inspired by the way real people make decisions based on advice received from consultants. We exemplify the application of this metaheuristic to a specific class of problems by introducing the CGS-TSP algorithm, an instantiation of CGS for the Traveling Salesman Problem. To determine if our direct communication approach can compete with stigmergy-based methods, we compare the performance of CGS-TSP with that of Ant Colony Optimization algorithms. Our experimental results show that the solution quality obtained by CGS-TSP is comparable with or better than that obtained by Ant Colony System and MAX-MIN Ant System.
- Applegate, D., Bixby, R., Chvatal, V. and Cook, W. The traveling salesman problem: A computational study. Princeton, NJ: Princeton University Press, 2007. Google Scholar
Digital Library
- Birattari, M., Stützle, T., Paquete, L. and Varrentrapp, K. A racing algorithm for configuring metaheuristics. Proceedings of GECCO 2002, 11--18. Google ScholarDigital Library
- Bonabeau, E., Dorigo, M. and Theraulaz, G. Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, USA, 1999. Google ScholarDigital Library
- Clerc, M. Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. In Onwubolu, G. C., Babu, B.V. (eds.) New Optimization Techniques in Engineering, Springer, 2004, 219--239.Google Scholar
- Dorigo, M. and Gambardella, L. M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, 1997, 53--66. Google ScholarDigital Library
- Dorigo, M. and Stützle, T. Ant Colony Optimization. The MIT Press, 2004. Google ScholarDigital Library
- Hutter, F., Hoos, H.H., Leyton-Brown, K. and Stützle, T. ParamILS: An Automatic Algorithm Configuration Framework. Journal of Artificial Intelligence Research (JAIR), vol. 36, October 2009, 267--306. Google ScholarDigital Library
- Kennedy, J. and Eberhart, R. Swarm Intelligence. Morgan Kaufmann, San Francisco, CA, 2001. Google ScholarDigital Library
- Reinelt, G. TSPLIB - A Traveling Salesman Problem Library, ORSA Journal on Computing, vol. 3, no. 4, 1991, 376--384.Google Scholar
- Shi, X., Liang, Y., Lee, H., Lu, C., and Wang, Q. Particle swarm optimization-based algorithms for TSP and generalized TSP. In Information Processing Letters, vol. 103, no. 5, August 2007, 169--176. Google ScholarDigital Library
- Stützle, T. and Hoos, H. H. MAX-MIN Ant System. Future Generation Computer Systems, 16(8), 2000, 889--914. Google ScholarDigital Library
- Teodorovic, D. and Dell'Orco, M. Bee colony optimization - A cooperative learning approach to complex transportation problems. In Advanced OR and AI Methods in Transportation, 2005, 51--60.Google Scholar
- Wong, L., Low, M. and Chong, C. A Bee Colony Optimization Algorithm for Traveling Salesman Problem. In Proceedings of Second Asia International Conference on Modelling & Simulation (AMS 2008), 2008, 818--823. Google ScholarDigital Library
Index Terms
- Consultant-guided search: a new metaheuristic for combinatorial optimization problems
Recommendations
Consultant-guided search combined with local search for the traveling salesman problem
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationConsultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. CGS has been applied to the Traveling Salesman ...
Consultant-guided search algorithms with local search for the traveling salesman problem
PPSN'10: Proceedings of the 11th international conference on Parallel problem solving from nature: Part IIConsultant-Guided Search (CGS) is a recent metaheuristic for combinatorial optimization problems, which has been successfully applied to the Traveling Salesman Problem (TSP). In experiments without local search, it has been able to outperform some of ...
Consultant-guided search algorithms for the quadratic assignment problem
GECCO '10: Proceedings of the 12th annual conference companion on Genetic and evolutionary computationConsultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied ...
Comments