Iterated tabu search for the car sequencing problem

DOI10.1016/j.ejor.2007.04.048zbMath1156.90374OpenAlexW2036813338MaRDI QIDQ932213

Jean-François Cordeau, Gilbert Laporte, Federico Pasin

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

zbMATH Keywords

tabu searchiterated local searchcar sequencing problem

Mathematics Subject Classification ID

Search theory (90B40) Traffic problems in operations research (90B20)

Related Items (3)

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 ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of 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
• Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
• Solving real car sequencing problems with ant colony optimization
• Review and comparison of three methods for the solution of the car sequencing problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Iterated tabu search for the car sequencing problem