An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem

DOI10.1016/j.ejor.2007.02.003zbMath1156.90377OpenAlexW2040158699MaRDI QIDQ932175

Sebastián Urrutia, Thiago F. Noronha, Caroline Rocha, Daniel Aloise, Celso Carneiro Ribeiro

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.02.003

zbMATH Keywords

heuristicsmetaheuristicsvariable neighborhood searchiterated local searchcar sequencing problem

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

A general VNS heuristic for the traveling salesman problem with time windows ⋮ Soft car sequencing with colors: lower bounds and optimality proofs ⋮ An iterative local search approach applied to the optimal stratification problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications ⋮ Heuristics and matheuristics for a real‐life machine reassignment problem

Cites Work

• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• A More Portable Fortran Random Number Generator
• Variable Neighborhood Search
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem