Abstract
We study the multi-stop aircraft routing problem, determining the sequence of stops and the number of passengers to carry in each segment route. The objective of the aircraft routing problem is to maximize the profit derived from the transportation of passengers over the route. The objective function is the net result of the difference between revenues per passenger carried and aircraft operating costs. The model takes the form of a 0/1 mixed integer linear program and describe formulation refinements which facilitate solution. Since the constraint set of the multi-stop aircraft routing problem includes 0/1 mixed rows, we first derive valid inequalities for this type of regions. Then we apply these results to the constraint set of the routing problem, presenting additional valid inequalities. In addition, polynomial separation algorithms associated with the valid inequalities are presented. Computational results are also included.
García Castañeda, Salvador (1995). The multi-stop aircraft routing problem. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1995 -THESIS -G37.