Network revenue management with product-specific no-shows
Revenue management practices often include overbooking capacity to account for customers who make reservations but do not show up. In this paper, we consider the network revenue management problem with no-shows and overbooking, where the show-up probabilities are specific to each product. No-show rates differ significantly by product (for instance, each itinerary and fare combination for an airline) as sale restrictions and the demand characteristics vary by product. However, models that consider no-show rates by each individual product are difficult to handle as the state-space in dynamic programming formulations (or the variable space in approximations) increases significantly. In this paper, we propose a randomized linear program to jointly make the capacity control and overbooking decisions with product-specific no-shows. We establish that our formulation gives an upper bound on the optimal expected total profit and our upper bound is tighter than a deterministic linear programming upper bound that appears in the existing literature. Furthermore, we show that our upper bound is asymptotically tight in a regime where the leg capacities and the expected demand is scaled linearly with the same rate. We also describe how the randomized linear program can be used to obtain a bid price control policy. Computational experiments indicate that our approach is quite fast, able to scale to industrial problems and can provide significant improvements over standard benchmarks.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:1243. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.