Two local search approaches for solving real-life car sequencing problems
From MaRDI portal
(Redirected from Publication:932212)
Recommendations
- scientific article; zbMATH DE number 2079896
- scientific article; zbMATH DE number 1961994
- 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
- Iterated tabu search for the car sequencing problem
- Solving real car sequencing problems with ant colony optimization
- Large neighborhood improvements for solving car sequencing problems
- Review and comparison of three methods for the solution of the car sequencing problem
- Solving the car sequencing problem via branch \& bound
- Local search and suffix tree for car-sequencing problem with colors
Cites work
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- A survey of very large-scale neighborhood search techniques
- Exploring relaxation induced neighborhoods to improve MIP solutions
- scientific article; zbMATH DE number 1016966 (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?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Large neighborhood improvements for solving car sequencing problems
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- 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
Cited in
(25)- A solution method for a car fleet management problem with maintenance constraints
- A column generation approach and new bounds for the car sequencing problem
- Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge
- Robust car sequencing for automotive assembly
- Iterative beam search for car sequencing
- Split-merge: using exponential neighborhood search for scheduling a batching machine
- Large neighborhood improvements for solving car sequencing problems
- scientific article; zbMATH DE number 1961994 (Why is no real title available?)
- scientific article; zbMATH DE number 2079896 (Why is no real title available?)
- 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
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Sequencing and scheduling for filling lines in dairy production
- Algorithms for the car sequencing and the level scheduling problem
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
- Iterated tabu search for the car sequencing problem
- Local search and suffix tree for car-sequencing problem with colors
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- Greedy approach and multi-criteria simulated annealing 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
- A beam search approach for the optimization version of the car sequencing problem
- Variable neighbourhood search: methods and applications
This page was built for publication: Two local search approaches for solving real-life car sequencing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932212)
