A beam search approach for the optimization version of the car sequencing problem

Annals of Operations Research

Volumn 159, Issue 1, 2008, Pages 233-244

  Bautista, Joaquín ^a   Pereira, Jordi ^a   Adenso Díaz, Belarmino ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Beam search; Car sequencing problem; Scheduling

Indexed keywords

EID: 38349129725     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0278-x     Document Type: Article

References (19)

1. Bautista, J., Companys, R., & Corominas, A. (1996). Heuristics and exact algorithms for solving the Monden problem. European Journal of Operational Research, 88(1), 101-113.
2. Blum, C. (2005). Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & Operations Research, 32(6), 1565-1591.
3. Butaru, M., & Habbas, Z. (2005). Solving the Car Sequencing Problem as a non-binary CSP. In P. van Beek (Ed.), Lecture notes in computer science : Vol. 3709. Principles and practice of constraint programming: CP2005 (p. 840). 11th international conference, Sitges, Spain, October 1-5 2005. Berlin: Springer.
4. Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10(1), 89-104.
5. Dincbas, M., Simonis, H., & van Hentenryck, P. (1988). Solving the car sequencing problem in constraint logic programming. In Proceedings of the 8th European conference on artificial intelligence, ECAI-88, Munich (pp. 290-295). London: Pitman.
6. Drexl, A., Kimms, A., & Matthießen, L. (2006). Algorithms for the car sequencing and the level scheduling problem. Journal of Scheduling, 9(2), 153-176.
7. Gagné, C., Gravel, M., & Price, W. L. (2006). Solving real car sequencing problems with ant colony optimization. European Journal of Operational Research, 174, 1427-1448.
8. Gent, I. (1998). Two results on car-sequencing problems. Technical report APES-02-1998.
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. Cagnori et al. (Eds.), Lecture notes in computer science : Vol. 2611. Applications of evolutionary computing (pp. 246-257). Berlin: Springer.
10. Gravel, M., Gagné, 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. López, P., & Roubellat, F. (2001). Ordonnancement de la production. Paris: Hermès Science.
12. Lowerre, B. T. (1976). The HARPY speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh.
13. Monden, Y. (1983). Toyota production system. Norcross: Institute of Industrial Engineers Press.
14. Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling systems. New York: Wiley.
15. Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 35-62.
16. Regin, J. C., & Puget, J. F. (1997). A filtering algorithm for global sequencing constraints. In Lecture notes in computer science : Vol. 1330. Principles and practice of constraint programming, CP-97 (pp. 32-46). Berlin: Springer.
17. Tsang, E. (1993). Foundations of constraint satisfaction. San Diego: Academic Press.
18. Van Hentenryck, P., Simonis, H., & Dincbas, M. (1992). Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58, 113-159.
19. Zufferey, N., Studer, M., & Silver, E. A. (2006). Tabu search for a car sequencing problem. In Proceedings of the 19 international Florida artificial intelligent research society conference, FALIRS 2006 (pp. 457-462).