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.
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
M. Dorigo. Optimization, Learning and Natural Algorithms (in Italian). PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992. pp. 140.
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.
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.
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.
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.
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.
C. Rajendran and H. Ziegler. Ant-colony algorithms for flowshop scheduling. European Journal of Operational Research, 2001. submitted.
D. Merkle, M. Middendorf, and H. Schmeck. Ant colony optimization for resourceconstrained project scheduling. IEEE Transactions on Evolutionary Computation, 2000. to appear.
M. Dorigo A. Roli, C. Blum. Aco for maximal constraint satisfaction problems. In Proceedings 4th Metaheuristics International Conference, pages 187–191, 2001.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merkle, D., Middendorf, M. (2002). Ant Colony Optimization with the Relative Pheromone Evaluation Method. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds) Applications of Evolutionary Computing. EvoWorkshops 2002. Lecture Notes in Computer Science, vol 2279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46004-7_32
Download citation
DOI: https://doi.org/10.1007/3-540-46004-7_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43432-0
Online ISBN: 978-3-540-46004-6
eBook Packages: Springer Book Archive