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

Optimization of seat allocation with fixed prices: An application of railway revenue management in China

Author

Listed:
  • Wuyang Yuan
  • Lei Nie

Abstract

China Railway Corporation (CRC) has been paid more attention to passenger transportation revenue, with its increase proportion in transportation revenue. Due to the price regulation, the only way CRC can improve ticket sale profit is to find a best seat allocation scheme. This study focuses on the optimization of railway revenue management problem in China with consideration of i) customer behaviors including their arrival and purchase preferences, ii) a specific ticket booking mechanism called “seat-based control”. To evaluate the performance of seat-based control, we build a Discrete-Time Markov Chain model to describe the ticket reservation process and then design a genetic algorithm to find approximate solutions. The performance of proposed method is tested in two experiments with two other benchmarks. Finally, we apply it to practical data of the Nanning-Guangzhou high-speed railway line.

Suggested Citation

  • Wuyang Yuan & Lei Nie, 2020. "Optimization of seat allocation with fixed prices: An application of railway revenue management in China," PLOS ONE, Public Library of Science, vol. 15(4), pages 1-25, April.
    • Handle: RePEc:plo:pone00:0231706
    DOI: 10.1371/journal.pone.0231706
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0231706
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0231706&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0231706?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
    ---><---

    References listed on IDEAS

    as
    1. A. Ciancimino & G. Inzerillo & S. Lucidi & L. Palagi, 1999. "A Mathematical Programming Approach for the Solution of the Railway Yield Management Problem," Transportation Science, INFORMS, vol. 33(2), pages 168-181, May.
    2. Tak C. Lee & Marvin Hersh, 1993. "A Model for Dynamic Airline Seat Inventory Control with Multiple Seat Bookings," Transportation Science, INFORMS, vol. 27(3), pages 252-265, August.
    3. Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
    4. Jeffrey I. McGill & Garrett J. van Ryzin, 1999. "Revenue Management: Research Overview and Prospects," Transportation Science, INFORMS, vol. 33(2), pages 233-256, May.
    5. Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
    6. You, Peng-Sheng, 2008. "An efficient computational approach for railway booking problems," European Journal of Operational Research, Elsevier, vol. 185(2), pages 811-824, March.
    7. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    8. Dimitris Bertsimas & Ioana Popescu, 2003. "Revenue Management in a Dynamic Network Environment," Transportation Science, INFORMS, vol. 37(3), pages 257-277, August.
    9. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
    10. William L. Cooper & Tito Homem-de-Mello & Anton J. Kleywegt, 2006. "Models of the Spiral-Down Effect in Revenue Management," Operations Research, INFORMS, vol. 54(5), pages 968-987, October.
    11. Dimitris Bertsimas & Sanne de Boer, 2005. "Simulation-Based Booking Limits for Airline Revenue Management," Operations Research, INFORMS, vol. 53(1), pages 90-106, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
    2. Xiang Zhao & Xinghua Shan & Jinfei Wu, 2023. "The Impact of Seat Resource Fragmentation on Railway Network Revenue Management," Networks and Spatial Economics, Springer, vol. 23(1), pages 135-177, March.
    3. Guillermo Gallego & Michael Z. F. Li & Yan Liu, 2020. "Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons," Operations Research, INFORMS, vol. 68(3), pages 655-670, May.
    4. Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.
    5. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    6. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
    7. Dan Zhang, 2011. "An Improved Dynamic Programming Decomposition Approach for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.
    8. Nicolas Houy & François Le Grand, 2015. "Financing and advising with (over)confident entrepreneurs : an experimental investigation," Working Papers 1514, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    9. Sebastian Koch & Jochen Gönsch & Michael Hassler & Robert Klein, 2016. "Practical decision rules for risk-averse revenue management using simulation-based optimization," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(6), pages 468-487, December.
    10. Syed Asif Raza & Rafi Ashrafi & Ali Akgunduz, 2020. "A bibliometric analysis of revenue management in airline industry," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(6), pages 436-465, December.
    11. Ş. İlker Birbil & J. B. G. Frenk & Joaquim A. S. Gromicho & Shuzhong Zhang, 2014. "A Network Airline Revenue Management Framework Based on Decomposition by Origins and Destinations," Transportation Science, INFORMS, vol. 48(3), pages 313-333, August.
    12. Sebastian Koch & Jochen Gönsch & Claudius Steinhardt, 2017. "Dynamic Programming Decomposition for Choice-Based Revenue Management with Flexible Products," Transportation Science, INFORMS, vol. 51(4), pages 1046-1062, November.
    13. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    14. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    15. Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015. "Revenue management for operations with urgent orders," European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
    16. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    17. Georgia Perakis & Guillaume Roels, 2010. "Robust Controls for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 56-76, November.
    18. Wang, Xiubin & Regan, Amelia, 2006. "Dynamic yield management when aircraft assignments are subject to swap," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 563-576, August.
    19. Mika Sumida & Huseyin Topaloglu, 2019. "An Approximation Algorithm for Capacity Allocation Over a Single Flight Leg with Fare-Locking," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 83-99, February.
    20. Gönsch, Jochen & Koch, Sebastian & Steinhardt, Claudius, 2014. "Revenue management with flexible products: The value of flexibility and its incorporation into DLP-based approaches," International Journal of Production Economics, Elsevier, vol. 153(C), pages 280-294.

    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:0231706. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.