An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem

Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline Rocha and Sebastián Urrutia

European Journal of Operational Research, 2008, vol. 191, issue 3, pages 596-611

Abstract: The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of minimizing the number of violations of assembly constraints has a stronger weight than the minimization of the number of paint color changes. We present and describe in details a VNS/ILS approach for approximately solving this problem. Computational results on real-life test instances are reported. The work presented in this paper obtained the second prize in the challenge ROADEF'2005 sponsored by Renault.

Downloads: (external link)
http://www.sciencedi ... 29b5e604213327628112
Full text for ScienceDirect subscribers only

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

Access Statistics for this article

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

More articles in European Journal of Operational Research from Elsevier
Series data maintained by Heidi Boesdal ().