Greedy approach and multi-criteria simulated annealing for the car sequencing problem

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 993-1003

  Briant, Olivier ^a   Naddef, Denis ^a   Mounié, Grégory ^b  

^a LABORATOIRE G SCOP   (France)

^b INP Grenoble ENSIMAG   (France)

Author keywords

Car sequencing problem; Dynamic simulated annealing; Greedy algorithm

Indexed keywords

ALGORITHMIC LANGUAGES; COMPUTER SIMULATION; NUMERICAL METHODS; SIMULATED ANNEALING;

CAR SEQUENCING PROBLEMS; DYNAMIC PROBABILITIES; DYNAMIC SIMULATED ANNEALING; GREEDY ALGORITHMS;

PROBLEM SOLVING;

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

References (2)

1. Jens G., Markus P., and Christine S. A study of greedy, local search and ant colony optimization approaches for car sequencing problems. Lecture Notes in Computer Science 2611 (2003) 246-257
2. Christine Solnon, Van Dat Cung, Alain Nguyen, Christian Artigues. The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'05 challenge problem. European Journal of Operational Research, in press. doi:10.1016/j.ejor.2007.04.033.