Research Article | OPEN ACCESS
Container Logistic Transport Planning Model
Xin Zhang and Xiao-Min Shi
Jiaxing University, Jiaxing, P.R. China
Research Journal of Applied Sciences, Engineering and Technology 2013 21:5034-5038
Received: September 13, 2012 | Accepted: October 19, 2012 | Published: May 20, 2013
Abstract
The study proposed a stochastic method of container logistic transport in order to solve the unreasonable transportation’s problem and overcome the traditional models’ two shortcomings. Container transport has rapidly developed into a modern means of transportation because of their significant advantages. With the development, it also exacerbated the flaws of transport in the original. One of the most important problems was that the invalid transport had not still reduced due to the congenital imbalances of transportation. Container transport exacerbated the invalid transport for the empty containers. To solve the problem, people made many efforts, but they did not make much progress. There had two theoretical flaws by analyzing the previous management methods in container transport. The first one was the default empty containers inevitability. The second one was that they did not overall consider how to solve the problem of empty containers allocation. In order to solve the unreasonable transportation’s problem and overcome the traditional models’ two shortcomings, the study re-built the container transport planning model-gravity model. It gave the general algorithm and has analyzed the final result of model.
Keywords:
Algorithms and analysis, container transport, gravity model,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
|
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
|
Information |
|
|
|
Sales & Services |
|
|
|