Local search and suffix tree for car-sequencing problem with colors

DOI10.1016/j.ejor.2007.04.051zbMath1156.90375OpenAlexW2093308966MaRDI QIDQ932215

Haris Gavranović

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

zbMATH Keywords

tabu searchheuristicmultiple objective programmingsuffix treecar-sequencing problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Algorithms for the maximum \(k\)-club problem in graphs ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications

Cites Work

• Unnamed Item

This page was built for publication: Local search and suffix tree for car-sequencing problem with colors