Solving real car sequencing problems with ant colony optimization

European Journal of Operational Research

Volumn 174, Issue 3, 2006, Pages 1427-1448

  Gagné, Caroline ^a   Gravel, Marc ^a   Price, Wilson L ^b  

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

^b UNIVERSITÉ LAVAL   (Canada)

Author keywords

Ant colony optimization; Car sequencing problem; Integer linear programming

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; SCHEDULING;

ANT COLONY OPTIMIZATION; CAR SEQUENCING PROBLEM; INTEGER LINEAR PROGRAMMING; METAHEURISTIC;

PROBLEM SOLVING;

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

References (23)

1. Chase R.B., Jacobs F.R., and Aquilano N.J. Operations management for competitive advantage. 10th ed. (2004), McGraw-Hill 765pp
2. 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.
3. 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
4. Davenport A., Tsang E., Zhu K., and Wang C. GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. Proceedings of AAAI'94 (1994), AAAI Press, Seattle, Washington, Menlo Park, California 325-330
5. Dincbas M., Simonis H., and Van Hentenryck P. Solving the car-sequencing problem in constraint logic programming. In: Kodratoff Y. (Ed). Proceedings of the European conference on artificial intelligence (ECAI-88), Munich, Germany (1988), Pitmann Publishing, London 290-295
6. Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. BioSystems 43 (1997) 73-81
7. Drexl A., and Kimms A. Sequencing JIT mixed-model assembly lines under station-load and part-usage constraints. Management Science 47 3 (2001) 480-491
8. Ertay T. Simulation approach in comparison of a pull system in a cell production system with a push system in a conventional production system according to flexible cost: A case study. International Journal of Production Economics 56-57 (1998) 145-155
9. Gagné C., Gravel M., and Price W.L. Algorithme d'optimisation par colonie de fourmis avec matrices de visibilité multiples pour la résolution d'un problème d'ordonnancement industriel. Information Systems and Operational Research (INFOR) 40 2 (2002) 259-276
10. C. Gagné, M. Gravel, W.L. Price, Using metaheuristic compromise programming for the solution of multiple objective scheduling problems, Journal of the Operational Research Society, in press.
11. I.P. Gent, T. Walsh, CSPLib: A benchmark library for constraints, Research Reports of the APES Group, APES-09-1999, 1999. Available from: .
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. M. Gravel, C. Gagné, W.L. Price, Review and comparison of three methods for the solution of the car-sequencing problem, Journal of the Operational Research Society, in press.
14. Gravel M., Price W.L., and Gagné C. Scheduling continuous casting of aluminum using a multiple-objective ant colony optimization metaheuristic. European Journal of Operational Research 143 1 (2002) 218-229
15. Kis T. On the complexity of the car sequencing problem. Operations Research Letters 32 4 (2004) 331-336
16. Lee J., Leung H., and Won H. Performance of a comprehensive and efficient constraint library using local search. In: Antoniou G., and Slaney J.K. (Eds). 11th Australian Joint Conference on Artificial Intelligence (1998), Springer-Verlag, Heidelberg, Brisbane, Australia 191-202
17. Lopez P., and Roubellat F. Ordonnancement de la Production (2001), Hermès Science Publications, Paris 431pp
18. Parello B.D. CAR WARS: The (almost) birth of an expert system. AI Expert 3 (1988) 60-64
19. 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
20. Puchta M., and Gottlieb J. Solving car sequencing problems by local optimization. In: Cagnoni S., Gottlieb 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
21. 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
22. Solnon C. Solving car sequencing problems with artificial ants. In: Werner H. (Ed). European conference on artificial intelligence (ECAI-2000) (2000), IOS Press, Berlin, Germany 118-122
23. Warwick T., and Tsang E.P.K. Tackling car sequencing problem using a generic genetic algorithm. Evolutionary Computation 3 3 (1995) 267-298