Airport Service Vehicle Scheduling
Airport service vehicles, such as luggage trailers and passenger buses, service an aircraft af- ter the aircraft arrives and before it departs. The timely arrivals of these vehicles help ensure e cient use of airport resources. This research investigates algorithms for scheduling airport service vehicles. A mixed integer linear program is proposed, minimiz- ing service provider fuel costs and air carrier delays. The formulation of the integer programming problem is modi ed to aid solution search strategies. A ge- netic algorithm heuristic borrowed from aircraft ar- rival scheduling is introduced for nding approximate solutions relatively quickly, in addition to an exact so- lution method making use of branch and bound tech- niques specially designed for this problem. The vari- ous algorithms are tested using simulations of service provider dispatch problems at Hamburg and Dallas- Fort Worth Airports. Results show that plan based service vehicle scheduling reduces both delay and fuel costs over passive strategies, often 20% or more. The genetic algorithm based heuristic also reduced delay and fuel costs while incurring computational burdens signi cantly below those of the optimal search strat- egy.