A recursive model for static empty container allocation

DOI10.1007/S11704-011-1013-YMaRDI QIDQ352103zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

immune algorithmempty container allocationshipping network

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(6)

• On-line scheduling of empty containers
• Allocation of empty containers between multi-ports
• Immunity-based evolutionary algorithm for optimal global container repositioning in liner shipping
• An optimization model for container inventory management
• A network flow model for the optimal allocation of both foldable and standard containers
• Positioning empty containers among multiple ports with leasing and purchasing considerations

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)