An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 1004-1022

  Prandtstetter, Matthias ^a   Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Car sequencing problem; Hybrid meta heuristics; Integer linear programming; Variable neighborhood search

Indexed keywords

C (PROGRAMMING LANGUAGE); DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEARIZATION; NONLINEAR PROGRAMMING;

CAR SEQUENCING PROBLEM; INTEGER LINEAR PROGRAMMING (ILP); PRODUCTION LINES; VARIABLE NEIGHBORHOOD SEARCH (VNS);

LINEAR PROGRAMMING;

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

References (13)

1. I.P. Gent, Two results on car-sequencing problems, Technical Report, APES-02-1998, Department of Computer Science, University of Strathclyde, UK, April 1998.
2. LIB: A benchmark library for constraints, Technical Report, APES-09-1999, Department of Computer Science, University of Strathclyde, UK, 1999.
3. Gottlieb J., Puchta M., and Solnon C. A study of greedy, local search, and ant colony optimization approaches for car sequencing problems. Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2003. In: Raidl G.R., et al. (Ed). Lecture Notes in Computer Science vol. 2611 (2003), Springer-Verlag, Berlin, Heidelberg 246-257
4. 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
5. P. Hansen, N. Mladenović, A tutorial on variable neighborhood search, Technical Report G-2003-46, Les Cahiers du GERAD, HEC Montréal and GERAD, Canada, 2003.
6. B. Hu, Interaktive Reihenfolgeplanung für die Automobilindustrie, Master's thesis, Vienna University of Technology, Vienna, Austria, 2004.
7. A. Jaszkiewicz, P. Kominek, M. Kubiak, Adaptation of the genetic local search algorithm to a car sequencing problem, in: 7th National Conference on Evolutionary Algorithms and Global Optimization, Kazimierz Dolny, Poland, 2004, pp. 67-74.
8. Kis T. On the complexity of the car sequencing problem. Operations Research Letters 32 4 (2004) 331-335
9. A. Nguyen, Challenge ROADEF'2005: Car sequencing problem. online reference at http://www.prism.uvsq.fr/~vdc/ROADEF/CHALLENGES/2005/ (last visited October 31, 2006).
10. Perron L., and Shaw P. Combining forces to solve the car sequencing problem. In: Régin J.-C., and Rueher M. (Eds). CPAIOR. Lecture Notes in Computer Science vol. 3011 (2004), Springer 225-239
11. M. Prandtstetter, Exact and heuristic methods for solving the Car Sequencing Problem. Master's thesis, Vienna University of Technology, Vienna, Austria, 2005.
12. M. Prandtstetter, G.R. Raidl, A variable neighborhood search approach for solving the car sequencing problem, in: Proceedings of the XVIII Mini EURO Conference on VNS, Tenerife, Spain, 2005.
13. Puchta M., and Gottlieb J. Solving car sequencing problems by local optimization. Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002. Lecture Notes in Computer Science vol. 2279 (2002), Springer-Verlag, London, UK 132-142