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

Loading...
Publication Logo

Date

2024

Authors

Melis Tan Tacoglu
Mustafa Arslan Ornek
Yigit Kazancoglu

Journal Title

Journal ISSN

Volume Title

Publisher

Inderscience Publishers

Open Access Color

Green Open Access

No

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Average
Influence
Average
Popularity
Average

Research Projects

Journal Issue

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. © 2024 Elsevier B.V. All rights reserved.

Description

Keywords

Flight Scheduling, Hub And Spoke Network, Schedule Design, Transit Passenger, Wait Time, Transit Passenger, Flight Scheduling, Wait Time, Schedule Design, Hub and Spoke Network

Fields of Science

Citation

WoS Q

Scopus Q

OpenCitations Logo
OpenCitations Citation Count
2

Source

International Journal of Sustainable Aviation

Volume

10

Issue

3

Start Page

271

End Page

296
PlumX Metrics
Citations

Scopus : 2

Captures

Mendeley Readers : 2

SCOPUS™ Citations

2

checked on Apr 09, 2026

Web of Science™ Citations

2

checked on Apr 09, 2026

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
0.7403

Sustainable Development Goals

SDG data is not available