IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0314713.html
   My bibliography  Save this article

Dynamic pricing optimization for high-speed railway based on passenger flow assignment

Author

Listed:
  • Jiren CAO
  • Lei NIE
  • Lu TONG
  • Zhenhuan HE
  • Zhangjiaxuan LIU

Abstract

In order to improve the operation efficiency and market competitiveness, how to optimize the ticket pricing strategy of high-speed railway to match the dynamic supply-demand relationship was an urgent problem to be studied. Taking differentiated passenger demand and supply trains as the research object, the space-time service network based on train timetable was constructed. The generalized cost formula and travel utility formula of passenger travel were proposed, which contained economy, rapidity, convenience, comfort, and route correlation cost. A multi-objective dynamic pricing model was proposed. The model aimed at maximize the corporate revenue and maximize passenger travel benefit, and was solved by large neighborhood search heuristic algorithm and path size logit assignment based on capacity constraint-passenger flow increment accurate algorithm. Based on real data, the Shandong circular high-speed railway case compared the average total revenue under different ticket price adjustment ranges and the ticket price for different classes of trains under different OD levels. The case proved the practicability of dynamic pricing adjustment strategy considering train classification, which could provide a reference for the ticket price management of high-speed railway.

Suggested Citation

  • Jiren CAO & Lei NIE & Lu TONG & Zhenhuan HE & Zhangjiaxuan LIU, 2024. "Dynamic pricing optimization for high-speed railway based on passenger flow assignment," PLOS ONE, Public Library of Science, vol. 19(12), pages 1-25, December.
  • Handle: RePEc:plo:pone00:0314713
    DOI: 10.1371/journal.pone.0314713
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0314713
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0314713&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0314713?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0314713. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.