Iterative beam search for car sequencing

DOI10.1007/S10479-014-1733-0MaRDI QIDQ2341215zbMATH OpenOpenAlexWikidataFDO

Authors Uli Golle, Nils Boysen, Franz Rothlauf

Publication date 23 April 2015

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-014-1733-0

zbMATH Keywords

mixed-model assembly linescar sequencingiterative beam search

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Recommendations

• A beam search approach for the optimization version of the car sequencing problem
• Review and comparison of three methods for the solution of the car sequencing problem
• Iterated tabu search for the car sequencing problem
• Solving the car sequencing problem via branch \& bound
• Analysis and design of sequencing rules for car sequencing

Cites work

• scientific article; zbMATH DE number 1961994 (Why is no real title available?)
• scientific article; zbMATH DE number 2079896 (Why is no real title available?)
• A beam search approach for the optimization version of the car sequencing problem
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• On the complexity of the car sequencing problem.
• Review and comparison of three methods for the solution of the car sequencing problem
• Scattered branch and bound. An adaptive search strategy applied to resource-constrained project scheduling
• Sequencing mixed-model assembly lines: survey, classification and model critique
• Soft car sequencing with colors: lower bounds and optimality proofs
• Solving real car sequencing problems with ant colony optimization
• Solving the car sequencing problem via branch \& bound
• 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

Cited in

(9)

• The maximum length car sequencing problem
• Analysis and design of sequencing rules for car sequencing
• Iterated tabu search for the car sequencing problem
• A decomposition approach for the car resequencing problem with selectivity banks
• A Lagrangian-ACO matheuristic for car sequencing
• Car sequencing versus mixed-model sequencing: a computational study
• Advanced constraint propagation for the combined car sequencing and level scheduling problem
• Instance space analysis for the car sequencing problem
• An iterative exact algorithm for the weighted fair sequences problem

This page was built for publication: Iterative beam search for car sequencing

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