Abstract
High profitability and high costs have stiffened competition in the airline industry. The main purpose of the study is to propose a computationally efficient algorithm for integrated fleet assignments and aircraft routing problems for a real-case hub and spoke airline planning problem. The economic concerns of airline operations have led to the need for minimising costs and increasing the ability to meet rising demands. Since fleets are the most limited and valuable assets of airline carriers, the allocation of aircraft to scheduled flights directly affects profitability/market share. The airline fleet assignment problem (AFAP) addresses the assignment of aircraft, each with a different capacity, capability, availability, and requirement, to a given flight schedule. This study proposes a mathematical model and heuristic method for solving a real-life airline fleet assignment and aircraft routing problem. We generate a set of problem instances based on real data and conduct a computational experiment to assess the performance of the proposed algorithm. The numerical study and experimental results indicate that the heuristic algorithm provides optimal solutions for the integrated fleet assignment and aircraft routing problem. Furthermore, a computational study reveals that compared with the heuristic method, solving the mathematical model takes significantly longer to execute.
Highlights
The rapid increase in the demand for airline transportation and air traffic has led airline companies to use their resources more effectively
Jamili [15] proposed a new robust mathematical model to solve integrated aircraft routing and scheduling, considering the fleet assignment problem and developed a heuristic algorithm based on simulated annealing
We extended the connection network model of airline fleet assignment problem (AFAP) by maximising the profit function with two main industry adopted metrics
Summary
The rapid increase in the demand for airline transportation and air traffic has led airline companies to use their resources more effectively. Assigning an aircraft with a higher seat capacity than passenger demand results in extra operating cost, idle capacity, and opportunity costs. For this reason, allocating appropriate aircraft types to predetermined flight legs is an important problem that directly affects profitability for airline companies. Abara [1] first introduced the connection network structure and formulated an integer programming model for solving AFAP. Rushmeier and Kontogiorgis [3] proposed a similar model to Abara [1] for the formulation of a large-scale fleet assignment problem by focusing on representing flight connection possibilities. This study presents an integer programming model and a heuristic algorithm for AFAP.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
