Advertisement

Ant Colony Optimization with the Relative Pheromone Evaluation Method

  • Daniel Merkle
  • Martin Middendorf
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2279)

Abstract

In this paper the relative pheromone evaluation method for Ant Colony Optimization is investigated. We compare this method to the standard pheromone method and the summation method. Moreover we propose a new variant of the relative pheromone evaluation method. Experiments performed for various instances of the single machine scheduling problems with earliness costs and multiple due dates show the potential of the relative pheromone evaluation method.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992. pp. 140.Google Scholar
  2. 2.
    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.CrossRefGoogle Scholar
  3. 3.
    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. McGraw-Hill, 1999.Google Scholar
  4. 4.
    R. Michels and M. Middendorf. An ant algorithm for the shortest common supersequence problem. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 51–61. McGraw-Hill, 1999.Google Scholar
  5. 5.
    D. Merkle and M. Middendorf. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In Proceedings of the EvoWorkshops 2000, number 1803 in Lecture Notes in Computer Science, pages 287–296. Springer Verlag, 2000.Google Scholar
  6. 6.
    T. Teich, M. Fischer, A. Vogel, and J. Fischer. A new ant colony algorithm for the job shop scheduling problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), page 803, 2001.Google Scholar
  7. 7.
    C. Rajendran and H. Ziegler. Ant-colony algorithms for flowshop scheduling. European Journal of Operational Research, 2001. submitted.Google Scholar
  8. 8.
    D. Merkle, M. Middendorf, and H. Schmeck. Ant colony optimization for resourceconstrained project scheduling. IEEE Transactions on Evolutionary Computation, 2000. to appear.Google Scholar
  9. 9.
    M. Dorigo A. Roli, C. Blum. Aco for maximal constraint satisfaction problems. In Proceedings 4th Metaheuristics International Conference, pages 187–191, 2001.Google Scholar
  10. 10.
    D. Merkle and M. Middendorf. On the behaviour of ant algorithms: Studies on simple problems. In Proceedings 4th Metaheuristics International Conference, pages 573–577, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Daniel Merkle
    • 1
  • Martin Middendorf
    • 2
  1. 1.Institute for Applied Computer Science and Formal Description MethodsUniversity of KarlsruheGermany
  2. 2.Computer Science GroupCatholic University of EichstättGermany

Personalised recommendations