A beam search algorithm for minimizing crane times in premarshalling problems

DOI10.1016/j.ejor.2022.01.038OpenAlexW4210584346WikidataQ113875426 ScholiaQ113875426MaRDI QIDQ2672129

Francisco Parreño, Consuelo Parreño-Torres, Ramón Alvarez-Valdés

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

zbMATH Keywords

beam searchlogisticscontainer premarshallingcrane time

Mathematics Subject Classification ID

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

Related Items (1)

Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem

Uses Software

• DOGS

Cites Work

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

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