Optimal solution for a cargo revenue management problem with allotment and spot arrivals
Daryanti Haidar ()
Transportation Research Part E: Logistics and Transportation Review, 2014, vol. 72, issue C, 173-191
Abstract:
We consider a single-leg cargo revenue management problem, in which a two-dimensional cargo capacity is sold through allotment contracts and in the spot market. Capacity sold on an allotment basis is guaranteed. We optimally solve the problem of determining how much of the total weight and volume capacity to sell on an allotment basis, by deriving a closed-form expression of the objective function. We provide numerical examples of industry-size problems and perform sensitivity analysis by changing some problem parameters. The sensitivity analysis illustrates the dependency of the optimal decisions on the spot and allotment booking types. The remaining capacity is then sold over a booking horizon in the spot market. Allotment bookings and spot requests can arrive any time over the booking horizon. Since some of the allotment bookings might not show up at departure, cargo carriers tend to overbook the remaining capacity allocated to spot requests. For these requests, we formulate a discrete-time dynamic capacity control model, to decide which of the spot requests to accept, based on the total weight and volume of the allotment show-ups and spot bookings accepted at the time of an arrival. We solve the exact dynamic programming model for medium-size industry problems. Since the booking policy based on critical booking levels or time periods is not optimal, we propose several heuristics to solve large industry problems and derive an upper bound on the value function. We test their performance via simulation against the optimal solution, the upper bound, and the first-come first-served policy, and recommend a heuristic that performs well in a wide variety of numerical cases. Finally, we show via simulation, that our model outperforms the one existing in the literature, for small and medium-size industry problems.
Keywords: Revenue management; Cargo; Multi-dimensional capacity control; Markov decision process; Dynamic programming (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554514001732
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:72:y:2014:i:c:p:173-191
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
DOI: 10.1016/j.tre.2014.10.006
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().