Wanru Chen, Rolf N. van Lieshout, Dezhi Zhang, Tom Van Woensel
{"title":"Multi-period railway line planning for integrated passenger-freight transportation","authors":"Wanru Chen, Rolf N. van Lieshout, Dezhi Zhang, Tom Van Woensel","doi":"arxiv-2409.08256","DOIUrl":null,"url":null,"abstract":"This paper addresses a multi-period line planning problem in an integrated\npassenger-freight railway system, aiming to maximize profit while serving\npassengers and freight using a combination of dedicated passenger trains,\ndedicated freight trains, and mixed trains. To accommodate demand with\ndifferent time sensitivities, we develop a period-extended change&go-network\nthat tracks the paths taken by passengers and freight. The problem is\nformulated as a path-based mixed integer programming model, with the linear\nrelaxation solved using column generation. Paths for passengers and freight are\ndynamically generated by solving pricing problems defined as elementary\nshortest-path problems with duration constraints. We propose two heuristic\napproaches: price-and-branch and a diving heuristic, with acceleration\nstrategies, to find integer feasible solutions efficiently. Computational\nexperiments on the Chinese high-speed railway network demonstrate that the\ndiving heuristic outperforms the price-and-branch heuristic in both\ncomputational time and solution quality. Additionally, the experiments\nhighlight the benefits of integrating freight, the advantages of multi-period\nline planning, and the impact of different demand patterns on line operations.","PeriodicalId":501286,"journal":{"name":"arXiv - MATH - Optimization and Control","volume":"47 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Optimization and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper addresses a multi-period line planning problem in an integrated
passenger-freight railway system, aiming to maximize profit while serving
passengers and freight using a combination of dedicated passenger trains,
dedicated freight trains, and mixed trains. To accommodate demand with
different time sensitivities, we develop a period-extended change&go-network
that tracks the paths taken by passengers and freight. The problem is
formulated as a path-based mixed integer programming model, with the linear
relaxation solved using column generation. Paths for passengers and freight are
dynamically generated by solving pricing problems defined as elementary
shortest-path problems with duration constraints. We propose two heuristic
approaches: price-and-branch and a diving heuristic, with acceleration
strategies, to find integer feasible solutions efficiently. Computational
experiments on the Chinese high-speed railway network demonstrate that the
diving heuristic outperforms the price-and-branch heuristic in both
computational time and solution quality. Additionally, the experiments
highlight the benefits of integrating freight, the advantages of multi-period
line planning, and the impact of different demand patterns on line operations.