Bid Prices When Demand Is a Mix of Individual and Batch Bookings

Industries such as aviation, hospitality, and package tours often face both individual and batch bookings, requiring one unit and multiple units of capacity, respectively. Using bid prices is a common practice in accepting or rejecting an incoming booking (or equivalently, deciding which price bucket to offer to the incoming bookings at a given time). Most of the literature and existing applications for making accept/reject decisions model the arrival stream as individual bookings. In this paper, the authors propose an effective approach to determine bid prices when there is a mixed demand pattern with individual and batch bookings. The authors propose decomposing the demand into “small” and “large” bookings, using dynamic programming for large bookings, and a fast, high-quality approximation for small bookings. The authors present an application of their approach in the air cargo industry, where cargo is often separated into two categories, namely, mail and packages (small cargo) and freight (large cargo). To obtain bid prices for small cargo, the authors approximate cargo booking requests with passenger arrival models and develop an efficient and effective algorithm to solve the probabilistic nonlinear formulation of the seat allocation problem from the passenger literature. To obtain bid prices for large cargo, the authors solve a dynamic program decomposed by flight leg, which is tractable due to the scattered arrivals and large sizes of the bookings. The authors' approach leads to a significant potential increase in revenues compared to the first-come, first-served (FCFS) approach and the solution from the deterministic formulation (DIP), two methods commonly used in practice.

Language

  • English

Media Info

  • Media Type: Print
  • Features: Figures; References; Tables;
  • Pagination: pp 198-213
  • Serial:

Subject/Index Terms

Filing Info

  • Accession Number: 01482843
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 3 2013 9:20AM