An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
From MaRDI portal
Publication:932219
DOI10.1016/J.EJOR.2007.04.044zbMATH Open1156.90321OpenAlexW2087278949MaRDI QIDQ932219FDOQ932219
Authors: Matthias Prandtstetter, Günther R. Raidl 
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.044
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
Linear programming (90C05) Integer programming (90C10) Traffic problems in operations research (90B20)
Cites Work
- Title not available (Why is that?)
- On the complexity of the car sequencing problem.
- Review and comparison of three methods for the solution of the car sequencing problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Title not available (Why is that?)
Cited In (26)
- Iterative beam search for car sequencing
- A column generation approach and new bounds for the car sequencing problem
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- A GRASP approach for the extended car sequencing problem
- Variable neighbourhood search: Methods and applications
- Optimization framework for process scheduling of operation-dependent automobile assembly lines
- 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
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
- Decomposition based hybrid metaheuristics
- Iterated tabu search for the car sequencing problem
- Large neighborhood improvements for solving car sequencing problems
- Sequencing mixed-model assembly lines: survey, classification and model critique
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- A systematic approach to quality oriented product sequencing for multistage manufacturing systems
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
- SAT and hybrid models of the car sequencing problem
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- A beam search approach for the optimization version 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
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
Uses Software
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)
