A recursive model for static empty container allocation

Authors:
Zijian Guo;Wenyuan Wang;Guolei Tang;Jun Huang
Affiliations:
Faculty of Infrastructure Engineering, Dalian University of Technology, Dalian, China 116023;Faculty of Infrastructure Engineering, Dalian University of Technology, Dalian, China 116023;Faculty of Infrastructure Engineering, Dalian University of Technology, Dalian, China 116023;Transport Planning and Research Institute, Ministry of Communications, Beijing, China 100028
Venue:
Frontiers of Computer Science in China
Year:
2011

Citing 5
Cited 0

The immune system, adaptation, and machine learning

Physica D
Dynamic and stochastic models for the allocation of empty containers

Operations Research
A DSS for empty container distribution planning

Decision Support Systems
A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem

Transportation Science
Coalition formation mechanism in multi-agent systems based on genetic algorithms

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Backlogged empty containers have gradually turned into a serious burden to shipping networks. Empty container allocation has become an urgent settlement issue for the container shipping industry on a global scale. Therefore, this paper proposes an improved immune algorithm based recursive model for optimizing static empty container allocation which integrates with the global maritime container shipping network. This model minimizes the operating and capital costs during container shipping considering 0---1 mixed-integer programming. So an immune algorithm procedure based on a special twodimensional chromosome encoding is proposed. Finally, computational experiments are performed to optimize a 10-port static empty container shipping system. The results indicate that the proposed recursive model for static empty container allocation is effective in making an optimal strategy for empty container allocation.