Skip to main content
SpringerLink
Log in

A Beam Search approach for the optimization version of the Car Sequencing Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Car Sequencing Problem (CSP) is a feasibility problem that has attracted the attention of the Constraint Programming community for a number of years now. In this paper, a new version (opt-CSP) that extends the original problem is defined, converting this into an optimization problem in which the goal is to satisfy the typical hard constraints. This paper presents a solution procedure for opt-CSP using Beam Search. Computational results are presented using public instances that verify the goodness of the procedure and demonstrate its excellent performance in obtaining feasible solutions for the majority of instances while satisfying the new constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Gent, I. (1998). Two results on car-sequencing problems. Technical report APES-02-1998.

  • 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.

    Chapter  Google Scholar 

  • 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.

    Article  Google Scholar 

  • López, P., & Roubellat, F. (2001). Ordonnancement de la production. Paris: Hermès Science.

    Google Scholar 

  • Lowerre, B. T. (1976). The HARPY speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh.

  • Monden, Y. (1983). Toyota production system. Norcross: Institute of Industrial Engineers Press.

    Google Scholar 

  • Morton, T. E., & Pentico, D. W. (1993). Heuristic scheduling systems. New York: Wiley.

    Google Scholar 

  • Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26, 35–62.

    Article  Google Scholar 

  • 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.

    Chapter  Google Scholar 

  • Tsang, E. (1993). Foundations of constraint satisfaction. San Diego: Academic Press.

    Google Scholar 

  • Van Hentenryck, P., Simonis, H., & Dincbas, M. (1992). Constraint satisfaction using constraint logic programming. Artificial Intelligence, 58, 113–159.

    Article  Google Scholar 

  • 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).

Download references

Author information

Authors and Affiliations

  1. Nissan Chair-UPC, Escuela Técnica Superior de Ingeniería Industrial de Barcelona, Universidad Politécnica de Catalunya, Avda. Diagonal 647, Planta 7, 08028, Barcelona, Spain

    Joaquín Bautista

  2. Departamento de Organización de Empresas, Escuela Técnica Superior de Ingeniería Industrial de Barcelona, Universidad Politécnica de Catalunya, Avda. Diagonal 647, Planta 7, 08028, Barcelona, Spain

    Jordi Pereira

  3. Escuela Politécnica Superior de Ingeniería de Gijón, Campus de Viesques, Universidad de Oviedo, 33204, Gijón, Spain

    Belarmino Adenso-Díaz

Authors
  1. Joaquín Bautista
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jordi Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Belarmino Adenso-Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joaquín Bautista.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bautista, J., Pereira, J. & Adenso-Díaz, B. A Beam Search approach for the optimization version of the Car Sequencing Problem. Ann Oper Res 159, 233–244 (2008). https://doi.org/10.1007/s10479-007-0278-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-007-0278-x

Keywords

Search

Navigation