Ant colony optimization with a specialized pheromone trail for the car-sequencing problem

European Journal of Operational Research

Volumn 197, Issue 3, 2009, Pages 1185-1191

  Morin, Sara ^a   Gagné, Caroline ^a   Gravel, Marc ^a  

^a UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

Author keywords

Ant colony optimization; Car sequencing problem; Pheromone trail; Scheduling

Indexed keywords

BENCHMARKING; OPTIMIZATION; SCHEDULING;

ANT ALGORITHMS; ANT COLONY OPTIMIZATION; ANT COLONY OPTIMIZATION ALGORITHMS; ASSEMBLY LINES; BENCH-MARK PROBLEMS; CAR-SEQUENCING PROBLEM; INTERNAL STRUCTURES; LEARNING PROCESS; META-HEURISTIC; NP-HARD; PHEROMONE TRAIL;

LEARNING ALGORITHMS;

EID: 62249222085     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.03.033     Document Type: Article

References (23)

1. M. Dorigo, V. Maniezzo, A. Colorni, Positive feedback as a search strategy, Technical Report No. 91-016, Politecnico di Milano, Italy, 1991, p. 20.
2. Colorni A., Dorigo M., and Maniezzo V. Distributed optimization by ant colonies. In: Verela F., and Bourgine P. (Eds). Proceedings of the First European Conference on Artificial Life (ECAL'91) (1992), MIT Press, Cambridge, Mass, USA
3. M. Dorigo, Optimization, learning and natural algorithms. Ph.D. Thesis, Politecnico di Milano, Italy, 1992.
4. Dorigo M., and Stützle T. Ant Colony Optimization (2004), MIT Press, Cambridge, MA p. 328
5. Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
6. Parello B.D., Kabat W.B., and Wos L. Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning 2 (1986) 1-42
7. B.D. Parello, CAR WARS: The (almost) birth of an expert system, AI Expert, vol. 3, 1988. pp. 60-64.
8. Kis T. On the complexity of the car-sequencing problem. Operations Research Letters 32 4 (2004) 331-336
9. Lopez P., and Roubellat F. Ordonnancement de la Production (2001), Hermès Science Publications, Paris
10. Davenport A., and Tsang E. Solving constraint satisfaction sequencing problems by iterative repair. Proceedings of the First International Conference on the practical Applications of Constraint Technologies and Logic Programming (1999), Practical Applications Company, London, England 345-357
11. Puchta M., and Gottlieb J. Solving car-sequencing problems by local optimization. In: Cagnoni S., Gotlieb J., Hart E., Middendorf M., and Raidl G.R. (Eds). Proceedings EvoWorkshops, Lecture Notes in Computer Science vol. 2279 (2002), Springer, Kinsale Ireland 132-142
12. Gottlieb J., Puchta M., and Solnon C. A study of greedy local search and ant colony optimization approaches for car-sequencing problems. In: Raidl G.R., et al. (Ed). Applications of Evolutionary Computing Lecture Notes in Computer Science (2003), Springer-Verlag, Heidelberg 246-257
13. T.L. Chew, J.M. David, A. Nguyen, Y. Tourbier, Solving constraint satisfaction problem with simulated annealing: The car-sequencing problem revisited, in: 12th International Conference on Artificial Intelligence, Expert Systems and Natural Language, 1991, pp. 405-416.
14. Warwick T., and Tsang E.P.K. Tackling car-sequencing problem using a generic genetic algorithm. Evolutionary Computation vol. 3, No. 3 (1995), MIT Press pp. 267-298
15. Smith K., Palaniswami M., and Krishnamoorthy M. Traditional heuristic versus Hopfield neural network approaches to a car-sequencing problem. European Journal of Operational Research 93 2 (1996) 300-317
16. Gravel M., Gagné C., and Price W.L. Review and comparison of three methods for the solution of the car-sequencing problem. Journal of the Operational Research Society 56 11 (2005) 1287-1295
17. Gagné C., Gravel M., and Price W.L. Solving real car-sequencing problems with ant colony optimization. European Journal of Operational Research 174 3 (2005) 1427-1448
18. Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 (1997) 53-66
19. Merkle D., and Middendorf M. An ant algorithm with a new pheromone evaluation rule for the total tardiness problem. In: Boers E.J.-W. (Ed). Lecture Notes in Computer Science vol. 2037 (1999), Springer-Verlag 287-296
20. Merkle D., Middendorf M., and Schmeck H. Ant colony optimization for resource constrained project scheduling. IEEE Transactions on Evolutionary Computation 6 (2002) 333-346
21. Lee J., Leung H., and Won H. Performance of a comprehensive and efficient constraint library using local search. In: Antoniou G., and Stanley J.K. (Eds). 11th Australian Joint Conference on Artificial Intelligence (1998), Springer-Verlag, Heidelberg Brisbane, Australia 191-202
22. I.P. Gent, T. Walsh, CSPLib: A benchmark library for constraints, in Research Reports of the APES Group, APES-09-1999, 1999, available from .
23. Conover W.J., and Iman R.L. Rank transformations as a bridge between parametric and nonparametric statistics. The American Statistician 35 (1981) 124-129