IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i1p350-369.html
   My bibliography  Save this article

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
    ---><---

    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.

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