A feasibility-based heuristic for the container pre-marshalling problem

DOI10.1016/J.EJOR.2016.05.061MaRDI QIDQ1752173zbMATH OpenOpenAlexFDO

Authors Ning Wang, Bo Jin, Zizhen Zhang, Andrew Lim

Publication date 24 May 2018

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

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

zbMATH Keywords

container pre-marshalling problemfeasibility-based heuristictier-protection

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A multi-heuristic approach for solving the pre-marshalling problem
• A branch and price procedure for the container premarshalling problem
• Solving the robust container pre-marshalling problem
• A branch and bound approach for large pre-marshalling problems
• A tree search procedure for the container pre-marshalling problem

Cites work

• A branch and price procedure for the container premarshalling problem
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A multi-heuristic approach for solving the pre-marshalling problem
• A tree search procedure for the container pre-marshalling problem
• An optimization model for the container pre-marshalling problem
• Applying the corridor method to a blocks relocation problem
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• Storage yard operations in container terminals: literature overview, trends, and research directions

Cited in

(21)

• A local search heuristic for the pre- and end-haulage of intermodal container terminals
• An exact algorithm for the unrestricted block relocation problem
• Solving the robust container pre-marshalling problem
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• Integer programming models for the pre-marshalling problem
• Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
• An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
• Robust optimization for premarshalling with uncertain priority classes
• An exact algorithm for the block relocation problem with a stowage plan
• 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 beam search algorithm for minimizing crane times in premarshalling problems
• A biased random-key genetic algorithm for the container pre-marshalling problem
• A tree search procedure for the container pre-marshalling problem
• Optimizing the number of deployed yard cranes in a container terminal
• A constraint programming approach for the premarshalling problem
• Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
• The container premarshalling problem under limited crane time: a constraint programming approach
• Container pre-Marshalling problem under the same-group exclusive strategy
• An optimization model for the container pre-marshalling problem

Describes a project that uses

Uses Software

• BRP

This page was built for publication: A feasibility-based heuristic for the container pre-marshalling problem

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