Abstract:
This paper deals with the problem of air passenger transportation optimal planning. The aim is to minimize renting and operational costs, taking into account heterogeneous fleet, feasibility of multiple visits to the same location, restrictions on the set of available airways, etc. Two multi-index formalizations — as a binary linear programming problem and as a mixed-integer linear programming problem (depending on the consideration of time windows for takeoffs and landings) — are presented for the regarded task. In the future constructed analytical model can become the basis for the development of the globally optimal schedules approximation algorithms.
Keywords:vehicle routing problem, multiple trips, mixed-integer linear programming.