A new approach to fleet assignment and aircraft routing problems

Yusuf Ziya Ünal, Mehmet Şevkli, Özgür Uysal, Ali Türkyılmaz

2021

Full text Open access: Gold Metadata (CSL-JSON)

DOI 10.1016/j.trpro.2021.11.098

Data confidence 70 medium

How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In this study, a new mathematical formulation is developed for fleet scheduling problems (i.e., the combination of fleet assignment and aircraft routing problems) in single hub & spoke systems. The proposed model aims to minimize the total cost of allocating aircraft to flights while observing the sequence of flights to be subject to seat capacity, passenger demand, aircraft availability, and overlapping flights. Since the classical fleet scheduling problem is NP-hard, a couple of complexity reduction techniques are developed. Thus, the size of the problem is decreased significantly. To evaluate the model’s performance, it is implemented to an airline carrier with 170 aircraft and 1290 (645 round trip) flights. As a result, the proposed method ended up with an improvement of 36.7% for a 2-day planning horizon.