A beam search approach for the optimization version of the car sequencing problem

DOI10.1007/S10479-007-0278-XMaRDI QIDQ940889zbMATH OpenOpenAlexFDO

Authors Joaquín Bautista, Jordi Pereira, Belarmino Adenso-Díaz

Publication date 3 September 2008

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

Full work available at URL https://doi.org/10.1007/s10479-007-0278-x

zbMATH Keywords

schedulingbeam searchcar sequencing problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• Iterated tabu search for the car sequencing problem
• Two local search approaches for solving real-life car sequencing problems
• scientific article; zbMATH DE number 2079896
• Review and comparison of three methods for the solution of the car sequencing problem
• Solving the car sequencing problem via branch \& bound
• scientific article; zbMATH DE number 1961994
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Greedy approach and multi-criteria simulated annealing for the car sequencing problem
• A column generation approach and new bounds for the car sequencing problem

Cites work

• scientific article; zbMATH DE number 1961994 (Why is no real title available?)
• Algorithms for the car sequencing and the level scheduling problem
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• Constraint satisfaction using constraint logic programming
• Heuristics and exact algorithms for solving the Monden problem
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Review and comparison of three methods for the solution of the car sequencing problem
• Solving real car sequencing problems with ant colony optimization

Cited in

(9)

• Iterative beam search for car sequencing
• The maximum length car sequencing problem
• A GRASP approach for the extended car sequencing problem
• Models for MMSP-W considering workstation dependencies: a case study of Nissan's Barcelona plant
• A Lagrangian-ACO matheuristic for car sequencing
• Advanced constraint propagation for the combined car sequencing and level scheduling problem
• Instance space analysis for the car sequencing problem
• On the part inventory model sequencing problem: complexity and beam search heuristic
• A beam search algorithm for minimizing crane times in premarshalling problems

Describes a project that uses

Uses Software

• Beam-ACO

This page was built for publication: A beam search approach for the optimization version of the car sequencing problem

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