A column generation approach and new bounds for the car sequencing problem
- 136 Downloads
The subject of the 2005 ROADEF challenge was a variation of the car scheduling problem based on the needs of the Renaultfactories. In this paper we revisit this problem to investigate how further contributions can be made in order to close the gap between exact and heuristic methods that exists for this problem. For the benchmark set used in the final round of the competition we report new lower bounds for 7 out of the 19 instances by using an improved ILP formulation of the problem. We also present a new column generation based exact method for solving the ILP problem which outperforms branch-and-bound in obtaining upper bounds for these problems.
KeywordsCombinatorial optimization Industrial car sequencing Integer linear programming Column generation
Roberto Asín’s research was funded by CONICYT, Chile, under FONDECYT project 11121220.
- Biere, A. (2008). Adaptive restart control for conflict driven sat solvers. In Proceedings of SAT, 8.Google Scholar
- Gomes, C.P., Selman, B., & Kautz, H. (1998). Boosting combinatorial search through randomization.Google Scholar
- Gottlieb, J., Puchta, M., & Solnon, C. (2003) A study of greedy, local search, and ant colony optimization approaches for car sequencing problems. In Applications of evolutionary computing. Springer, pp. 246–257.Google Scholar
- Lee, J. H-M., Leung, H-F., & Won, H.-W. (1998). Performance of a comprehensive and efficient constraint library based on local search. In Advanced topics in artificial intelligence. Springer, pp. 191–202.Google Scholar
- Prandtstetter, M., & Raidl, G. (2005). A variable neighborhood search approach for solving the car sequencing problem. In Proceedings of the XVIII mini EURO conference on VNS.Google Scholar