Abstract
In this paper, we propose a variant of an ACO algorithm called the cunning Ant System (cAS). In cAS, each ant generates a solution by borrowing a part of a solution which was generated in previous iterations, instead of generating the solution entirely from pheromone density. Thus we named it, cunning ant. This cunning action reduces premature stagnation and exhibits good performance in the search. The experimental results showed cAS worked very well on the TSP and it may be one of the most promising ACO algorithms.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Trans. on SMC-Part B 26(1), 29–41 (1996)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE TEC 1(1), 53–66 (1997)
Stützle, T., Hoos, H.: Max-min ant system. Future Generation Computer Systems 16(9), 889–914 (2000)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colony for the quadratic assignment problem. J. of the Operational Research Society 50, 167–176 (1999)
Stützle, T.: An ant approach to the flowshop problem. In: Proc. of the 6th European Congress in Intelligent Thech. and Com., vol. 3, pp. 1560–1564 (1998)
Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89, 319–328 (1999)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT press, Massachusetts (2004)
Tsutsui, S.: Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 224–233. Springer, Heidelberg (2002)
Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5–20 (2002)
Acan, A.: An external memory implementation in ant colony optimization. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 73–84. Springer, Heidelberg (2004)
Acan, A.: An external partial permutations memory for ant colony optimization. In: Proc. of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization, pp. 1–11 (2005)
Wiesemann, W., Stützle, T.: An experimental investigation of iterated ants for the quadratic assignment problem. IRIDIA Technical Report Series Technical Report TR/IRIDIA/2006-003 (2006)
Tsutsui, S.: An enhanced aggregation pheromone system for real-parameter optimization in the aco metaphor. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, Springer, Heidelberg (2006)
Tsutsui, S., Pelikan, M., Goldberg, D.E.: Using edge histogram models to solve permutation problems with probabilistic model-building genetic algorithms. IlliGAL Report No. 2003022 (2003)
Gambardella, L.M., Dorigo, M.: Solving symmetric and asymmetric tsps by ant colonies. In: Proc. the IEEE Int. Conf. on Evo. Comp (ICEC 1996), pp. 622–627 (1996)
Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)
Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS J. on Computing 15, 82–92 (2003)
Johnson, D.S.: Experimental analysis of heuristics for the stsp. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Variations, vol. 9, pp. 369–443 (2002)
Concorde tsp solver, Ansi c code as gzipped tar file (2005), http://www.tsp.gatech.edu/concorde.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsutsui, S. (2006). cAS: Ant Colony Optimization with Cunning Ants. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_17
Download citation
DOI: https://doi.org/10.1007/11844297_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)