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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
