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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam. in its series Research Paper with number
ERS-2004-055-LIS Revision_Date: 2009-07-29.