A beam search algorithm for minimizing crane times in premarshalling problems

DOI10.1016/J.EJOR.2022.01.038OpenAlexW4210584346WikidataQ113875426 ScholiaQ113875426MaRDI QIDQ2672129FDOQ2672129

Authors: Consuelo Parreño-Torres, Francisco Parreño, Ramón Alvarez-Valdes 

Publication date: 8 June 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.038

Recommendations

• A beam search approach to the container loading problem
• A beam search algorithm for the biobjective container loading problem
• Algorithm Theory - SWAT 2004
• A beam search approach for the optimization version of the car sequencing problem
• Principles and Practice of Constraint Programming – CP 2004
• Tabu search heuristics for the crane sequencing problem
• Some complexity results and an efficient algorithm for quay crane scheduling problem
• The bounded beam search algorithm for the block relocation problem
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• A tabu search heuristic for the quay crane scheduling problem

zbMATH Keywords

logisticsbeam searchcontainer premarshallingcrane time

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• A heuristic for retrieving containers from a yard
• A tree search procedure for the container pre-marshalling problem
• An optimization model for the container pre-marshalling problem
• A multi-heuristic approach for solving the pre-marshalling problem
• A branch and price procedure for the container premarshalling problem
• A biased random-key genetic algorithm for the container pre-marshalling problem
• Solving a large cutting problem in the glass manufacturing industry
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• A new effective unified model for solving the pre-marshalling and block relocation problems
• A feasibility-based heuristic for the container pre-marshalling problem
• Integer programming models for the pre-marshalling problem
• The bounded beam search algorithm for the block relocation problem
• Deep learning assisted heuristic tree search for the container pre-marshalling problem
• An efficient ant colony optimization algorithm for the blocks relocation problem
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
• A branch and bound approach for large pre-marshalling problems
• Pre-processing a container yard under limited available time

Cited In (2)

• The container premarshalling problem under limited crane time: a constraint programming approach
• Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem

Uses Software

• DOGS

This page was built for publication: A beam search algorithm for minimizing crane times in premarshalling problems

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