Air-cargo capacity allocation for multiple freight forwarders
AbstractWe consider a single air-cargo carrier, which wants to allocate cargo capacity to multiple forwarders before a booking horizon starts. A contribution that the carrier earns from each forwarder is based on the actual allotment usage at the end of the horizon. The airline's problem is to choose the allotments that maximize the expected total contribution. We derive a probability distribution of the actual usage by using a discrete Markov chain and solve the problem by using a dynamic programming method. Two heuristics for a large-scale allocation problem are also proposed, and their performances are tested via numerical experiments.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.
Volume (Year): 47 (2011)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Zhang, Lei).
If references are entirely missing, you can add them using this form.