An optimization model for the container pre-marshalling problem

DOI10.1016/J.COR.2005.12.006MaRDI QIDQ883294zbMATH OpenOpenAlexFDO

Authors Yusin Lee, Nai-Yun Hsu

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

zbMATH Keywords

optimizationnetwork flowsinteger programmingcontainer pre-marshalling

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Recommendations

• A feasibility-based heuristic for the container pre-marshalling problem
• Solving the robust container pre-marshalling problem
• Integer programming models for the pre-marshalling problem
• A tree search procedure for the container pre-marshalling problem
• scientific article; zbMATH DE number 2159166
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• An optimization model for container inventory management
• An analytical model for the container loading problem
• A branch and price procedure for the container premarshalling problem
• A mathematical model for the container stowage and ship routing problem

Cites work

• An optimal routing algorithm for a transfer crane in port container terminals
• Container terminal operation and operations research -- a classification and literature review
• Deriving decision rules to locate export containers in container yards

Cited in

(48)

• A branch and price procedure for the container premarshalling problem
• The bounded beam search algorithm for the block relocation problem
• Yard crane scheduling in the ground trolley-based automated container terminal
• Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem
• Operation and preventive maintenance scheduling for containerships: mathematical model and solution algorithm
• An optimization model for storage yard management in transshipment hubs
• A biased random-key genetic algorithm for the container pre-marshalling problem
• Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
• scientific article; zbMATH DE number 2159166 (Why is no real title available?)
• The assignment of storage locations to containers for a container stack
• Pre-processing a container yard under limited available time
• An exact algorithm for the unrestricted block relocation problem
• A new modeling approach for the unrestricted block relocation problem
• Genetic algorithm and its performance analysis for scheduling a single crane
• Note on the dominance rules in the exact algorithm for the container pre-marshalling problem by Tanaka \& Tierney (2018)
• A multi-heuristic approach for solving the pre-marshalling problem
• Optimizing pre-processing and relocation moves in the stochastic container relocation problem
• Storage yard operations in container terminals: literature overview, trends, and research directions
• A heuristic for retrieving containers from a yard
• A constraint programming approach for the premarshalling problem
• A tree search procedure for the container relocation problem
• An optimisation model and its effective beam search heuristics for floor-storage warehousing systems
• Mathematical formulation and heuristic algorithm for the block relocation and loading problem
• A new effective unified model for solving the pre-marshalling and block relocation problems
• Deep learning assisted heuristic tree search for the container pre-marshalling problem
• An exact algorithm for the block relocation problem with a stowage plan
• An improved mathematical formulation for the blocks relocation problem
• Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse
• Modeling the Pre Auction Stage The Truckload Case
• Optimizing the yard layout in container terminals
• Two-stage search algorithm for the inbound container unloading and stacking problem
• A beam search algorithm for minimizing crane times in premarshalling problems
• Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm
• A branch and bound approach for large pre-marshalling problems
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
• An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules
• Mathematical models and solution methods for optimal container terminal yard layouts
• Conservative allocation models for outbound containers in container terminals
• Loading, unloading and premarshalling of stacks in storage areas: survey and classification
• Optimization model and algorithm for system operation division of labor at two-way marshaling station
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• Operations research at container terminals: a literature update
• 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 pre-marshalling problem
• A mathematical formulation and complexity considerations for the blocks relocation problem
• An algorithm with performance guarantee for the online container relocation problem
• Short-term space allocation for storage yard management in a transshipment hub port

This page was built for publication: An optimization model 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 Q883294)