A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints |
| |
Authors: | Celso C. Ribeiro,Daniel Aloise,Thiago F. Noronha,Caroline Rocha,Sebastiá n Urrutia |
| |
Affiliation: | 1. Department of Computer Science, Universidade Federal Fluminense, Rua Passo da Pátria 156, Niterói, RJ 24210-240, Brazil;2. Department of Computer Science, Catholic University of Rio de Janeiro, Rua Marquês de São Vicente 225, Rio de Janeiro, RJ 22453-900, Brazil;3. Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antônio Carlos 6627, Belo Horizonte, MG 31270-010, Brazil |
| |
Abstract: | We address a multi-objective version of the car sequencing problem, which consists in sequencing a given set of cars to be produced in a single day, minimizing the number of violations of assembly constraints and the number of paint color changes in the production line. We propose a set of heuristics for approximately solving this problem, based on the paradigms of the VNS and ILS metaheuristics, to which further intensification and diversification strategies have been added. Computational results on real-life test instances are reported. The work presented in this paper obtained the second prize in the ROADEF challenge 2005 sponsored by Renault. |
| |
Keywords: | Car sequencing problem Metaheuristics VNS ILS Heuristics |
本文献已被 ScienceDirect 等数据库收录! |
|