Iterative beam search for car sequencing

Annals of Operations Research

Volumn 226, Issue 1, 2015, Pages 239-254

  Golle, Uli ^a   Rothlauf, Franz ^a   Boysen, Nils ^b  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Car sequencing; Iterative beam search; Mixed model assembly lines

Indexed keywords

EID: 84925515465     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-014-1733-0     Document Type: Article

References (22)

1. Bautista, J., Pereira, J., & Adenso-Diaz, B. (2008). A beam search approach for the optimization version of the car sequencing problem. Annals of Operations Research, 159, 233–244.
2. Benoist, T. (2008). Soft car sequencing with colors: Lower bounds and optimality proofs. European Journal of Operational Research, 191(3), 957–971.
3. Boysen, N., Fliedner, M., & Scholl, A. (2009). Sequencing mixed-model assembly lines: Survey, classification and model critique. European Journal of Operational Research, 192(2), 349–373.
4. Boysen, N., Golle, U., & Rothlauf, F. (2011). The car resequencing problem with pull-off tables. BuR - Business Research, 4(2), 1–17.
5. Estellon, B., Gardi, F., & Nouioua, K. (2008). Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research, 191(3), 928–944.
6. Fliedner, M., & Boysen, N. (2008). Solving the car sequencing problem via branch & bound. European Journal of Operational Research, 191(3), 1023–1042.
7. Gagne, C., Gravel, M., & Price, W. (2006). Solving real car sequencing problems with ant colony optimization. European Journal of Operational Research, 174(3), 1427–1448.
8. Gent, I. P. (1998). Two results on car-sequencing problems. APES research report 02–1998. Glasgow: Department of Computer Science, University of Strathclyde.
9. Gottlieb, J., Puchta, M., & Solnon, C. (2003). A study of greedy, local search, and ant colony optimization approaches for car sequencing problems. In S. Cagnoni, C. Johnson, J. Cardalda, E. Marchiori, D. Corne, J. A. Meyer, J. Gottlieb, M. Middendorf, A. Guillot, G. Raidl, & E. Hart (Eds.), EvoWorkshops 2003, LNCS 2611 (pp. 246–257). Berlin Heidelberg: Springer.
10. Gravel, M., Gagne, C., & Price, W. L. (2005). Review and comparison of three methods for the solution of the car sequencing problem. Journal of the Operational Research Society, 56(11), 1287–1295.
11. Jaszkiewicz, A., Kominek, P., & Kubiak, M. (2004). 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, pp. 67–74.
12. Kis, T. (2004). On the complexity of the car sequencing problem. Operations Research Letters, 32(4), 331–335.
13. Klein, R., & Scholl, A. (1999). Scattered branch and bound: An adaptive search strategy applied to resource-constrained project scheduling. Central European Journal of Operations Research, 7, 177–201.
14. Lowerre, B. (1976). The harpy speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, USA.
15. Parrello, B. D., Kabat, W. C., & Wos, L. (1986). Job-shop scheduling using automated reasoning: A case study of the car-sequencing problem. Journal of Automated Reasoning, 2(1), 1–42.
16. Perron, L., & Shaw, P. (2004). Combining forces to solve the car sequencing problem. In J. C. Regin & M. Rueher (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, LNCS 3011 (pp. 225–239). Berlin Heidelberg: Springer.
17. Prandtstetter, M., & Raidl, G. (2008). An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. European Journal of Operational Research, 191(3), 1004–1022.
18. Puchta, M. & Gottlieb, J. (2002). Solving car sequencing problems by local optimization. In Proceedings of the applications of evolutionary computing on evoworkshops 2002, LNCS, Vol. 2279 (pp. 132–142). Berlin, Heidelberg: Springer.
19. Solnon, C., Cung, V., Nguyen, A., & Artigues, C. (2008). 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, 191(3), 912–927.
20. Warwick, T., & Tsang, E. (1995). Tackling car sequencing problems using a generic genetic algorithm. Evolutionary Computation, 3(3), 267–298.
21. Wester, L. & Kilbridge, M. D. (1964). The assembly line model-mix sequencing problem. In Proceedings of the Third International Conference on Operations Research.
22. Zinflou, A., Gagne, C., & Gravel, M. (2007). Crossover operators for the car sequencing problem. In C. Cotta & J. van Hemert (Eds.), Proceedings of the 7th European conference on evolutionary computation in combinatorial optimization, EvoCOP 2007, LNCS (Vol. 4446, pp. 229–239). Valencia, Spain.