IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v56y2005i11d10.1057_palgrave.jors.2601955.html
   My bibliography  Save this article

Review and comparison of three methods for the solution of the car sequencing problem

Author

Listed:
  • M Gravel

    (Université du Québec à Chicoutimi)

  • C Gagné

    (Université du Québec à Chicoutimi)

  • W L Price

    (Université Laval)

Abstract

The car sequencing problem is the ordering of the production of a list of vehicles which are of the same type, but which may have options or variations that require higher work content and longer operation times for at least one assembly workstation. A feasible production sequence is one that does not schedule vehicles with options in such a way that one or more workstations are overloaded. In variations of the problem, other constraints may apply. We describe and compare three approaches to the modeling and solution of this problem. The first uses integer programming to model and solve the problem. The second approaches the question as a constraint satisfaction problem (CSP). The third method proposes an adaptation of the Ant Colony Optimization for the car sequencing problem. Test-problems are drawn from CSPLib, a publicly available set of problems available through the Internet. We quote results drawn both from our own work and from other research. The literature review is not intended to be exhaustive but we have sought to include representative examples and the more recent work. Our conclusions bear on likely research avenues for the solution of problems of practical size and complexity. A new set of larger benchmark problems was generated and solved. These problems are available to other researchers who may wish to solve them using their own methods.

Suggested Citation

  • 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.
  • Handle: RePEc:pal:jorsoc:v:56:y:2005:i:11:d:10.1057_palgrave.jors.2601955
    DOI: 10.1057/palgrave.jors.2601955
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601955
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2601955?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. J Lockledge & D Mihailidis & J Sidelko & K Chelst, 2002. "Prototype fleet optimization model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(8), pages 833-841, August.
    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. 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.
    2. 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.
    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. 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.
    5. Zhang, Rui & Chang, Pei-Chann & Wu, Cheng, 2013. "A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production," International Journal of Production Economics, Elsevier, vol. 145(1), pages 38-52.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Morin, Sara & Gagné, Caroline & Gravel, Marc, 2009. "Ant colony optimization with a specialized pheromone trail for the car-sequencing problem," European Journal of Operational Research, Elsevier, vol. 197(3), pages 1185-1191, September.
    12. 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.
    13. 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.
    14. 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.
    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. 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.
    17. 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.
    18. 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.

    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. Nepal, Bimal & Lassan, Gregg & Drow, Baba & Chelst, Kenneth, 2009. "A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company," European Journal of Operational Research, Elsevier, vol. 193(1), pages 272-281, February.

    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:pal:jorsoc:v:56:y:2005:i:11:d:10.1057_palgrave.jors.2601955. 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.palgrave-journals.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.