Bojian Zhang , Jun Zhao , Andrea D’Ariano , Yongxiang Zhang , Tao Feng , Qiyuan Peng
{"title":"An iterative method for integrated hump sequencing, train makeup, and classification track assignment in railway shunting yard","authors":"Bojian Zhang , Jun Zhao , Andrea D’Ariano , Yongxiang Zhang , Tao Feng , Qiyuan Peng","doi":"10.1016/j.trb.2024.103087","DOIUrl":null,"url":null,"abstract":"<div><div>In a railway shunting yard, the transformation of inbound trains into properly composed outbound trains is a complex task because it involves decisions of multiple operations processes. This study addresses the integrated optimization of hump sequencing, train makeup, and classification track assignment problem in a railway shunting yard. Several key practical yard operation constraints are considered, including train formulation constraints, hump sequencing constraints, and limitations of the maximum number and capacity of classification tracks. By introducing a new representation of block flow, the integrated problem, which adopts the extended single-stage strategy and the train-to-track policy, is formulated as a unified 0-1 integer linear programming model. The objective of the proposed model is to minimize the weighted-sum of the total dwell time of all railcars and the formulation deviation penalties of all outbound trains. Then, an iterative two-phase decomposition approach is developed to reduce the complexity of solving the integrated problem. The first phase aims to explore all feasible humping sequences using a Branch-and-Bound (B&B) algorithm. Each time a new humping sequence is generated in the first phase, the second phase containing a Branch-and-Price (B&P) algorithm is applied to solve the integrated train makeup and classification track assignment problem with the known humping sequence found in the first phase. In addition, greedy heuristics and lower bounding techniques are designed in both phases to improve computational efficiency. Comprehensive experiments are investigated based on a set of real-life instances. The results show that exact approaches provide optimal solutions, whereas heuristic approaches yield satisfactory solutions within a shorter computation time. Moreover, sensitivity analyses on the number of classification tracks and the effects of different deviation penalties are also performed to gain more managerial insights.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103087"},"PeriodicalIF":5.8000,"publicationDate":"2024-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S019126152400211X","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0
Abstract
In a railway shunting yard, the transformation of inbound trains into properly composed outbound trains is a complex task because it involves decisions of multiple operations processes. This study addresses the integrated optimization of hump sequencing, train makeup, and classification track assignment problem in a railway shunting yard. Several key practical yard operation constraints are considered, including train formulation constraints, hump sequencing constraints, and limitations of the maximum number and capacity of classification tracks. By introducing a new representation of block flow, the integrated problem, which adopts the extended single-stage strategy and the train-to-track policy, is formulated as a unified 0-1 integer linear programming model. The objective of the proposed model is to minimize the weighted-sum of the total dwell time of all railcars and the formulation deviation penalties of all outbound trains. Then, an iterative two-phase decomposition approach is developed to reduce the complexity of solving the integrated problem. The first phase aims to explore all feasible humping sequences using a Branch-and-Bound (B&B) algorithm. Each time a new humping sequence is generated in the first phase, the second phase containing a Branch-and-Price (B&P) algorithm is applied to solve the integrated train makeup and classification track assignment problem with the known humping sequence found in the first phase. In addition, greedy heuristics and lower bounding techniques are designed in both phases to improve computational efficiency. Comprehensive experiments are investigated based on a set of real-life instances. The results show that exact approaches provide optimal solutions, whereas heuristic approaches yield satisfactory solutions within a shorter computation time. Moreover, sensitivity analyses on the number of classification tracks and the effects of different deviation penalties are also performed to gain more managerial insights.
期刊介绍:
Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.