Two local search approaches for solving real-life car sequencing problems

DOI10.1016/j.ejor.2007.04.043zbMath1156.90361OpenAlexW2143190607WikidataQ125853892 ScholiaQ125853892MaRDI QIDQ932212

Bertrand Estellon, Karim Nouioua, Frédéric Gardi

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.043

zbMATH Keywords

invariantscombinatorial optimizationinteger linear programminglocal/neighborhood searchreal-life car sequencing/scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

A column generation approach and new bounds for the car sequencing problem ⋮ Split-merge: using exponential neighborhood search for scheduling a batching machine ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Combining two pheromone structures for solving the car sequencing problem with ant colony optimization ⋮ Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge ⋮ Sequencing and scheduling for filling lines in dairy production ⋮ Variable neighbourhood search: methods and applications ⋮ Robust car sequencing for automotive assembly ⋮ Iterative beam search for car sequencing

Uses Software

• LSSPER
• COMET
• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• On the complexity of the car sequencing problem.
• A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Review and comparison of three methods for the solution of the car sequencing problem
• Large neighborhood improvements for solving car sequencing problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Two local search approaches for solving real-life car sequencing problems