Skip to main content

Solving Multi-criteria Optimization Problems with Population-Based ACO

  • Conference paper
  • First Online:
Evolutionary Multi-Criterion Optimization (EMO 2003)

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

Included in the following conference series:

Abstract

In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set of all non-dominated solutions found so far. We investigate different maximum sizes for this population. The algorithm employs one pheromone matrix for each type of optimization criterion. The matrices are derived from the chosen population of solutions, and can cope with an arbitrary number of criteria. As a test problem, Single Machine Total Tardiness with changeover costs is used.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11–32, London, 1999. McGraw-Hill.

    Google Scholar 

  2. Kalyanmoy Deb. Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons, Chichester, 2001.

    MATH  Google Scholar 

  3. Carlos A. Coello Coello, David A. Van Veldhuizen, and Gary B. Lamont, editors. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, New York, 2002.

    MATH  Google Scholar 

  4. Carlos E. Mariano and Eduardo Morales. MOAQ an ant-Q algorithm for multiple objective optimization problems. In W. Banzhaf and et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 894–901, Orlando, Florida, USA, 13–17 July 1999. Morgan Kaufmann.

    Google Scholar 

  5. Luca Maria Gambardella, Éric Taillard, and Giovanni Agazzi. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In David Corne, Marco Dorigo, and Fred Glover, editors, New Ideas in Optimization, pages 63–76. McGraw-Hill, London, 1999.

    Google Scholar 

  6. C. Gagné, M. Gravel, and W.L. Price. Scheduling a single machine where setup times are sequence dependent using an ant-colony heuristic. In Abstract Proceedings of ANTS’2000,7.–9. September Brussels, Belgium, pages 157–160, 2000.

    Google Scholar 

  7. M. Gravel, W.L. Price, and C. Gagné. Scheduling continous casting of aluminium using a multiple objective ant colony optimization heuristic. European Journal of Operational Research, 143:218–229, 2002.

    Article  MATH  Google Scholar 

  8. K. Doerner, R.F. Hartl, and M. Reimann. Cooperative ant colonies for optimizing resource allocation in transportation. In W. Boers and et al., editors, Proceedings of the EvoWorkshops 2001, pages 70–79, Berlin, Heidelberg, 2001. Springer.

    Google Scholar 

  9. K. Doerner, R.F. Hartl, and M. Reimann. Are COMPETants more competent for problem solving? — the case of a multiple objective transportation problem. In L. Spector et al., editor, Proceedings of the GECCO’ 01, page 802, Berlin, Heidelberg, 2001. Morgan Kaufmann.

    Google Scholar 

  10. K. Doerner, J.W. Gutjahr, R.F. Hartl, C. Strauss, and C. Stummer. Investitionsentscheidungen bei mehrfachen Zielsetzungen und künstliche Ameisen. In Chamoni and et al., editors, Operations Research Proceedings, pages 355–362, Berlin, Heidelberg. Springer.

    Google Scholar 

  11. K. Doerner, J.W. Gutjahr, R.F. Hartl, C. Strauss, and C. Stummer. Pareto ant colony optimization: A metaheuristic approach to multiobjective portfolio selection. Annals of Operations Research. to appear.

    Google Scholar 

  12. S. Iredi, D. Merkle, and M. Middendorf. Bi-criterion optimization with multi colony ant algorithms. In E. Zitzler and et al., editors, Evolutionary Multi-Criterion Optimization, First International Conference (EMO’01), number 1993 in LNCS, pages 359–372, Berlin, Heidelberg. Springer.

    Google Scholar 

  13. M. Guntsch and M. Middendorf. A population based approach for ACO. In S. Cagnoni and et al., editors, Applications of Evolutionary Computing — EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, number 2279 in LNCS, pages 72–81. Springer, 2002.

    Google Scholar 

  14. M. Guntsch and M. Middendorf. Applying population based aco to dynamic optimization problems. In Ant Algorithms, Proceedings of Third International Workshop ANTS 2002, number 2463 in LNCS, pages 111–122. Springer, 2002.

    Google Scholar 

  15. D. Merkle and M. Middendorf. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In Proceeding of the EvoWorkshops 2000, number 1803 in LNCS, pages 287–296. Springer Verlag, 2000.

    Google Scholar 

  16. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics — Part B, 26:29–41, 1996.

    Article  Google Scholar 

  17. D. Merkle, M. Middendorf, and H. Schmeck. Pheromone evaluation in ant colony optimization. In Proceedings of the Third Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2000), pages 2726–2731. IEEE Press, 2000.

    Google Scholar 

  18. H.A.J. Crauwels, C.N. Potts, and L.N. Van Wassenhove. Local search heuristics for the single machine total weighted tardiness scheduling problem. Informs Journal on Computing, 10:341–350, 1998.

    Article  MATH  MathSciNet  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

Guntsch, M., Middendorf, M. (2003). Solving Multi-criteria Optimization Problems with Population-Based ACO. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds) Evolutionary Multi-Criterion Optimization. EMO 2003. Lecture Notes in Computer Science, vol 2632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36970-8_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-36970-8_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-01869-8

  • Online ISBN: 978-3-540-36970-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics