A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 981-992

  Ribeiro, Celso C ^a,b   Aloise, Daniel ^b   Noronha, Thiago F ^b   Rocha, Caroline ^a   Urrutia, Sebastián ^c  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Car sequencing problem; Heuristics; ILS; Metaheuristics; VNS

Indexed keywords

COLOR; COMPUTATION THEORY; CONSTRAINT THEORY; HEURISTIC METHODS; PAINTING;

CAR SEQUENCING PROBLEM; DIVERSIFICATION STRATEGIES; METAHEURISTICS; MULTI-OBJECTIVE VERSION; PRODUCTION LINES;

PROBLEM SOLVING;

EID: 44649122693     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.04.034     Document Type: Article

References (16)

1. Butaru M., and Habbas Z. The car-sequencing problem as n-ary CSP: Sequential and parallel solving. Lecture Notes in Computer Science 3809 (2005) 875-878
2. C. Solnon, V.-D. Cung, A. Nguyen, C. Artigues, The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem, European Journal of Operational Research, this issue, doi:10.1016/j.ejor.2007.04.033.
3. A.J. Davenport, E.P.K. Tsang, Solving constraint satisfaction sequencing problems by iterative repair, in: Proceedings of the First International Conference on the practical Applications of Constraint Technologies and Logic Programming, 1999, pp. 345-357.
4. M. Dincbas, H. Simonis, P. Hentenryck, Solving car sequencing problem in constraint logic programming, in: Proceedings of European Conference on AI, 1988, pp. 290-295.
5. I. Gent, Two results on car sequencing problems, Technical Report APES, University of St. Andrews, School of Computer Science, 1998.
6. Gottlieb J., Puchta M., and Solnon C. A study of greedy, local search and ant colony optimization approaches for car sequencing problems. Lecture Notes in Computer Science 2611 (2003) 246-257
7. Hansen P., and Mladenovic N. Variable neighborhood search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2002), Kluwer 145-184
8. Lee J.H.M., Leung H.F., and Won H.W. Performance of a comprehensive and efficient constraint library using local search. Lecture Notes in Artificial Intelligence 1502 (1998) 191-202
9. Lourenço H.R., Martin O.C., and Stützle T. Iterated local search. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2002), Kluwer 321-353
10. A. Nguyen, Challenge ROADEF'2005: Car Sequencing Problem. (last visited on 11.12.2005).
11. Parello B.D., Kabat W.C., and Wos L. Job-shop scheduling using automated reasoning: A case study of the car sequencing problem. Journal of Automated Reasoning 2 (1986) 1-42
12. Puchta M., and Gottlieb J. Solving car sequencing problems by local optimization. Lecture Notes in Computer Science 2279 (2002) 132-142
13. Schrage L. A more portable FORTRAN random number generator. ACM Transactions on Mathematical Software 5 (1979) 132-138
14. C. Solnon, Solving permutation constraint satisfaction problems with artificial ants, in: Proceedings of the European Conference on Artificial Intelligence, 2000, pp. 118-122.
15. Tsang E. Foundations of Constraint Satisfaction (1993), Academic Press
16. Warnick T., and Tsang E. Tackling car sequencing problems using a genetic algorithm. Evolutionary Computation 3 (1995) 267-298