IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v159y2008i1p233-24410.1007-s10479-007-0278-x.html
   My bibliography  Save this article

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

Author

Listed:
  • Joaquín Bautista
  • Jordi Pereira
  • Belarmino Adenso-Díaz

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. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Joaquín Bautista & Jordi Pereira & Belarmino Adenso-Díaz, 2008. "A Beam Search approach for the optimization version of the Car Sequencing Problem," Annals of Operations Research, Springer, vol. 159(1), pages 233-244, March.
    • Handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:233-244:10.1007/s10479-007-0278-x
    DOI: 10.1007/s10479-007-0278-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0278-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0278-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bautista, J. & Companys, R. & Corominas, A., 1996. "Heuristics and exact algorithms for solving the Monden problem," European Journal of Operational Research, Elsevier, vol. 88(1), pages 101-113, January.
    2. Gagne, Caroline & Gravel, Marc & Price, Wilson L., 2006. "Solving real car sequencing problems with ant colony optimization," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1427-1448, November.
    3. M Gravel & C Gagné & W L Price, 2005. "Review and comparison of three methods for the solution of the car sequencing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(11), pages 1287-1295, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pontes, Lara & Neves, Carlos & Subramanian, Anand & Battarra, Maria, 2024. "The maximum length car sequencing problem," European Journal of Operational Research, Elsevier, vol. 316(2), pages 707-717.
    2. Yuan Sun & Samuel Esler & Dhananjay Thiruvady & Andreas T. Ernst & Xiaodong Li & Kerri Morgan, 2024. "Instance space analysis for the car sequencing problem," Annals of Operations Research, Springer, vol. 341(1), pages 41-69, October.
    3. Bautista, Joaquín & Alfaro, Rocío & Batalla, Cristina, 2015. "Modeling and solving the mixed-model sequencing problem to improve productivity," International Journal of Production Economics, Elsevier, vol. 161(C), pages 83-95.
    4. Uli Golle & Franz Rothlauf & Nils Boysen, 2015. "Iterative beam search for car sequencing," Annals of Operations Research, Springer, vol. 226(1), pages 239-254, March.
    5. Bautista, Joaquín & Cano, Alberto & Alfaro, Rocío, 2012. "Models for MMSP-W considering workstation dependencies: A case study of Nissan’s Barcelona plant," European Journal of Operational Research, Elsevier, vol. 223(3), pages 669-679.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "Sequencing mixed-model assembly lines: Survey, classification and model critique," European Journal of Operational Research, Elsevier, vol. 192(2), pages 349-373, January.
    2. Bautista, Joaquín & Cano, Alberto, 2011. "Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules," European Journal of Operational Research, Elsevier, vol. 210(3), pages 495-513, May.
    3. Boysen, Nils & Fliedner, Malte, 2007. "Comments on "Solving real car sequencing problems with ant colony optimization"," European Journal of Operational Research, Elsevier, vol. 182(1), pages 466-468, October.
    4. C Gagné & M Gravel & S Morin & W L Price, 2008. "Impact of the pheromone trail on the performance of ACO algorithms for solving the car-sequencing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1077-1090, August.
    5. Uli Golle & Franz Rothlauf & Nils Boysen, 2015. "Iterative beam search for car sequencing," Annals of Operations Research, Springer, vol. 226(1), pages 239-254, March.
    6. Solnon, Christine & Cung, Van Dat & Nguyen, Alain & Artigues, Christian, 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, Elsevier, vol. 191(3), pages 912-927, December.
    7. Fliedner, Malte & Boysen, Nils, 2008. "Solving the car sequencing problem via Branch & Bound," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1023-1042, December.
    8. N Boysen & M Fliedner, 2006. "Comment on M Gravel, C Gagné and WL Price (2005). Review and comparison of three methods for the solution of the car sequencing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(12), pages 1497-1498, December.
    9. Cordeau, Jean-François & Laporte, Gilbert & Pasin, Federico, 2008. "Iterated tabu search for the car sequencing problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 945-956, December.
    10. Yuan Sun & Samuel Esler & Dhananjay Thiruvady & Andreas T. Ernst & Xiaodong Li & Kerri Morgan, 2024. "Instance space analysis for the car sequencing problem," Annals of Operations Research, Springer, vol. 341(1), pages 41-69, October.
    11. Bautista, Joaquín & Alfaro, Rocío & Batalla, Cristina, 2015. "Modeling and solving the mixed-model sequencing problem to improve productivity," International Journal of Production Economics, Elsevier, vol. 161(C), pages 83-95.
    12. Golle, Uli & Rothlauf, Franz & Boysen, Nils, 2014. "Car sequencing versus mixed-model sequencing: A computational study," European Journal of Operational Research, Elsevier, vol. 237(1), pages 50-61.
    13. Elif Elcin Gunay & Ufuk Kula, 2017. "A stochastic programming model for resequencing buffer content optimisation in mixed-model assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2897-2912, May.
    14. Ioanna Makarouni & John Psarras & Eleftherios Siskos, 2015. "Interactive bicriterion decision support for a large scale industrial scheduling system," Annals of Operations Research, Springer, vol. 227(1), pages 45-61, April.
    15. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    16. Boysen, Nils & Scholl, Armin & Wopperer, Nico, 2012. "Resequencing of mixed-model assembly lines: Survey and research agenda," European Journal of Operational Research, Elsevier, vol. 216(3), pages 594-604.
    17. Florian Jaehn & Sergey Kovalev & Mikhail Y. Kovalyov & Erwin Pesch, 2014. "Multiproduct batching and scheduling with buffered rework: The case of a car paint shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(6), pages 458-471, September.
    18. Caridi, Maria & Sianesi, Andrea, 2000. "Multi-agent systems in production planning and control: An application to the scheduling of mixed-model assembly lines," International Journal of Production Economics, Elsevier, vol. 68(1), pages 29-42, October.
    19. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2009. "The product rate variation problem and its relevance in real world mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 197(2), pages 818-824, September.
    20. Tobias Kreiter & Ulrich Pferschy, 2020. "Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1141-1177, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:233-244:10.1007/s10479-007-0278-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.