Large neighborhood improvements for solving car sequencing problems
From MaRDI portal
Publication:3534210
DOI10.1051/RO:2007003zbMATH Open1151.90523OpenAlexW2106958303MaRDI QIDQ3534210FDOQ3534210
Authors: Bertrand Estellon, Frédéric Gardi, Karim Nouioua 
Publication date: 3 November 2008
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2006__40_4_355_0/
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
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Local branching
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- On the complexity of the car sequencing problem.
- Two local search approaches for solving real-life car sequencing problems
- Principles and Practice of Constraint Programming – CP 2004
- Title not available (Why is that?)
- 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?)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
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
- SAT and hybrid models of the car sequencing problem
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- 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
Uses Software
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)
