An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem

DOI10.1016/j.ejor.2007.04.044zbMath1156.90321OpenAlexW2087278949MaRDI QIDQ932219

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

zbMATH Keywords

integer linear programmingvariable neighborhood searchhybrid meta-heuristicscar sequencing problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Traffic problems in operations research (90B20)

Related Items (18)

A column generation approach and new bounds for the car sequencing problem ⋮ Decomposition based hybrid metaheuristics ⋮ 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 ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ 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 ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Optimization framework for process scheduling of operation-dependent automobile assembly lines ⋮ Variable neighbourhood search: methods and applications ⋮ Stochastic mixed-model assembly line sequencing problem: mathematical modeling and Q-learning based simulated annealing hyper-heuristics ⋮ A systematic approach to quality oriented product sequencing for multistage manufacturing systems ⋮ Sequencing mixed-model assembly lines: survey, classification and model critique ⋮ Variable neighbourhood search: Methods and applications ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ Iterative beam search for car sequencing

Uses Software

• CSPLib

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem