Research Article | OPEN ACCESS
Location Selection of Chinese Modern Railway Logistics Center Based on DEA-Bi-level Programming Model
Fenling Feng, Feiran Li and Qingya Zhang
School of Traffic and Transportation Engineering, Central South University,
Changsha, 410075, China
Research Journal of Applied Sciences, Engineering and Technology 2013 5:812-818
Received: September 17, 2012 | Accepted: November 13, 2012 | Published: June 25, 2013
Abstract
Properly planning the modern railway logistics center is a necessary step for the railway logistics operation, which can effectively improve the railway freight service for a seamless connection between the internal and external logistic nodes. The study, from the medium level and depending on the existing railway freight stations with the railway logistics node city, focuses on the site-selection of modern railway logistics center to realize organic combination between newly built railway logistics center and existing resources. Considering the special features of modern railway logistics center, the study makes pre-selection of the existing freight stations with the DEA assessment model to get the alternative plan. And further builds a Bi-level plan model with the gross construction costs and total client expenses minimized. Finally, the example shows that the hybrid optimization algorithm combined with GA, TA, SA can solve the Bi-level programming which is a NP-hard problem and get the railway logistics center number and distribution. The result proves that our method has profound realistic significance to the development of China railway logistics.
Keywords:
Bi-level programming, DEA, location problem, modern railway logistics center,
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 |
|
|
|