An investigation into yard allocation for outbound containers

DOI10.1108/03321640910992001zbMath1188.90216OpenAlexW2016483312MaRDI QIDQ5189826

Weijian Mi, Daofang Chang, Junliang He, Wei Yan

Publication date: 11 March 2010

Published in: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/03321640910992001

zbMATH Keywords

simulationcontainersmaterials handlingprogramming and algorithm theorylogistics data programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Distributed algorithms (68W15)

Cites Work

• A note on a dynamic space-allocation method for outbound containers.
• A multiple-crane-constrained scheduling problem in a container terminal
• A critical-shaking neighborhood search for the yard allocation problem
• Port space allocation with a time dimension
• An approach to determine storage locations of containers at seaport terminals

This page was built for publication: An investigation into yard allocation for outbound containers