An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
From MaRDI portal
(Redirected from Publication:932219)
Recommendations
- Large neighborhood improvements for solving car sequencing problems
- An efficient implementation of a VNS/ILS heuristic for a real-life 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
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
Cites work
- 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
- On the complexity of the car sequencing problem.
- Review and comparison of three methods for the solution of the car sequencing problem
Cited in
(27)- Sequencing mixed-model assembly lines: survey, classification and model critique
- Variable neighbourhood search: Methods and applications
- A column generation approach and new bounds for the car sequencing problem
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- A systematic approach to quality oriented product sequencing for multistage manufacturing systems
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
- Iterative beam search for car sequencing
- Decomposition based hybrid metaheuristics
- Review and comparison of three methods for the solution of the car sequencing problem
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Large neighborhood improvements for solving car sequencing problems
- SAT and hybrid models of the car sequencing problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- 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
- Optimization framework for process scheduling of operation-dependent automobile assembly lines
- Contemporary approaches in matheuristics an updated survey
- A GRASP approach for the extended car sequencing 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
- Two local search approaches for solving real-life car sequencing problems
- Iterated tabu search for the car sequencing problem
- 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: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932219)
