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

DOI10.1016/J.EJOR.2007.04.051MaRDI QIDQ932215zbMATH OpenOpenAlexFDO

Authors 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

car-sequencing problemheuristicmultiple objective programmingsuffix treetabu search

Mathematics Subject Classification ID

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

Recommendations

• Soft car sequencing with colors: lower bounds and optimality proofs
• Two local search approaches for solving real-life car sequencing problems
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
• scientific article; zbMATH DE number 2079896

Cited in

(7)

• Variable neighbourhood search: Methods and applications
• Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops
• 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
• Two local search approaches for solving real-life car sequencing problems
• Soft car sequencing with colors: lower bounds and optimality proofs
• Variable neighbourhood search: methods and applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932215)