Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481273 | European Journal of Operational Research | 2008 | 12 Pages |
Abstract
This paper introduces an iterated tabu search heuristic for the daily car sequencing problem in which a set of cars must be sequenced so as to satisfy requirements from the paint shop and the assembly line. The iterated tabu search heuristic combines a classical tabu search with perturbation operators that help escape from local optima. The resulting heuristic is flexible, easy to implement, and fast. It has produced very good results on a set of test instances provided by the French car manufacturer Renault.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jean-François Cordeau, Gilbert Laporte, Federico Pasin,