Review and comparison of three methods for the solution of the car sequencing problem
From MaRDI portal
(Redirected from Publication:3370361)
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
Cited in
(35)- Sequencing mixed-model assembly lines: survey, classification and model critique
- Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
- Advanced constraint propagation for the combined car sequencing and level scheduling problem
- Robust car sequencing for automotive assembly
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
- Iterative beam search for car sequencing
- Solving real car sequencing problems with ant colony optimization
- A Lagrangian-ACO matheuristic for car sequencing
- A decomposition approach for the car resequencing problem with selectivity banks
- Revisiting the Sequence Constraint
- Large neighborhood improvements for solving car sequencing problems
- A heuristic procedure for the automobile assembly-line sequencing problem considering multiple product options
- scientific article; zbMATH DE number 1961994 (Why is no real title available?)
- scientific article; zbMATH DE number 2079896 (Why is no real title available?)
- CP with ACO
- Solving mixed model sequencing problem in assembly lines with serial workstations with work overload minimisation and interruption rules
- SAT and hybrid models of the car sequencing problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
- The maximum length car sequencing problem
- Instance space analysis for the car sequencing problem
- Optimization framework for process scheduling of operation-dependent automobile assembly lines
- On the complexity of the car sequencing problem.
- A GRASP approach for the extended car sequencing problem
- 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)]
- 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
- Analysis and design of sequencing rules for car sequencing
- Sequencing mixed-model assembly lines to minimize part inventory cost
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)
