Review and comparison of three methods for the solution of the car sequencing problem
DOI10.1057/PALGRAVE.JORS.2601955zbMATH Open1082.90590OpenAlexW1993901877MaRDI QIDQ3370361FDOQ3370361
Authors: Marc Gravel, Caroline Gagné, Wilson L. Price 
Publication date: 7 February 2006
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601955
Recommendations
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Large neighborhood improvements for solving car sequencing problems
- scientific article; zbMATH DE number 1961994
- Algorithms for the car sequencing and the level scheduling problem
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
ant colony optimizationinteger linear programmingconstraint satisfaction problemcar sequencing problem
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cited In (33)
- Iterative beam search for car sequencing
- Solving real car sequencing problems with ant colony optimization
- The maximum length car sequencing problem
- Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- Soft car sequencing with colors: lower bounds and optimality proofs
- Analysis and design of sequencing rules for car sequencing
- CP with ACO
- A GRASP approach for the extended car sequencing problem
- Optimization framework for process scheduling of operation-dependent automobile assembly lines
- 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)]
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Robust car sequencing for automotive assembly
- Iterated tabu search for the car sequencing problem
- Large neighborhood improvements for solving car sequencing problems
- Sequencing mixed-model assembly lines: survey, classification and model critique
- A decomposition approach for the car resequencing problem with selectivity banks
- A Lagrangian-ACO matheuristic for car sequencing
- Title not available (Why is that?)
- An integer linear programming approach and a hybrid variable neighborhood search 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
- Advanced constraint propagation for the combined car sequencing and level scheduling problem
- SAT and hybrid models of the car sequencing problem
- Instance space analysis for the car sequencing problem
- On the complexity of the car sequencing problem.
- Solving the car sequencing problem via branch \& bound
- A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options
- A beam search approach for the optimization version of the car sequencing problem
- Sequencing mixed-model assembly lines to minimize part inventory cost
- Revisiting the Sequence Constraint
- Two local search approaches for solving real-life car sequencing problems
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
- Title not available (Why is that?)
Uses Software
This page was built for publication: Review and comparison of three methods for the solution of the car sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370361)
