Review and comparison of three methods for the solution of the car sequencing problem

DOI10.1057/palgrave.jors.2601955zbMath1082.90590OpenAlexW1993901877MaRDI QIDQ3370361

Marc Gravel, Caroline Gagné, Wilson L. Price

Publication date: 7 February 2006

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

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601955

zbMATH Keywords

integer linear programmingconstraint satisfaction problemant colony optimizationcar sequencing problem

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (21)

Comments on ``solving real car sequencing problems with ant colony optimization [\textit{C. Gagné} et al., Eur. J. Oper. Res. 174, No. 3, 1427--1448 (2006: Zbl 1103.90409)] ⋮ Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options ⋮ CP with ACO ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Two local search approaches for solving real-life car sequencing problems ⋮ Iterated tabu search for the car sequencing problem ⋮ Soft car sequencing with colors: lower bounds and optimality proofs ⋮ An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem ⋮ Solving the car sequencing problem via branch \& bound ⋮ Combining two pheromone structures for solving the car sequencing problem with ant colony optimization ⋮ A beam search approach for the optimization version of the car sequencing problem ⋮ Optimization framework for process scheduling of operation-dependent automobile assembly lines ⋮ Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules ⋮ Solving real car sequencing problems with ant colony optimization ⋮ Sequencing mixed-model assembly lines to minimize part inventory cost ⋮ Robust car sequencing for automotive assembly ⋮ A Lagrangian-ACO matheuristic for car sequencing ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ Iterative beam search for car sequencing

Uses Software

• CSPLib

This page was built for publication: Review and comparison of three methods for the solution of the car sequencing problem