Combining forces to solve the car sequencing problem
From MaRDI portal
Recommendations
- Two local search approaches for solving real-life car sequencing problems
- Review and comparison of three methods for the solution of the car sequencing problem
- Solving car sequencing problems by local optimization
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Large neighborhood improvements for solving car sequencing problems
Cited in
(23)- Sequencing mixed-model assembly lines: survey, classification and model critique
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Robust car sequencing for automotive assembly
- Iterative beam search for car sequencing
- An optimal arc consistency algorithm for a particular case of sequence constraint
- Explanation-based large neighborhood search
- A Lagrangian-ACO matheuristic for car sequencing
- scientific article; zbMATH DE number 7403863 (Why is no real title available?)
- Large neighborhood improvements for solving car sequencing problems
- Solving car sequencing problems by local optimization
- SAT and hybrid models of the car sequencing problem
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
- The maximum length car sequencing problem
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Instance space analysis for the car sequencing problem
- Principles for the design of large neighborhood search
- 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
- Two local search approaches for solving real-life car sequencing problems
- Iterated tabu search for the car sequencing problem
- 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
This page was built for publication: Combining forces to solve the car sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713875)