Skip to main content

On the Explorative Behavior of MAX–MIN Ant System

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5752))

Abstract

Analyzing the behavior of stochastic procedures is generally recognized to be relevant. A possible way for doing so consists in observing the exploration performed. A formalization in this sense is proposed here: A method for studying this aspect regardless the type of approach used is defined and tested. The consequent measure of exploration is applied to MAX–MIN Ant System: The impact of the values of the parameters on the exploration is assessed. The conclusions drawn are put in relation with the indications provided by the average λ-branching factor.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhattacharya, M.: A synergistic approach for evolutionary optimization. In: GECCO 2008: Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation, pp. 2105–2110. ACM, New York (2008)

    Chapter  Google Scholar 

  2. Devarenne, I., Mabed, H., Caminada, A.: Intelligent neighborhood exploration in local search heuristics. In: ICTAI 2006: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence, pp. 144–150. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  3. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  4. Everitt, B., Landau, S., Leese, M.: Cluster Analysis. Arnold, London (2001)

    MATH  Google Scholar 

  5. Kaufman, L., Rousseeuw, P.J.: Finding groups in data. An introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics. Wiley, New York (1990)

    MATH  Google Scholar 

  6. Jardine, N., Sibson, R.: The construction of hierarchic and non-hierarchic classifications. The Computer Journal 11(2), 177–184 (1968)

    Article  MATH  Google Scholar 

  7. Orosz, J.E., Jacobson, S.H.: Finite-time performance analysis of static simulated annealing algorithms. Computational Optimization and Applications 21(1), 21–53 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Pellegrini, P., Ellero, A.: The small world of pheromone trails. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 387–394. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Pellegrini, P., Favaretto, D., Moretti, E.: On MAX–MIN ant system’s parameters. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 203–214. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Favaretto, D., Moretti, E., Pellegrini, P. (2009). On the Explorative Behavior of MAX–MIN Ant System. In: Stützle, T., Birattari, M., Hoos, H.H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2009. Lecture Notes in Computer Science, vol 5752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03751-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03751-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03750-4

  • Online ISBN: 978-3-642-03751-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics