Skip to main content

The Influence of Run-Time Limits on Choosing Ant System Parameters

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Included in the following conference series:

Abstract

The influence of the allowed running time on the choice of the parameters of an ant system is investigated. It is shown that different parameter values appear to be optimal depending on the algorithm run-time. The performance of the MAX-MIN Ant System (MMAS) on the University Course Timetabling Problem (UCTP) — a type of constraint satisfaction problem — is used as an example. The parameters taken into consideration include the type of the local search used, and some typical parameters for MMAS — the τ min and ρ. It is shown that the optimal parameters depend significantly on the time limits set. Conclusions summarizing the influence of time limits on parameter choice, and possible methods of making the parameter choice more independent from the time limits, are presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics 26 (1996) 29–41

    Article  Google Scholar 

  2. Stützle, T., Dorigo, M.: Aco algorithms for the traveling salesman problem. In Makela, M., Miettinen, K., Neittaanmäki, P., Périaux, J., eds.: Proceedings of Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications (EUROGEN 1999), John Wiley & Sons (1999)

    Google Scholar 

  3. Stützle, T., Dorigo, M. In: ACO Algorithms for the Quadratic Assignment Problem. McGraw-Hill (1999)

    Google Scholar 

  4. Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), Morgan Kaufmann Publishers (2000) 893–900

    Google Scholar 

  5. Stützle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems 16 (2000) 889–914

    Article  Google Scholar 

  6. Rossi-Doria, O., Sampels, M., Chiarandini, M., Knowles, J., Manfrin, M., Mastrolilli, M., Paquete, L., Paechter, B.: A comparison of the performance of different metaheuristics on the timetabling problem. In: Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling (PATAT 2002) (to appear). (2002)

    Google Scholar 

  7. Socha, K., Knowles, J., Sampels, M.: A MAX-MIN Ant System for the University Timetabling Problem. In Dorigo, M., Di Caro, G., Sampels, M., eds.: Proceedings of ANTS 2002 — Third International Workshop on Ant Algorithms. Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany (2002)

    Google Scholar 

  8. Socha, K., Sampels, M., Manfrin, M.: Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art. In: Proceedings of EvoCOP 2003 — 3rd European Workshop on Evolutionary Computation in Combinatorial Optimization, LNCS 2611. Volume 2611 of Lecture Notes in Computer Science., Springer, Berlin, Germany (2003)

    Google Scholar 

  9. Maniezzo, V., Carbonaro, A.: Ant Colony Optimization: an Overview. In Ribeiro, C., ed.: Essays and Surveys in Metaheuristics, Kluwer Academic Publishers (2001)

    Google Scholar 

  10. Stützle, T., Hoos, H. In: The MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Combinatorial Global Optimisation. Kluwer Academic Publishers (1998) 313–329

    Google Scholar 

  11. Burke, E.K., Newall, J.P., Weare, R.F.: A memetic algorithm for university exam timetabling. In: Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling (PATAT 1995), LNCS 1153, Springer-Verlag (1996) 241–251

    Google Scholar 

  12. Stützle, T., Hoos, H.: Improvements on the ant system: A detailed report on max-min ant system. Technical Report AIDA-96-12 — Revised version, Darmstadt University of Technology, Computer Science Department, Intellectics Group (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Socha, K. (2003). The Influence of Run-Time Limits on Choosing Ant System Parameters. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics