Abstract
Ant Colony Optimization (ACO) system is an intelligent multi-agent system of the interacting artificial ants to solve the combinatorial optimization problems. Applying ACO approach in the typical NP-hard problem like job shop scheduling (JSS) problem is still an impressive and attractive challenge with the community. This paper proposes two improvements of ACO algorithm based on the convergence property of pheromone trails. Our improvements are better in both terms of accuracy and running time than the state-of-the-art Max-Min ant system by the simulation with the standard data sets.
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
Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Politechnico di Milano, Italy, Tech. Rep. 91–106 (1991)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. The IEEE Transactions on Systems, Man and Cybernetics, Part B 26(1), 29–41 (1996)
Dorigo, M., Gambardella, L.: Ant colony system: a cooperative learning approach to the traveling salesman problem. The IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Dorigo, M., Di Caro, M.: Ant colony optimization: a new metaheuristic. In: The 1999 Congress on Evolutionary Computation (CEC 1999), vol. 2, pp. 6–9 (1999)
Stutzle, T., Hoos, H.: MAX-MIN ant system. The Future Generation Computer Systems 16(9), 889–914 (2000)
Stutzle, T., Dorigo, M.: A short convergence proof for a class of ant colony optimization algorithms. The IEEE Transactions on Evolutionary Computation 6(4), 358–365 (2002)
Gutjahr, W.J.: Mathematical runtime analysis of ACO algorithms: survey on an emerging issue. Swarm. Intell. 1, 59–79 (2007)
Huy, D.Q., Dong, D.D., Huan, H.X.: Multi-level ant system - a new approach through the new pheromone update for ant colony optimization. In: The 2006 IEEE Conference on Research, Innovation and Vision for the Future, pp. 55–58 (2006)
van der Zwaan, S., Marques, C.: Ant Colony Optimisation for Job Shop Scheduling. In: Proceedings of the Third Workshop on Genetic Algorithms and Artificial Life (GAAL 1999) (1999)
Vaessens, R., Aarts, E., Lenstra, J.: Job shop scheduling by local search. INFORMS Journal on Computing, vol 8, 302–317 (1996)
Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing, vol 3(1) (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Do Duc, D., Dinh, H.Q., Hoang Xuan, H. (2008). On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem. In: Bui, T.D., Ho, T.V., Ha, Q.T. (eds) Intelligent Agents and Multi-Agent Systems. PRIMA 2008. Lecture Notes in Computer Science(), vol 5357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89674-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-89674-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89673-9
Online ISBN: 978-3-540-89674-6
eBook Packages: Computer ScienceComputer Science (R0)