Abstract
In this paper, a multilevel approach of Ant Colony Optimization to solve the Job Shop Scheduling Problem (JSSP) is introduced. The basic idea is to split the heuristic search performed by ants into two stages; only the Ant System algorithm belonging to ACO was regarded for the current research. Several JSSP instances were used as input to the new approach in order to measure its performance. Experimental results obtained conclude that the Two-Stage approach significantly reduces the computational time to get a solution similar to the Ant System.
Chapter PDF
Similar content being viewed by others
References
Garey, M.R., D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H Freeman and Company (1979)
Dorigo, M., et al.: The Ant System: Optimization by a colony of cooperating agents. Man and Cybernetics-Part B 26(1), 1–13 (1996)
Dorigo, M., et al.: Ant algorithms for discrete optimization. Artificial Life 5(2), 137–172 (1999)
Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Stutzle, T.: An ant approach for the flow shop problem. In: EUFIT 1998, Verlag Mainz, Aachen, vol. 3, pp. 1560–1564 (1998)
Merkle, D., Middendorf, M., Schmeck, H.: Ant Colony Optimization for Resource Constrained Project Scheduling. IEEE Transactions on Evolutionary Computation 6(4), 333–346 (2002)
Merkle, D., Middendorf, M.: Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine. Journal of Applied Intelligence 105–111 (2003)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank Based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics 7(1), 25–38 (1999)
Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Window. In: David Corne, Marco Dorigo, and Fred Glover, editors, New Ideas in Optimization, pp. 63–76. McGraw-Hill, London (1999)
Blum, C., Sampels, M.: An ant Colony Optimization Algorithm to tackle Shop Scheduling Problems
Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant system for Job-shop Scheduling. JORBEL - Belgian Journal of Operations Research, Statistics and Computer Science 34(1), 39–53 (1994)
Blum, C., Sampels, M.: An ant Colony Optimization Algorithm for FOP Shop Scheduling: A case study on different pheromone representations. In: CEC 2002, pp. 1558–1563 (2002)
Ventresca, M., Ombuki, B.: Ant Colony Optimization for Job Shop Scheduling Problem. From Proceedings pf Artificial Intelligence and Soft Computing (2004)
Dorigo, M., Gambardela, L.M.: Ant colonies for the traveling salesman problem. BioSystems (43), 73–81 (1997)
Dorigo, M., Stützle, T.: ACO Algorithms for the Traveling Salesman Problem. Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications. John Wiley & Sons, Chichester (1999)
OR-library, URL http://web.cecs.pdx.edu/~bart/cs510ss/project/jobshop/jobshop/
Stutzle, T., Hoos, H.: The Max-Min Ant System. Future Generation Computer System 16(8), 889–914 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Puris, A., Bello, R., Trujillo, Y., Nowe, A., MartÃnez, Y. (2007). Two-Stage ACO to Solve the Job Shop Scheduling Problem. In: Rueda, L., Mery, D., Kittler, J. (eds) Progress in Pattern Recognition, Image Analysis and Applications. CIARP 2007. Lecture Notes in Computer Science, vol 4756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76725-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-76725-1_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76724-4
Online ISBN: 978-3-540-76725-1
eBook Packages: Computer ScienceComputer Science (R0)