Next Article in Journal
Reinforcement Learning Based Data Self-Destruction Scheme for Secured Data Management
Previous Article in Journal
Bandwidth-Guaranteed Resource Allocation and Scheduling for Parallel Jobs in Cloud Data Center
Article Menu
Issue 5 (May) cover image

Export Article

Open AccessFeature PaperArticle
Symmetry 2018, 10(5), 135; https://doi.org/10.3390/sym10050135

Modeling the Multi-Period and Multi-Classification-Yard Location Problem in a Railway Network

School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
*
Author to whom correspondence should be addressed.
Received: 7 April 2018 / Revised: 20 April 2018 / Accepted: 22 April 2018 / Published: 25 April 2018
Full-Text   |   PDF [817 KB, uploaded 3 May 2018]   |  

Abstract

Classification yards are crucial nodes of railway freight transportation network, which plays a vital role in car flow reclassification and new train formation. Generally, a modern yard covers an expanse of several square kilometers and costs billions of Chinese Yuan (CNY), i.e., hundreds of millions of dollars. The determination of location and size of classification yards in multiple periods is not only related to yard establishment or improvement cost, but also involved with train connection service (TCS) plan. This paper proposes a bi-level programming model for the multi-period and multi-classification-yard location (MML) problem. The upper-level is intended to find an optimal combinatorial investment strategy for candidate nodes throughout the planning horizon, and the lower-level aims to obtain a railcar reclassification plan with minimum operation cost on the basis of the strategy given by the upper-level. The model is constrained by budget, classification capacity, the number of available tracks, etc. A numerical study is then performed to evaluate the validity and effectiveness of the model. View Full-Text
Keywords: classification yard; location–allocation problem; multiple periods; bi-level programming model; rail network classification yard; location–allocation problem; multiple periods; bi-level programming model; rail network
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Liu, S.; Lin, B.; Wang, J.; Wu, J. Modeling the Multi-Period and Multi-Classification-Yard Location Problem in a Railway Network. Symmetry 2018, 10, 135.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top