Iterated tabu search for the car sequencing problem |
| |
Authors: | Jean-François Cordeau Gilbert LaporteFederico Pasin |
| |
Institution: | HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7 |
| |
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. |
| |
Keywords: | Car sequencing problem Iterated local search Tabu search |
本文献已被 ScienceDirect 等数据库收录! |