Heuristic methods for integrated incremental schedule design and fleet assignment problem for hub and spoke network

Abstract

Managing airline inbound and outbound schedules among passenger demand and aircraft utility complexity are addressed through three proposed heuristic methods for integrated schedule design and fleet assignment problem (ISDFAP) in single-hub two-flight leg hub-and-spoke networks. The second heuristic considering waiting time and available seat capacity contrasts with the first focusing only on waiting time for passenger-flight assignments. Meanwhile the third heuristic considers aircraft buffer time and stay time restrictions at the destination. Comparing the first two heuristics reveals that considering seat availability does not reduce waiting time. Flight departure time adjustments and overall timetable changes depend significantly on buffer time and wait time criteria.