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

DOI10.1016/J.EJOR.2007.04.052zbMATH Open1156.90316OpenAlexW1984602753MaRDI QIDQ932218FDOQ932218

Authors: O. Briant, Denis Naddef, Grégory Mounié 

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

Recommendations

• scientific article; zbMATH DE number 1961994
• Two local search approaches for solving real-life car sequencing problems
• scientific article; zbMATH DE number 2079896
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints

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)

Cites Work

• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Title not available (Why is that?)

Cited In (6)

• A column generation approach and new bounds for the car sequencing problem
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• Robust car sequencing for automotive assembly
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• A beam search approach for the optimization version of the car sequencing problem
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932218)