Abstract
Ant colony optimization (ACO) algorithms construct solutions each time starting from scratch, that is, from an empty solution. Differently from ACO algorithms, iterated greedy, another constructive stochastic local search method, starts the solution construction from partial solutions. In this paper, we examine the performance of a variation of \(\mathcal{MAX}\)-\(\mathcal{MIN}\) Ant System, one of the most successful ACO algorithms, that exploits this idea central to iterated greedy algorithms. We consider the quadratic assignment problem as a case-study, since this problem was also tackled in a closely related research to ours, the one on the usage of external memory in ACO. The usage of external memory resulted in ACO variants, where partial solutions are used to seed the solution construction. Contrary to previously reported results on external memory usage, our computational results are more pessimistic in the sense that starting the solution construction from partial solutions does not necessarily lead to improved performance when compared to state-of-the-art ACO algorithms.
Keywords
- Local Search
- Solution Component
- Quadratic Assignment Problem
- Stochastic Local Search
- Solution Construction
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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., Stützle, T.: Ant Colony Optimization. MIT Press, USA (2004)
Brusco, M.J., Jacobs, L.W., Thompson, G.M.: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set covering problems. Annals of Operations Research 86, 611–627 (1999)
Jacobs, L.W., Brusco, M.J.: A local search heuristic for large set-covering problems. Naval Research Logistics 42(7), 1129–1140 (1995)
Marchiori, E., Steenbeek, A.: An evolutionary algorithm for large scale set covering problems with application to airline crew scheduling. In: Oates, M.J., Lanzi, P.L., Li, Y., Cagnoni, S., Corne, D.W., Fogarty, T.C., Poli, R., Smith, G.D. (eds.) EvoIASP 2000, EvoWorkshops 2000, EvoFlight 2000, EvoSCONDI 2000, EvoSTIM 2000, EvoTEL 2000, and EvoROB/EvoRobot 2000. LNCS, vol. 1803, pp. 367–381. Springer, Heidelberg (2000)
Ruiz, R., Stützle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research (in press)
Stützle, T., Hoos, H.H.: \(\cal MAX\)–\(\cal MIN\) Ant System. Future Generation Computer Systems 16(8), 889–914 (2000)
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: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 1–11. Springer, Heidelberg (2005)
Stützle, T., Dorigo, M.: ACO algorithms for the quadratic assignment problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 33–50. McGraw Hill, UK (1999)
Sahni, S., Gonzalez, T.: P-complete approximation problems. Journal of the ACM 23(3), 555–565 (1976)
Burkard, R.E., Çela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Pardalos, P.M., Du, D.Z. (eds.) Handbook of Combinatorial Optimization, vol. 2, pp. 241–338. Kluwer Academic Publishers, Dordrecht (1998)
Çela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)
Hoos, H.H., Stützle, T.: Stochastic Local Search—Foundations and Applications. Morgan Kaufmann, San Francisco (2004)
Stützle, T., Hoos, H.: \(\cal MAX\)–\(\cal MIN\) Ant System and local search for combinatorial optimization problems. In: Voss, S., et al. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 137–154. Kluwer Academic Publishers, Dordrecht (1999)
Hahn, P.: QAPLIB - a quadratic assignment problem library (2006), http://www.seas.upenn.edu/qaplib (Version visited last on February 15, 2006)
Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, 2nd edn. Chapman & Hall / CRC, Boca Raton, Florida, USA (2000)
Stützle, T., Hoos, H.H.: Analysing the run-time behaviour of iterated local search for the travelling salesman problem. In: Hansen, P., Ribeiro, C.C. (eds.) Essays and Surveys on Metaheuristics, pp. 589–611. Kluwer Academic Publishers, Dordrecht (2001)
Lessing, L.: Ant colony optimization for the set covering problem. Master’s thesis, Intellectics Group, Computer Science Department, Darmstadt University of Technology (2004)
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
Wiesemann, W., Stützle, T. (2006). Iterated Ants: An Experimental Study for the Quadratic Assignment Problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_16
Download citation
DOI: https://doi.org/10.1007/11839088_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)