IDEAS home Printed from
   My bibliography  Save this article

Greedy approach and multi-criteria simulated annealing for the car sequencing problem


  • Briant, Olivier
  • Naddef, Denis
  • Mounié, Grégory


In this paper we describe our approach to the car sequencing problem which was the topic of the ROADEF'05 challenge. A full description of the problem is given in a separate paper of this same issue of this journal. We decided to tackle the problem via simulated annealing. Our algorithm takes the three criteria in decreasing order of importance and optimize each time on a criterion without authorizing degradation of the objective on previously optimized criteria. There is a large panel of moves to choose from and we tried to choose the moves using dynamic probabilities which in some sense take into account the rate of success of each move for the given instance. We report the numerical results on the instances provided during that challenge.

Suggested Citation

  • Briant, Olivier & Naddef, Denis & Mounié, Grégory, 2008. "Greedy approach and multi-criteria simulated annealing for the car sequencing problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 993-1003, December.
  • Handle: RePEc:eee:ejores:v:191:y:2008:i:3:p:993-1003

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

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


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

    Cited by:

    1. 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.
    2. Parames Chutima & Sathaporn Olarnviwatchai, 0. "A multi-objective car sequencing problem on two-sided assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 0, pages 1-20.

    More about this item


    Access and download statistics


    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:eee:ejores:v:191:y:2008:i:3:p:993-1003. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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.

    We have no references for this item. You can help adding them by using 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.