Air cargo pickup schedule for single delivery location

  • Authors:

  • Minnie H. Patel;Yasser Dessouky;Sumeet Solanki;Elvin Carbonel

  • Affiliations:

  • San Jose State University, One Washington Square, San Jose, CA 95192-0085, USA;San Jose State University, One Washington Square, San Jose, CA 95192-0085, USA;San Jose State University, One Washington Square, San Jose, CA 95192-0085, USA;San Jose State University, One Washington Square, San Jose, CA 95192-0085, USA

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, various deterministic models for determining optimal pickup times for air cargo from an airport and delivering it to a local distribution center for a global manufacturer are presented. The arrival times of the flights that can potentially bring air cargo are assumed to be deterministic and known. In addition, the custom clearance time for the air cargo and the traveling time from the airport to the local distribution center are assumed to be deterministic and known. These models are formulated mathematically as linear binary integer programming models without air cargo weight considerations. Deterministic formulations without air cargo weight information are shown to be related to the p-Median problem. The deterministic formulation of air cargo pickup times with air cargo weight consideration is shown to be a nonlinear binary integer programming model. The solutions of these models serve as an initial starting point to solve the stochastic problem with random arrival times of the flights and random custom clearance times and travel times.