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. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Puris, A., Bello, R., Trujillo, Y., Nowe, A., & Martínez, Y. (2007). Two-stage ACO to solve the job shop scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4756 LNCS, pp. 447–456). https://doi.org/10.1007/978-3-540-76725-1_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
