IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v309y2023i1p252-270.html
   My bibliography  Save this article

Reductions of non-separable approximate linear programs for network revenue management

Author

Listed:
  • Laumer, Simon
  • Barz, Christiane

Abstract

We suggest a novel choice of non-separable basis functions for an approximate linear programming approach to the well-known network revenue management problem. Considering non-separability is particularly important when interdependencies between resources are large. Such a situation can be illustrated for example by a bus line, where different origin-destination pairs have many overlapping segments. Traditional separable approximation approaches tend to ignore the resulting interactions.

Suggested Citation

  • Laumer, Simon & Barz, Christiane, 2023. "Reductions of non-separable approximate linear programs for network revenue management," European Journal of Operational Research, Elsevier, vol. 309(1), pages 252-270.
    • Handle: RePEc:eee:ejores:v:309:y:2023:i:1:p:252-270
    DOI: 10.1016/j.ejor.2023.01.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723000061
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2023.01.006?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.

    References listed on IDEAS

    as
    1. 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.
    2. Arne K. Strauss & Kalyan Talluri, 2017. "Tractable Consideration Set Structures for Assortment Optimization and Network Revenue Management," Production and Operations Management, Production and Operations Management Society, vol. 26(7), pages 1359-1368, July.
    3. Huseyin Topaloglu, 2009. "Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 637-649, June.
    4. Guillermo Gallego & Richard Ratliff & Sergey Shebalov, 2015. "A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice," Operations Research, INFORMS, vol. 63(1), pages 212-232, February.
    5. Sumit Kunnumkal & Kalyan Talluri, 2016. "On a Piecewise-Linear Approximation for Network Revenue Management," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 72-91, February.
    6. J. R. Morrison & P. R. Kumar, 1999. "New Linear Program Performance Bounds for Queueing Networks," Journal of Optimization Theory and Applications, Springer, vol. 100(3), pages 575-597, March.
    7. Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
    8. 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.
    9. Kalyan Talluri & Garrett van Ryzin, 2004. "Revenue Management Under a General Discrete Choice Model of Consumer Behavior," Management Science, INFORMS, vol. 50(1), pages 15-33, January.
    10. Kalyan Talluri & Garrett van Ryzin, 1998. "An Analysis of Bid-Price Controls for Network Revenue Management," Management Science, INFORMS, vol. 44(11-Part-1), pages 1577-1593, November.
    11. Jeffrey I. McGill & Garrett J. van Ryzin, 1999. "Revenue Management: Research Overview and Prospects," Transportation Science, INFORMS, vol. 33(2), pages 233-256, May.
    12. Daniela Pucci de Farias & Benjamin Van Roy, 2004. "On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 462-478, August.
    13. Daniel Adelman & Diego Klabjan, 2012. "Computing Near-Optimal Policies in Generalized Joint Replenishment," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 148-164, February.
    14. Chaoxu Tong & Huseyin Topaloglu, 2014. "On the Approximate Linear Programming Approach for Network Revenue Management Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 121-134, February.
    15. William L. Cooper & Tito Homem-de-Mello, 2007. "Some Decomposition Methods for Revenue Management," Transportation Science, INFORMS, vol. 41(3), pages 332-353, August.
    16. Trick, Michael A. & Zin, Stanley E., 1997. "Spline Approximations To Value Functions," Macroeconomic Dynamics, Cambridge University Press, vol. 1(1), pages 255-277, January.
    17. 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.
    18. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    19. Sumit Kunnumkal & Kalyan Talluri, 2019. "A strong Lagrangian relaxation for general discrete-choice network revenue management," Computational Optimization and Applications, Springer, vol. 73(1), pages 275-310, May.
    20. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    21. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    22. 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.
    23. Adam Diamant & Joseph Milner & Fayez Quereshy, 2018. "Dynamic Patient Scheduling for Multi†Appointment Health Care Programs," Production and Operations Management, Production and Operations Management Society, vol. 27(1), pages 58-79, January.
    24. Hosseinalifam, M. & Marcotte, P. & Savard, G., 2016. "A new bid price approach to dynamic resource allocation in network revenue management," European Journal of Operational Research, Elsevier, vol. 255(1), pages 142-150.
    25. 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.
    26. D. P. de Farias & B. Van Roy, 2003. "The Linear Programming Approach to Approximate Dynamic Programming," Operations Research, INFORMS, vol. 51(6), pages 850-865, December.
    27. Daniel Adelman, 2004. "A Price-Directed Approach to Stochastic Inventory/Routing," Operations Research, INFORMS, vol. 52(4), pages 499-514, August.
    28. Diego Klabjan & Daniel Adelman, 2007. "An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 528-550, August.
    29. David Sayah, 2015. "Approximate Linear Programming in Network Revenue Management with Multiple Modes," Working Papers 1518, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    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. 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.
    2. 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.
    3. Qihang Lin & Selvaprabu Nadarajah & Negar Soheili, 2020. "Revisiting Approximate Linear Programming: Constraint-Violation Learning with Applications to Inventory Control and Energy Storage," Management Science, INFORMS, vol. 66(4), pages 1544-1562, April.
    4. Wang, Tingsong & Meng, Qiang & Tian, Xuecheng, 2024. "Dynamic container slot allocation for a liner shipping service," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    5. 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.
    6. 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.
    7. Meissner, Joern & Strauss, Arne, 2012. "Improved bid prices for choice-based network revenue management," European Journal of Operational Research, Elsevier, vol. 217(2), pages 417-427.
    8. 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.
    9. Selvaprabu Nadarajah & François Margot & Nicola Secomandi, 2015. "Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage," Management Science, INFORMS, vol. 61(12), pages 3054-3076, December.
    10. 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.
    11. Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
    12. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
    13. 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.
    14. 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.
    15. Sumit Kunnumkal & Kalyan Talluri, 2019. "A strong Lagrangian relaxation for general discrete-choice network revenue management," Computational Optimization and Applications, Springer, vol. 73(1), pages 275-310, May.
    16. 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.
    17. Juan M. Chaneton & Gustavo Vulcano, 2011. "Computing Bid Prices for Revenue Management Under Customer Choice Behavior," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 452-470, October.
    18. Alejandro Toriello & William B. Haskell & Michael Poremba, 2014. "A Dynamic Traveling Salesman Problem with Stochastic Arc Costs," Operations Research, INFORMS, vol. 62(5), pages 1107-1125, October.
    19. Tatsiana Levina & Yuri Levin & Jeff McGill & Mikhail Nediak, 2011. "Network Cargo Capacity Management," Operations Research, INFORMS, vol. 59(4), pages 1008-1023, August.
    20. Sumit Kunnumkal & Kalyan Talluri, 2016. "On a Piecewise-Linear Approximation for Network Revenue Management," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 72-91, February.

    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:ejores:v:309:y:2023:i:1:p:252-270. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.