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

Performance Guarantees for Network Revenue Management with Flexible Products

Author

Listed:
  • Wenchang Zhu

    (School of Operations Research and Information Engineering, Cornell Tech, New York, New York 10044)

  • Huseyin Topaloglu

    (School of Operations Research and Information Engineering, Cornell Tech, New York, New York 10044)

Abstract

Problem definition : We consider network revenue management problems with flexible products. We have a network of resources with limited capacities. To each customer arriving into the system, we offer an assortment of products. The customer chooses a product within the offered assortment or decides to leave without a purchase. The products are flexible in the sense that there are multiple possible combinations of resources that we can use to serve a customer with a purchase for a particular product. We refer to each such combination of resources as a route. The service provider chooses the route to serve a customer with a purchase for a particular product. Such flexible products occur, for example, when customers book at-home cleaning services but leave the timing of service to the company that provides the service. Our goal is to find a policy to decide which assortment of products to offer to each customer to maximize the total expected revenue, making sure that there are always feasible route assignments for the customers with purchased products. Methodology/results : We start by considering the case in which we make the route assignments at the end of the selling horizon. The dynamic programming formulation of the problem is significantly different from its analogue without flexible products as the state variable keeps track of the number of purchases for each product rather than the remaining capacity of each resource. Letting L be the maximum number of resources in a route, we give a policy that obtains at least 1 / ( 1 + L ) fraction of the optimal total expected revenue. We extend our policy to the case in which we make the route assignments periodically over the selling horizon. Managerial implications : To our knowledge, the policy that we develop is the first with a performance guarantee under flexible products. Thus, our work constructs policies that can be implemented in practice under flexible products, also providing performance guarantees.

Suggested Citation

  • Wenchang Zhu & Huseyin Topaloglu, 2024. "Performance Guarantees for Network Revenue Management with Flexible Products," Manufacturing & Service Operations Management, INFORMS, vol. 26(1), pages 252-270, January.
    • Handle: RePEc:inm:ormsom:v:26:y:2024:i:1:p:252-270
    DOI: 10.1287/msom.2022.0583
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.0583
    Download Restriction: no
    File URL: https://libkey.io/10.1287/msom.2022.0583?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. Steinhardt, Claudius & Gönsch, Jochen, 2012. "Integrated revenue management approaches for capacity control with planned upgrades," European Journal of Operational Research, Elsevier, vol. 223(2), pages 380-391.
    2. Scott Fay & Jinhong Xie, 2008. "Probabilistic Goods: A Creative Way of Selling Products and Services," Marketing Science, INFORMS, vol. 27(4), pages 674-690, 07-08.
    3. 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.
    4. Dimitris Bertsimas & Ioana Popescu, 2003. "Revenue Management in a Dynamic Network Environment," Transportation Science, INFORMS, vol. 37(3), pages 257-277, August.
    5. Alexander Erdelyi & Huseyin Topaloglu, 2010. "A Dynamic Programming Decomposition Method for Making Overbooking Decisions Over an Airline Network," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 443-456, August.
    6. Yongbo Xiao & Jian Chen, 2014. "Evaluating the potential effects from probabilistic selling of similar products," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(8), pages 604-620, December.
    7. Adam N. Elmachtoub & Michael L. Hamilton, 2021. "The Power of Opaque Products in Pricing," Management Science, INFORMS, vol. 67(8), pages 4686-4702, August.
    8. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "Dynamic Assortment Optimization for Reusable Products with Random Usage Durations," Management Science, INFORMS, vol. 66(7), pages 2820-2844, July.
    9. Scott Fay & Jinhong Xie, 2015. "Timing of Product Allocation: Using Probabilistic Selling to Enhance Inventory Management," Management Science, INFORMS, vol. 61(2), pages 474-484, February.
    10. 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.
    11. Vahideh Manshadi & Scott Rodilitz, 2022. "Online Policies for Efficient Volunteer Crowdsourcing," Management Science, INFORMS, vol. 68(9), pages 6572-6590, September.
    12. Guillermo Gallego & Robert Phillips, 2004. "Revenue Management of Flexible Products," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 321-337, January.
    13. Robert A. Shumsky & Fuqiang Zhang, 2009. "Dynamic Capacity Management with Substitution," Operations Research, INFORMS, vol. 57(3), pages 671-684, June.
    14. Yueshan Yu & Xin Chen & Fuqiang Zhang, 2015. "Dynamic Capacity Management with General Upgrading," Operations Research, INFORMS, vol. 63(6), pages 1372-1389, December.
    15. Itir Karaesmen & Garrett van Ryzin, 2004. "Overbooking with Substitutable Inventory Classes," Operations Research, INFORMS, vol. 52(1), pages 83-104, February.
    16. 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.
    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. Bingxin Du & Nariaki Nishino & Koji Kimita, 2024. "Space Booking with Multistage Online VCG Mechanism: A Simulation Study Toward Practical Application," Service Science, INFORMS, vol. 16(2), pages 107-123, June.
    2. Wang, Miao & Li, Feng & Xu, Zhou & Yang, Xianyan & Wang, Julong, 2026. "Order selection and fulfillment integration with flexible products," Omega, Elsevier, vol. 138(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. Klein, Robert & Koch, Sebastian & Steinhardt, Claudius & Strauss, Arne K., 2020. "A review of revenue management: Recent generalizations and advances in industry applications," European Journal of Operational Research, Elsevier, vol. 284(2), pages 397-412.
    2. Ben Li & Xiaolong Guo & Liang Liang, 2024. "Optimal pricing decision and capacity allocation of opaque selling in airline revenue management," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 23(4), pages 356-368, August.
    3. Guang Yang & Ying Wang & Mulin Liu, 2023. "Optimal Policy for Probabilistic Selling with Three-Way Revenue Sharing Contract under the Perspective of Sustainable Supply Chain," Sustainability, MDPI, vol. 15(4), pages 1-22, February.
    4. Nurşen Aydın & Ş. İlker Birbil & Hüseyin Topaloğlu, 2017. "Delayed Purchase Options in Single-Leg Revenue Management," Transportation Science, INFORMS, vol. 51(4), pages 1031-1045, November.
    5. 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.
    6. Xufeng Yang & Juliang Zhang & Wen Jiao & Hong Yan, 2023. "Optimal Capacity Rationing Policy for a Container Leasing System with Multiple Kinds of Customers and Substitutable Containers," Management Science, INFORMS, vol. 69(3), pages 1468-1485, March.
    7. Guo, Xiaolong & Bian, Junsong & Wu, Peiyan & Shi, Victor & Chen, Huangen, 2023. "Probabilistic product design with regret-anticipated consumers," International Journal of Production Economics, Elsevier, vol. 263(C).
    8. Moongil Yoon & Habin Lee, 2021. "Seat assignment problem with the payable up-grade as an ancillary service of airlines," Annals of Operations Research, Springer, vol. 307(1), pages 483-497, December.
    9. Steinhardt, Claudius & Gönsch, Jochen, 2012. "Integrated revenue management approaches for capacity control with planned upgrades," European Journal of Operational Research, Elsevier, vol. 223(2), pages 380-391.
    10. 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.
    11. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu & Yicheng Bai, 2023. "Revenue Management with Heterogeneous Resources: Unit Resource Capacities, Advance Bookings, and Itineraries over Time Intervals," Operations Research, INFORMS, vol. 71(6), pages 2196-2216, November.
    12. Yang, Guang & Tian, Lin & Cai, Mei & Cao, Jie & Gong, Zaiwu, 2025. "Vertically probabilistic selling mechanism under asymmetric quality-tier competition: An analytical exploration," International Journal of Production Economics, Elsevier, vol. 286(C).
    13. Zhang, Zihao & Zhang, Mengying, 2024. "Pricing and Capacity Allocation in Opaque Selling," European Journal of Operational Research, Elsevier, vol. 318(1), pages 230-241.
    14. Yao Cui & Izak Duenyas & Ozge Sahin, 2018. "Pricing of Conditional Upgrades in the Presence of Strategic Consumers," Management Science, INFORMS, vol. 64(7), pages 3208-3226, July.
    15. David Simchi-Levi & Zeyu Zheng & Feng Zhu, 2025. "On Greedy-Like Policies in Online Matching with Reusable Network Resources and Decaying Rewards," Management Science, INFORMS, vol. 71(10), pages 8908-8926, October.
    16. Jackie Baek & Will Ma, 2022. "Technical Note—Bifurcating Constraints to Improve Approximation Ratios for Network Revenue Management with Reusable Resources," Operations Research, INFORMS, vol. 70(4), pages 2226-2236, July.
    17. Yifan Wu & Shibo Jin, 2022. "Joint pricing and inventory decision under a probabilistic selling strategy," Operational Research, Springer, vol. 22(2), pages 1209-1233, April.
    18. Ningyuan Chen & Adam N. Elmachtoub & Michael L. Hamilton & Xiao Lei, 2021. "Loot Box Pricing and Design," Management Science, INFORMS, vol. 67(8), pages 4809-4825, August.
    19. Strauss, Arne & Gülpınar, Nalan & Zheng, Yijun, 2021. "Dynamic pricing of flexible time slots for attended home delivery," European Journal of Operational Research, Elsevier, vol. 294(3), pages 1022-1041.
    20. Sumit Kunnumkal & Huseyin Topaloglu, 2011. "A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(4), pages 323-343, June.

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