IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i1p350-369.html

Dynamic Pricing and Capacity Optimization in Railways

Author

Listed:
  • Chandrasekhar Manchiraju

    (Eli Broad College of Business, Michigan State University, East Lansing, Michigan 48824)

  • Milind Dawande

    (Naveen Jindal School of Management, The University of Texas at Dallas, Richardson, Texas 75080)

  • Ganesh Janakiraman

    (Naveen Jindal School of Management, The University of Texas at Dallas, Richardson, Texas 75080)

  • Arvind Raghunathan

    (Mitsubishi Electric Research Laboratories Inc., Cambridge, Massachusetts 02139)

Abstract

Problem definition : Revenue management in railways distinguishes itself from that in traditional sectors, such as airline, hotel, and fashion retail, in several important ways. (i) Capacity is substantially more flexible in the sense that changes to the capacity of a train can often be made throughout the sales horizon. Consequently, the joint optimization of prices and capacity assumes genuine importance. (ii) Capacity can only be added in discrete “chunks” (i.e., coaches). (iii) Passengers with unreserved tickets can travel in any of the multiple trains available during the day. Further, passengers in unreserved coaches are allowed to travel by standing, thus giving rise to the need to manage congestion. Motivated by our work with a major railway company in Japan, we analyze the problem of jointly optimizing pricing and capacity; this problem is more-general version of the canonical multiproduct dynamic-pricing problem. Methodology/results : Our analysis yields four asymptotically optimal policies. From the viewpoint of the pricing decisions, our policies can be classified into two types—static and dynamic. With respect to the timing of the capacity decisions, our policies are again of two types—fixed capacity and flexible capacity. We establish the convergence rates of these policies; when demand and supply are scaled by a factor κ ∈ N , the optimality gaps of the static policies scale proportional to κ , and those of the dynamic policies scale proportional to log κ . We illustrate the attractive performance of our policies on a test suite of instances based on real-world operations of the high-speed “Shinkansen” trains in Japan and develop associated insights. Managerial implications : Our work provides railway administrators with simple and effective policies for pricing, capacity, and congestion management. Our policies cater to different contingencies that decision makers may face in practice: the need for static or dynamic prices and for fixed or flexible capacity.

Suggested Citation

  • Chandrasekhar Manchiraju & Milind Dawande & Ganesh Janakiraman & Arvind Raghunathan, 2024. "Dynamic Pricing and Capacity Optimization in Railways," Manufacturing & Service Operations Management, INFORMS, vol. 26(1), pages 350-369, January.
  • Handle: RePEc:inm:ormsom:v:26:y:2024:i:1:p:350-369
    DOI: 10.1287/msom.2022.0246
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.0246
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.0246?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. Jiannan Ke & Dan Zhang & Huan Zheng, 2019. "An Approximate Dynamic Programming Approach to Dynamic Pricing for Network Revenue Management," Production and Operations Management, Production and Operations Management Society, vol. 28(11), pages 2719-2737, November.
    2. 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.
    3. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    4. 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.
    5. Jin Qin & Yijia Zeng & Xia Yang & Yuxin He & Xuanke Wu & Wenxuan Qu, 2019. "Time-Dependent Pricing for High-Speed Railway in China Based on Revenue Management," Sustainability, MDPI, vol. 11(16), pages 1-18, August.
    6. Sumit Kunnumkal & Kalyan Talluri, 2016. "Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program," Operations Research, INFORMS, vol. 64(1), pages 158-166, February.
    7. Alexander Armstrong & Joern Meissner, 2010. "Railway Revenue Management: Overview and Models (Operations Research)," Working Papers MRG/0019, Department of Management Science, Lancaster University, revised Jul 2010.
    8. Hongmin Li & Woonghee Tim Huh, 2011. "Pricing Multiple Products with the Multinomial Logit and Nested Logit Models: Concavity and Implications," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 549-563, October.
    9. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    10. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    11. 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.
    12. Pornpawee Bumpensanti & He Wang, 2020. "A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management," Management Science, INFORMS, vol. 66(7), pages 2993-3009, July.
    13. Omar Besbes & Costis Maglaras, 2012. "Dynamic Pricing with Financial Milestones: Feedback-Form Policies," Management Science, INFORMS, vol. 58(9), pages 1715-1731, September.
    14. Yining Wang & He Wang, 2022. "Constant Regret Resolving Heuristics for Price-Based Revenue Management," Operations Research, INFORMS, vol. 70(6), pages 3538-3557, November.
    15. Kris Johnson Ferreira & Bin Hong Alex Lee & David Simchi-Levi, 2016. "Analytics for an Online Retailer: Demand Forecasting and Price Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 69-88, February.
    16. Constantinos Maglaras & Joern Meissner, 2006. "Dynamic Pricing Strategies for Multiproduct Revenue Management Problems," Manufacturing & Service Operations Management, INFORMS, vol. 8(2), pages 136-148, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhong, Linhuan & Liu, Yang & Xu, Guangming & Liu, Wei & Yang, Hai, 2025. "Train capacity optimization under stochastic demand: A flexible composition strategy with extra-long trains," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    2. Du, Chengyu & He, Fang & Lin, Xi, 2025. "Dynamic pricing for air cargo revenue management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).

    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. Christiane Barz & Simon Laumer & Marcel Freyschmidt & Jesús Martínez-Blanco, 2023. "Discrete dynamic pricing and application of network revenue management for FlixBus," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(1), pages 16-33, February.
    2. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    3. David Simchi-Levi & Yunzong Xu & Jinglong Zhao, 2025. "Blind Network Revenue Management and Bandits with Knapsacks Under Limited Switches," Operations Research, INFORMS, vol. 73(5), pages 2496-2514, September.
    4. Santiago R. Balseiro & Omar Besbes & Dana Pizarro, 2024. "Survey of Dynamic Resource-Constrained Reward Collection Problems: Unified Model and Analysis," Operations Research, INFORMS, vol. 72(5), pages 2168-2189, September.
    5. Yiwei Chen & Cong Shi, 2023. "Network revenue management with online inverse batch gradient descent method," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2123-2137, July.
    6. Keyvan Kamandanipour & Siamak Haji Yakhchali & Reza Tavakkoli-Moghaddam, 2024. "Dynamic revenue management in a passenger rail network under price and fleet management decisions," Annals of Operations Research, Springer, vol. 342(3), pages 2049-2073, November.
    7. Du, Chengyu & He, Fang & Lin, Xi, 2025. "Dynamic pricing for air cargo revenue management," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
    8. Feng Zhu & Shaoxuan Liu & Rowan Wang & Zizhuo Wang, 2023. "Assign-to-Seat: Dynamic Capacity Control for Selling High-Speed Train Tickets," Manufacturing & Service Operations Management, INFORMS, vol. 25(3), pages 921-938, May.
    9. Chandrasekhar Manchiraju & Milind Dawande & Ganesh Janakiraman, 2024. "Technical Note—A Note on State-Independent Policies in Network Revenue Management," Operations Research, INFORMS, vol. 72(1), pages 277-287, January.
    10. Hyun-Soo Ahn & Christopher Thomas Ryan & Joline Uichanco & Mengzhenyu Zhang, 2026. "Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities," Mathematics of Operations Research, INFORMS, vol. 51(1), pages 498-541, January.
    11. 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.
    12. Haque, Md Tabish & Hamid, Faiz, 2023. "Social distancing and revenue management—A post-pandemic adaptation for railways," Omega, Elsevier, vol. 114(C).
    13. Jiashuo Jiang & Will Ma & Jiawei Zhang, 2025. "Degeneracy Is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions," Operations Research, INFORMS, vol. 73(6), pages 3405-3420, November.
    14. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2019. "Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 601-631, May.
    15. Sajjad Najafi & Izak Duenyas & Stefanus Jasin & Joline Uichanco, 2024. "Multiproduct Dynamic Pricing with Limited Inventories Under a Cascade Click Model," Manufacturing & Service Operations Management, INFORMS, vol. 26(2), pages 554-572, March.
    16. Murray Lei & Sheng Liu & Stefanus Jasin & Andrew Vakhutinsky, 2024. "Joint Inventory and Pricing for a One-Warehouse Multistore Problem: Spiraling Phenomena, Near Optimal Policies, and the Value of Dynamic Pricing," Operations Research, INFORMS, vol. 72(2), pages 738-762, March.
    17. Xiuli Chao & Stefanus Jasin & Sentao Miao, 2025. "Adaptive Lagrangian Policies for a Multiwarehouse, Multistore Inventory System with Lost Sales," Operations Research, INFORMS, vol. 73(3), pages 1615-1636, May.
    18. Yining Wang & He Wang, 2022. "Constant Regret Resolving Heuristics for Price-Based Revenue Management," Operations Research, INFORMS, vol. 70(6), pages 3538-3557, November.
    19. Zerui Wu & Ran Liu & Xu Sun, 2026. "Near-Optimal Pricing and Resource Allocation in a Large-Scale Service System," Operations Research, INFORMS, vol. 74(2), pages 632-650, March.
    20. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.

    More about this item

    Keywords

    ;
    ;
    ;

    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:inm:ormsom:v:26:y:2024:i:1:p:350-369. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.