How to optimize train lines for diverse passenger demands: a line planning approach providing matched train services for each O-D market
How to optimize train lines for diverse passenger demands: a line planning approach providing matched train services for each O-D market
Line planning decides critical service contents of a passenger railway schedule. In real-world scenarios, passengers’ travel expectations or preferences on service qualities tend to be heterogeneous among different origin–destination (O-D) pairs or even in the same O-D pair, which requires railway operators to schedule train services catering to those diverse passenger demands. However, previous line planning approaches either treated passengers homogeneously or roughly divided simple passenger groups by travel purposes or service types. In this paper, we view each passenger O-D pair as an individual O-D market and propose a line planning approach where concluded train lines can deliver matched service levels of trains for each O-D market. Based on the Set Covering Problem (SCP), we establish a novel bi-objective mixed integer linear programming (MILP) model that considers the benefits of both railway operators and passengers. Multiple service qualities for each passenger O-D pair, such as travel speed, direct or transfer connection, frequency, price, etc. are seen as the objects to be “covered” by train lines, to achieve a more accurate supply–demand match. Facing the potential conflicts between diverse passenger demands and limited railway supply, we formulate a series of non-rigid constraints (NRC) to achieve a non-rigid supply–demand match i.e., each O-D pair’s demands can be either guaranteed to be satisfied or satisfied as much as possible. In this manner, railway operators can testify different marketing policies and make marketing decisions regarding which O-D markets should improve, maintain, or degrade services. A heuristic rule-based adaptive iterative searching approach (ISA) is designed to solve large-scale model structures. We take the Beijing-Shanghai high-speed railway (HSR) line as the case study background. We comparatively evaluate the operation and service performances of multiple cyclic line plan scenarios, discuss the performance difference, and state our policy implication. We also recalibrate the service levels of the real-world non-cyclic line plan. The experiment results show that our proposed approach can efficiently help design the line plans based on customized marketing policies and improve the service levels of the real-world line plan.
Marketing policy, O-D market, Railway line planning, Service level, Supply-demand match
Hu, Huaibin
0075f279-6b1d-4780-ac48-d454a444780d
Yue, Yixiang
e6c08476-7bc7-486e-92f4-03d95f0d2eb1
Fu, Huiling
7530d55c-83c5-4e38-8fec-2320b84e8753
Li, Jiaxi
14fc8d60-82df-45fb-9bfc-1c6752ad3045
5 July 2024
Hu, Huaibin
0075f279-6b1d-4780-ac48-d454a444780d
Yue, Yixiang
e6c08476-7bc7-486e-92f4-03d95f0d2eb1
Fu, Huiling
7530d55c-83c5-4e38-8fec-2320b84e8753
Li, Jiaxi
14fc8d60-82df-45fb-9bfc-1c6752ad3045
Hu, Huaibin, Yue, Yixiang, Fu, Huiling and Li, Jiaxi
(2024)
How to optimize train lines for diverse passenger demands: a line planning approach providing matched train services for each O-D market.
Transportation Research Part A: Policy and Practice, 186, [104154].
(doi:10.1016/j.tra.2024.104154).
Abstract
Line planning decides critical service contents of a passenger railway schedule. In real-world scenarios, passengers’ travel expectations or preferences on service qualities tend to be heterogeneous among different origin–destination (O-D) pairs or even in the same O-D pair, which requires railway operators to schedule train services catering to those diverse passenger demands. However, previous line planning approaches either treated passengers homogeneously or roughly divided simple passenger groups by travel purposes or service types. In this paper, we view each passenger O-D pair as an individual O-D market and propose a line planning approach where concluded train lines can deliver matched service levels of trains for each O-D market. Based on the Set Covering Problem (SCP), we establish a novel bi-objective mixed integer linear programming (MILP) model that considers the benefits of both railway operators and passengers. Multiple service qualities for each passenger O-D pair, such as travel speed, direct or transfer connection, frequency, price, etc. are seen as the objects to be “covered” by train lines, to achieve a more accurate supply–demand match. Facing the potential conflicts between diverse passenger demands and limited railway supply, we formulate a series of non-rigid constraints (NRC) to achieve a non-rigid supply–demand match i.e., each O-D pair’s demands can be either guaranteed to be satisfied or satisfied as much as possible. In this manner, railway operators can testify different marketing policies and make marketing decisions regarding which O-D markets should improve, maintain, or degrade services. A heuristic rule-based adaptive iterative searching approach (ISA) is designed to solve large-scale model structures. We take the Beijing-Shanghai high-speed railway (HSR) line as the case study background. We comparatively evaluate the operation and service performances of multiple cyclic line plan scenarios, discuss the performance difference, and state our policy implication. We also recalibrate the service levels of the real-world non-cyclic line plan. The experiment results show that our proposed approach can efficiently help design the line plans based on customized marketing policies and improve the service levels of the real-world line plan.
Text
Manuscript-Final_version
- Accepted Manuscript
Restricted to Repository staff only until 5 July 2026.
Request a copy
More information
Accepted/In Press date: 22 June 2024
e-pub ahead of print date: 5 July 2024
Published date: 5 July 2024
Keywords:
Marketing policy, O-D market, Railway line planning, Service level, Supply-demand match
Identifiers
Local EPrints ID: 492117
URI: http://eprints.soton.ac.uk/id/eprint/492117
ISSN: 0965-8564
PURE UUID: 5e406be1-48fa-4984-8560-32a1c7f51d3a
Catalogue record
Date deposited: 17 Jul 2024 16:31
Last modified: 18 Jul 2024 01:58
Export record
Altmetrics
Contributors
Author:
Huaibin Hu
Author:
Yixiang Yue
Author:
Huiling Fu
Author:
Jiaxi Li
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics