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

Olivier Briant, Denis Naddef and Grégory Mounié

European Journal of Operational Research, 2008, vol. 191, issue 3, 993-1003

Abstract: 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.

Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00452-3
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:191:y:2008:i:3:p:993-1003

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().