IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v226y2015i1p239-25410.1007-s10479-014-1733-0.html
   My bibliography  Save this article

Iterative beam search for car sequencing

Author

Listed:
  • Uli Golle
  • Franz Rothlauf
  • Nils Boysen

Abstract

The car sequencing (CS) problem seeks a production sequence of different car models launched down a mixed-model assembly line. The models can be distinguished by selected options, e.g., sun roof yes/no. For every option, CS applies a so-called sequencing rule to avoid that consecutive models requiring this option lead to a work overload of the respective assembly operators. The aim is to find a sequence with minimum number of sequencing rule violations. This paper presents a graph representation of the problem and develops an exact solution approach based on iterative beam search. Furthermore, existing lower bounds are improved and applied. The experimental results reveal, that our solution approach is superior compared to the currently best known exact solution procedure. Our algorithm can even be applied as an efficient heuristic on problems of real-world size with up to 400 cars, where it shows competitive results compared to the current best known solutions. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:226:y:2015:i:1:p:239-254:10.1007/s10479-014-1733-0
    DOI: 10.1007/s10479-014-1733-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-014-1733-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-014-1733-0?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. Prandtstetter, Matthias & Raidl, Günther R., 2008. "An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1004-1022, December.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Estellon, Bertrand & Gardi, Frédéric & Nouioua, Karim, 2008. "Two local search approaches for solving real-life car sequencing problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 928-944, December.
    7. Benoist, Thierry, 2008. "Soft car sequencing with colors: Lower bounds and optimality proofs," European Journal of Operational Research, Elsevier, vol. 191(3), pages 957-971, December.
    8. 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.
    9. 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.
    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. Thiago Cantos Lopes & Celso Gustavo Stall Sikora & Adalberto Sato Michels & Leandro Magatão, 2020. "Mixed-model assembly lines balancing with given buffers and product sequence: model, formulation comparisons, and case study," Annals of Operations Research, Springer, vol. 286(1), pages 475-500, March.
    2. 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.
    3. Rui Zhang, 2017. "Environment-Aware Production Scheduling for Paint Shops in Automobile Manufacturing: A Multi-Objective Optimization Approach," IJERPH, MDPI, vol. 15(1), pages 1-32, December.
    4. 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.

    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. 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.
    2. Parames Chutima & Sathaporn Olarnviwatchai, 2018. "A multi-objective car sequencing problem on two-sided assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1617-1636, October.
    3. 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.
    4. Elahi, Mirza M. Lutfe & Rajpurohit, Karthik & Rosenberger, Jay M. & Zaruba, Gergely & Priest, John, 2015. "Optimizing real-time vehicle sequencing of a paint shop conveyor system," Omega, Elsevier, vol. 55(C), pages 61-72.
    5. 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.
    6. Eivind Jahren & Roberto Asín Achá, 2018. "A column generation approach and new bounds for the car sequencing problem," Annals of Operations Research, Springer, vol. 264(1), pages 193-211, May.
    7. 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.
    8. 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.
    9. 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.
    10. Golle, Uli & Boysen, Nils & Rothlauf, Franz, 2010. "Analysis and design of sequencing rules for car sequencing," European Journal of Operational Research, Elsevier, vol. 206(3), pages 579-585, November.
    11. Iwona Paprocka & Damian Krenczyk, 2023. "On Energy Consumption and Productivity in a Mixed-Model Assembly Line Sequencing Problem," Energies, MDPI, vol. 16(20), pages 1-19, October.
    12. Staeblein, Thomas & Aoki, Katsuki, 2015. "Planning and scheduling in the automotive industry: A comparison of industrial practice at German and Japanese makers," International Journal of Production Economics, Elsevier, vol. 162(C), pages 258-272.
    13. Thorben Krueger & Achim Koberstein & Norbert Bittner, 2022. "Anticipating technical car sequencing rules in the master production scheduling of mixed-model assembly lines," Flexible Services and Manufacturing Journal, Springer, vol. 34(2), pages 351-407, June.
    14. Buergin, Jens & Hammerschmidt, Andreas & Hao, Han & Kramer, Sergej & Tutsch, Hansjoerg & Lanza, Gisela, 2019. "Robust order planning with planned orders for multi-variant series production in a production network," International Journal of Production Economics, Elsevier, vol. 210(C), pages 107-119.
    15. 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.
    16. Karim Aroui & Gülgün Alpan & Yannick Frein, 2017. "Minimising work overload in mixed-model assembly lines with different types of operators: a case study from the truck industry," International Journal of Production Research, Taylor & Francis Journals, vol. 55(21), pages 6305-6326, November.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:226:y:2015:i:1:p:239-254:10.1007/s10479-014-1733-0. 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.