Large neighborhood improvements for solving car sequencing problems
From MaRDI portal
Publication:3534210
Recommendations
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- 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
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- scientific article; zbMATH DE number 2079896
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1082099 (Why is no real title available?)
- scientific article; zbMATH DE number 1961994 (Why is no real title available?)
- scientific article; zbMATH DE number 2079896 (Why is no real title available?)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- A survey of very large-scale neighborhood search techniques
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Local branching
- On the complexity of the car sequencing problem.
- Principles and Practice of Constraint Programming – CP 2004
- Review and comparison of three methods for the solution of the car sequencing problem
- Two local search approaches for solving real-life car sequencing problems
Cited in
(10)- Variable neighbourhood search: methods and applications
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- SAT and hybrid models of the car sequencing problem
- On the complexity of the car sequencing problem.
- Review and comparison of three methods for the solution of the car sequencing problem
- 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
This page was built for publication: Large neighborhood improvements for solving car sequencing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534210)
