A column generation approach and new bounds for the car sequencing problem
作者： Eivind Jahren , Roberto Asín Achá
DOI: 10.1007/S10479-017-2663-4
关键词:
摘要: The subject of the 2005 ROADEF challenge was a variation car scheduling problem based on needs Renaultfactories. In this paper we revisit to investigate how further contributions can be made in order close gap between exact and heuristic methods that exists for problem. For benchmark set used final round competition report new lower bounds 7 out 19 instances by using an improved ILP formulation We also present column generation method solving which outperforms branch-and-bound obtaining upper these problems.
springer.com
sci-hub.se 参考文章(12)
Matthias Prandtstetter, Günther R. Raidl, A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search. ,(2005)
Armin Biere, Adaptive restart strategies for conflict driven SAT solvers theory and applications of satisfiability testing. pp. 28- 33 ,(2008) , 10.1007/978-3-540-79719-7_4
J. H. M. Lee, H. F. Leung, H. W. Won, Performance of a Comprehensive and Efficient Constraint Library Based on Local Search australian joint conference on artificial intelligence. pp. 191- 202 ,(1998) , 10.1007/BFB0095052
Olivier Briant, Denis Naddef, Grégory Mounié, Greedy approach and multi-criteria simulated annealing for the car sequencing problem European Journal of Operational Research. ,vol. 191, pp. 993- 1003 ,(2008) , 10.1016/J.EJOR.2007.04.052
Thierry Benoist, Soft car sequencing with colors: Lower bounds and optimality proofs European Journal of Operational Research. ,vol. 191, pp. 957- 971 ,(2008) , 10.1016/J.EJOR.2007.04.035
Christine Solnon, Van Dat Cung, Alain Nguyen, Christian Artigues, The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF’2005 challenge problem European Journal of Operational Research. ,vol. 191, pp. 912- 927 ,(2008) , 10.1016/J.EJOR.2007.04.033
Matthias Prandtstetter, Günther R. Raidl, An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem European Journal of Operational Research. ,vol. 191, pp. 1004- 1022 ,(2008) , 10.1016/J.EJOR.2007.04.044
Jens Gottlieb, Markus Puchta, Christine Solnon, A study of greedy, local search, and ant colony optimization approaches for car sequencing problems Lecture Notes in Computer Science. ,vol. 2611, pp. 246- 257 ,(2003) , 10.1007/3-540-36605-9_23
Bart Selman, Henry Kautz, Carla P. Gomes, Boosting combinatorial search through randomization national conference on artificial intelligence. pp. 431- 437 ,(1998)
Bertrand Estellon, Frédéric Gardi, Karim Nouioua, Two local search approaches for solving real-life car sequencing problems European Journal of Operational Research. ,vol. 191, pp. 928- 944 ,(2008) , 10.1016/J.EJOR.2007.04.043