Please use this identifier to cite or link to this item:
|Title:||Short-term booking of air cargo space||Authors:||Chew, E.-P.
Multi-period capacity planning problem
|Issue Date:||1-Nov-2006||Citation:||Chew, E.-P., Huang, H.-C., Johnson, E.L., Nemhauser, G.L., Sokol, J.S., Leong, C.-H. (2006-11-01). Short-term booking of air cargo space. European Journal of Operational Research 174 (3) : 1979-1990. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2005.05.011||Abstract:||This paper proposes a stochastic dynamic programming model for a short-term capacity planning model for air cargo space. Long-term cargo space is usually acquired by freight forwarders or shippers many months ahead on a contract basis, and usually the forecasted demand is unreliable. A re-planning of cargo space is needed when the date draws nearer to the flight departure time. Hence, for a given amount of long-term contract space, the decision for each stage is the quantity of additional space required for the next stage and the decision planning model evaluates the optimal cost policy based on the economic trade-off between the cost of backlogged shipment and the cost of acquiring additional cargo space. Under certain conditions, we show that the return function is convex with respect to the additional space acquired for a given state and the optimal expected cost for the remaining stages is an increasing convex function with respect to the state variables. These two properties can be carried backward recursively and therefore the optimal cost policy can be determined efficiently. © 2005 Elsevier B.V. All rights reserved.||Source Title:||European Journal of Operational Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/87229||ISSN:||03772217||DOI:||10.1016/j.ejor.2005.05.011|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 16, 2019
WEB OF SCIENCETM
checked on Oct 9, 2019
checked on Oct 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.