An optimization model for the container pre-marshalling problem
From MaRDI portal
Publication:883294
DOI10.1016/j.cor.2005.12.006zbMath1123.90010MaRDI QIDQ883294
Publication date: 4 June 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.12.006
Related Items
Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal, Mathematical formulation and heuristic algorithm for the block relocation and loading problem, A constraint programming approach for the premarshalling problem, Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem, A new modeling approach for the unrestricted block relocation problem, Conservative allocation models for outbound containers in container terminals, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, Solving the container relocation problem by an improved greedy look-ahead heuristic, An improved mathematical formulation for the blocks relocation problem, A biased random-key genetic algorithm for the container pre-marshalling problem, A tree search procedure for the container pre-marshalling problem, A mathematical formulation and complexity considerations for the blocks relocation problem, Short-term space allocation for storage yard management in a transshipment hub port, A new effective unified model for solving the pre-marshalling and block relocation problems, The bounded beam search algorithm for the block relocation problem, An exact algorithm for the unrestricted block relocation problem, Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse, Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm, Genetic algorithm and its performance analysis for scheduling a single crane, An algorithm with performance guarantee for the online container relocation problem, A feasibility-based heuristic for the container pre-marshalling problem, Integer programming models for the pre-marshalling problem, A tree search procedure for the container relocation problem, Optimizing the yard layout in container terminals, Two-stage search algorithm for the inbound container unloading and stacking problem, An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules, Storage yard operations in container terminals: literature overview, trends, and research directions, Optimizing pre-processing and relocation moves in the stochastic container relocation problem, 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 branch and bound approach for large pre-marshalling problems, Operations research at container terminals: a literature update, A heuristic for retrieving containers from a yard, Pre-processing a container yard under limited available time, A beam search algorithm for minimizing crane times in premarshalling problems, An optimisation model and its effective beam search heuristics for floor-storage warehousing systems
Cites Work
