Cargo Revenue Management: Bid-Prices for a 0-1 Multi Knapsack Problem
Revenue management is the practice of selecting those customers that generate the maximum revenue from a fixed and perishable capacity. Cargo revenue management differs from the well-known passenger revenue management problem by the fact that its capacity constraint is 2-dimensional, i.e. weight and volume, and that the weight, volume and profit of each booking request are random and continuous variables. This leads to a multi-dimensional on-line knapsack problem. We show that a bid-price acceptance policy is asymptotically optimal if demand and capacity increase proportionally and the bid-prices are set correctly. We provide a heuristic to set the bid-prices based on a greedy algorithm for the multi-knapsack problem proposed by Rinnooy Kan et al. (1993). A test case shows that these bid-prices perform better than the traditional LP-based bid-prices that do not perform well at all for this problem.
|Date of creation:||06 Aug 2004|
|Contact details of provider:|| Postal: RSM Erasmus University & Erasmus School of Economics, PoBox 1738, 3000 DR Rotterdam|
Phone: 31-10-408 1182
Fax: 31-10-408 9020
Web page: http://www.erim.eur.nl/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
- Jason D. Papastavrou & Srikanth Rajagopalan & Anton J. Kleywegt, 1996. "The Dynamic and Stochastic Knapsack Problem with Deadlines," Management Science, INFORMS, vol. 42(12), pages 1706-1718, December.
When requesting a correction, please mention this item's handle: RePEc:ems:eureri:1449. 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: (RePub)
If references are entirely missing, you can add them using this form.