A recursive model for static empty container allocation

DOI10.1007/S11704-011-1013-YzbMATH Open1267.90018OpenAlexW1974823541MaRDI QIDQ352103FDOQ352103

Authors: Wenyuan Wang, Guolei Tang, Jun Huang, Zi-Jian Guo 

Publication date: 4 July 2013

Published in: Frontiers of Computer Science in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-011-1013-y

Recommendations

• Allocation of empty containers between multi-ports
• An optimization model for container inventory management
• Conservative allocation models for outbound containers in container terminals
• On-line scheduling of empty containers
• A network flow model for the optimal allocation of both foldable and standard containers

zbMATH Keywords

immune algorithmempty container allocationshipping network

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem
• Dynamic and Stochastic Models for the Allocation of Empty Containers
• Allocation of empty containers between multi-ports

Cited In (4)

• On-line scheduling of empty containers
• Positioning empty containers among multiple ports with leasing and purchasing considerations
• Allocation of empty containers between multi-ports
• Immunity-based evolutionary algorithm for optimal global container repositioning in liner shipping

This page was built for publication: A recursive model for static empty container allocation

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