IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v186y2024ics0965856424002027.html
   My bibliography  Save this article

How to optimize train lines for diverse passenger demands: A line planning approach providing matched train services for each O-D market

Author

Listed:
  • Hu, Huaibin
  • Yue, Yixiang
  • Fu, Huiling
  • Li, Jiaxi

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.

Suggested Citation

  • Hu, Huaibin & Yue, Yixiang & Fu, Huiling & 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, Elsevier, vol. 186(C).
  • Handle: RePEc:eee:transa:v:186:y:2024:i:c:s0965856424002027
    DOI: 10.1016/j.tra.2024.104154
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856424002027
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tra.2024.104154?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:186:y:2024:i:c:s0965856424002027. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.