On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem
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.
KeywordsAnt colony optimization algorithm job shop scheduling problem ACO convergence
Unable to display preview. Download preview PDF.
- 1.Dorigo, M., Maniezzo, V., Colorni, A.: Positive feedback as a search strategy. Politechnico di Milano, Italy, Tech. Rep. 91–106 (1991)Google Scholar
- 4.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)Google Scholar
- 8.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)Google Scholar
- 9.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)Google Scholar
- 11.Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing, vol 3(1) (1991)Google Scholar