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

DOI10.1016/j.ejor.2007.04.052zbMath1156.90316OpenAlexW1984602753MaRDI QIDQ932218

Grégory Mounié, Denis Naddef, Olivier Briant

Publication date: 10 July 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.052

zbMATH Keywords

greedy algorithmcar sequencing problemdynamic simulated annealing

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Traffic problems in operations research (90B20)

Related Items (3)

A column generation approach and new bounds for the car sequencing problem ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Robust car sequencing for automotive assembly

Cites Work

• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Unnamed Item

This page was built for publication: Greedy approach and multi-criteria simulated annealing for the car sequencing problem