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

作者：Liu, Siqi; Lin, Boliang^*; Wang, Jiaxi; Wu, Jianping

来源：Symmetry-Basel, 2018, 10(5): 135.

DOI：10.3390/sym10050135

• classification yard
• location-allocation problem
• multiple periods
• bi-level programming model
• rail network

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.

• 出版日期2018-5
• 单位北京交通大学