Abstract
The impact of the values of the most meaningful parameters on the behavior of \(\cal M\!AX\!\)–\(\cal MI\!N\!\) Ant System is analyzed. Namely, we take into account the number of ants, the evaporation rate of the pheromone, and the exponent values of the pheromone trail and of the heuristic measure in the random proportional rule. We propose an analytic approach to examining their impact on the speed of convergence of the algorithm. Some computational experiments are reported to show the practical relevance of the theoretical results.
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
Colorni, A., Dorigo, M., Maniezzo, V.: An investigation of some properties of an “ant algorithm”. In: Männer, R., Manderick, B. (eds.) PPSN, Brussels, Belgium, pp. 515–526. Elsevier, Amsterdam (1992)
Botee, H., Bonabeau, E.: Evolving ant colony optimization. Advanced Complex Systems 1, 149–159 (1985)
Pilat, M.L., White, T.: Using genetic algorithms to optimize acs-tsp. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) ANTS 2002: Proceedings of the Third International Workshop on Ant Algorithms, London, UK, pp. 282–287. Springer, Heidelberg (2002)
Zaitar, R., Hiyassat, H.: Optimizing the ant colony optimization using standard genetic algorithm. In: Hamza, M. (ed.) Artificial Intelligence and Applications, Innsbruck, Austria, pp. 130–133. IASTED/ACTA Press (2005)
Randall, M.: Near parameter free ant colony optimisation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 374–381. Springer, Heidelberg (2004)
Gaertner, D., Clark, K.: On optimal parameters for ant colony optimization algorithms. In: Arabnia, H., Joshua, R. (eds.) IC-AI 2005, Las Vegas, USA, pp. 83–89 (2005)
Socha, K.: The influence of run-time limits on choosing ant system parameters. In: Cantu-Paz, E., Livermore, L., Balakrishnan, K., Banzhaf, W., Bentley, P., Dasgupta, L.C.D., Jong, K.D., Herrera, J.F., Langdon, W., Lutton, E., Mazumder, P., Michielssen, E., Pedrycz, W., Roy, R., Rudnick, E., Soule, M.S.T., Spector, L., Verdegay, J. (eds.) Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2003. LNCS, vol. 2611, pp. 49–60. Springer, Heidelberg (2003)
Solnon, C.: Boosting ACO with a preprocessing step. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 163–172. Springer, Heidelberg (2002)
Adenso-Díaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search (Operations Research) (to appear)
Coy, S., Golden, B., Runger, G., Wasil, E.: Using experimental design to find effective parameter settings for heuristics. Journal of Heuristics 7(1), 77–97 (2001)
Bartz-Beielstein, T., Markon, S.: Tuning search algorithms for real-world applications: A regression tree based approach. In: Greenwood, G. (ed.) Proc. 2004 Congress on Evolutionary Computation (CEC 2004), Piscataway NJ, pp. 1111–1118. IEEE Press, Los Alamitos (2004)
Birattari, M., Stützle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W. (ed.) GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11–18. Morgan Kaufmann Publishers, San Francisco (2002)
Battiti, R., Tecchioli, G.: The reactive tabu search. ORSA Journal on Computing 6, 126–585 (1994)
Lau, H., Wan, W., Halim, S.: Tuning tabu search strategies via visual diagnosis. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Proceedings of Metaheuristics International Conference (MIC 2005), Vienna, Austria, pp. 630–636 (2005)
Stützle, T., Hoos, H.: Improvements on the ant system: introducing the max-min ant system. In: Albrecht, R., Smith, G., Steele, N. (eds.) Proceedings of Artificial Neural Nets and Genetic Algorithms 1997, Norwich, U.K, pp. 245–249. Springer, Heidelberg (1998)
Stützle, T., Hoos, H.: Max-min ant system. Future Generation Computer Systems 16(8), 889–914 (2000)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank based version of the ant system: A computational study. Central European Journal for Operations Research and Economics 7(1), 25–38 (1999)
Colorni, A., Dorigo, M., Maffioli, F., Maniezzo, V., Righini, G., Trubian, M.: Heuristics from nature for hard combinatorial problems. International Transactions in Operational Research 3(1), 1–21 (1996)
Stützle, T., Hoos, H.: The max-min ant system and local search for the traveling salesman problem. In: Angeline, P. (ed.) Proceedings of the IEEE International Conference on Evolutionary Computation, Indianapolis, USA, pp. 308–313. Springer, Heidelberg (1997)
Birattari, M.: The problem of tuning metaheuristics as seen from a machine learning perspective. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium (2005)
Friedman, J.: Multivariate adaptive regression splines. The Annals of Statistics 19, 1–141 (1991)
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
Pellegrini, P., Favaretto, D., Moretti, E. (2006). On \(\cal M\!AX\!\) – \(\cal MI\!N\!\) Ant System’s Parameters. 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_18
Download citation
DOI: https://doi.org/10.1007/11839088_18
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)