A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem

2017 ◽  
Vol 51 (1) ◽  
pp. 233-249 ◽  
Author(s):  
Shengzhi Shao ◽  
Hanif D. Sherali ◽  
Mohamed Haouari
Keyword(s):  
Fleet Assignment ◽  
Decomposition Approach ◽  
Aircraft Routing ◽  
Crew Pairing ◽  
Pairing Problem ◽  
Airline Fleet ◽  
Novel Model

A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem

2021 ◽  
pp. 105551
Author(s):  
Mohamed Ben Ahmed ◽  
Maryia Hryhoryeva ◽  
Lars Magnus Hvattum ◽  
Mohamed Haouari
Keyword(s):  
Fleet Assignment ◽  
Aircraft Routing ◽  
Crew Pairing ◽  
Pairing Problem ◽  
Airline Fleet

scholarly journals Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

2017 ◽  
Vol 9 (48) ◽  
Author(s):  
NurulFarihan Mohamed ◽  
ZaitulMarlizawati Zainuddin ◽  
Said Salhi ◽  
Nurul Huda Mohamed ◽  
NurulAkmal Mohamed
Keyword(s):  
Hybrid Algorithm ◽  
Routing Problem ◽  
Aircraft Routing ◽  
Crew Pairing ◽  
Pairing Problem

scholarly journals THE INTEGRATED AIRCRAFT ROUTING AND CREW PAIRING PROBLEM: ILP BASED FORMULATIONS

2016 ◽  
Vol 78 (6-5) ◽  
Author(s):  
Nurul Farihan Mohamed ◽  
Zaitul Marlizawati Zainuddin ◽  
Said Salhi ◽  
Nurul Akmal Mohamed
Keyword(s):  
Solution Method ◽  
Benders Decomposition ◽  
Planning Process ◽  
Minimum Cost ◽  
Problem Model ◽  
Aircraft Routing ◽  
Crew Pairing ◽  
Pairing Problem ◽  
Programming Solution ◽  
Important Objective

Minimization of cost is very important in airline as great profit is an important objective for any airline system. One way to minimize the costs in airline is by developing an integrated planning process. Airline planning consists of many difficult operational decision problems including aircraft routing and crew pairing problems. These two sub-problems, though interrelated in practice, are usually solved sequentially leading to suboptimal solutions. We propose an integrated aircraft routing and crew pairing problem model, one approach to generate the feasible aircraft routes and crew pairs, followed by three approaches to solve the integrated model. The integrated aircraft routing and crew scheduling problem is to determine a minimum cost aircraft routes and crew schedules while each flight leg is covered by one aircraft and one crew. The first approach is an integer programming solution method, the second formulation is developed in a way to lend itself to be used efficiently by Dantzig Wolfe decomposition whereas the third one is formulated as a Benders decomposition method. Encouraging results are obtained when tested on four types of aircraft based on local flights in Malaysia for one week flight cycle. 

A Heuristic and Exact Method: Integrated Aircraft Routing and Crew Pairing Problem

2016 ◽  
Vol 10 (4) ◽  
pp. 128 ◽  
Author(s):  
Nurul Farihan Mohamed ◽  
Zaitul Marlizawati Zainuddin ◽  
Said Salhi ◽  
Nurul Huda Mohamed ◽  
Nurul Akmal Mohamed
Keyword(s):  
Heuristic Method ◽  
Integrated Model ◽  
Exact Method ◽  
Routing Problem ◽  
Aircraft Routing ◽  
Suboptimal Solutions ◽  
Constructive Heuristic ◽  
Schedule Design ◽  
Crew Pairing ◽  
Pairing Problem

<p>In airline operations planning, there are four problems which are schedule design, fleet assignment, aircraft routing and crew pairing problem. Those problems are sequentially and interdependent. Aircraft routing and crew pairing problem are hard to solve and normally crew pairing problem dependent to the aircraft routing problem which gives the suboptimal solutions. As minimizing the costs is important in the airline system, so in order to tackle suboptimal solutions, aircraft routing problem and crew pairing problem are being integrated in one model. For solving the integrated model, the feasible aircraft routes and crew pairs are required. Because of that, a method is being proposed in this work for generating the feasible aircraft routes and crew pairs which is the constructive heuristic method. By using the generic aircraft routes and crew pairs, the integrated model then being solve by two approaches. The first approach is the exact method called the integer linear programming (ILP) while the second approach is from the heuristic method called particle swarm optimization. Encouraging results are encountered by testing on four types of aircrafts for one week flight cycle from local flights in Malaysia.</p>

scholarly journals Solving a large-scale integrated fleet assignment and crew pairing problem

2016 ◽  
Vol 253 (1) ◽  
pp. 477-500 ◽  
Author(s):  
Okan Örsan Özener ◽  
Melda Örmeci Matoğlu ◽  
Güneş Erdoğan ◽  
Mohamed Haouari ◽  
Hasan Sözer
Keyword(s):  
Large Scale ◽  
Fleet Assignment ◽  
Crew Pairing ◽  
Pairing Problem

scholarly journals Two-Phase Heuristic Algorithm for Integrated Airline Fleet Assignment and Routing Problem

Energies ◽  
2021 ◽  
Vol 14 (11) ◽  
pp. 3327
Author(s):  
Vildan Özkır ◽  
Mahmud Sami Özgür
Keyword(s):  
Mathematical Model ◽  
Heuristic Algorithm ◽  
Airline Industry ◽  
Numerical Study ◽  
Heuristic Method ◽  
Planning Problem ◽  
Fleet Assignment ◽  
Routing Problem ◽  
Aircraft Routing ◽  
Airline Fleet

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.

Sign in / Sign up

Export Citation Format

Share Document