A Theoretical Comparison of Feasibility Cuts for the Integrated Aircraft-Routing and Crew-Pairing Problem

2008 ◽  
Vol 42 (1) ◽  
pp. 87-104 ◽  
Author(s):  
Anne Mercier
Keyword(s):  
Aircraft Routing ◽  
Theoretical Comparison ◽  
Crew Pairing ◽  
Pairing Problem

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 Comparison of two hybrid algorithms on incorporated aircraft routing and crew pairing problems

2020 ◽  
Vol 18 (3) ◽  
pp. 1665
Author(s):  
Mohamed N. F. ◽  
Mohamed N. A. ◽  
Mohamed N. H. ◽  
Subani N.
Keyword(s):  
Computational Results ◽  
Airline Operations ◽  
Sequential Method ◽  
Swarm Optimization ◽  
Routing Problem ◽  
Operations Planning ◽  
Aircraft Routing ◽  
Crew Pairing ◽  
Pairing Problem ◽  
Two Hybrid

<span>In airline operations planning, a sequential method is traditionally used in airline system. In airline systems, minimizing the costs is important as they want to get the highest profits. The aircraft routing problem is solved first, and then pursued by crew pairing problem. The solutions are suboptimal in some cases, so we incorporate aircraft routing and crew pairing problems into one mathematical model to get an exact solution. Before we solve the integrated aircraft routing and crew pairing problem, we need to get the aircraft routes (AR) and crew pairs (CP). In this study, we suggested using genetic algorithm (GA) to develop a set of AR and CP. By using the generated AR and CP, we tackle the integrated aircraft and crew pairing problems using two suggested techniques, Integer Linear Programming (ILP) and Particle Swarm Optimization (PSO). Computational results show that GA's executed of AR and CP and then solved by ILP obtained the greatest results among all the methods suggested.</span>

A branch-and-price heuristic for the crew pairing problem with language constraints

2020 ◽  
Vol 283 (3) ◽  
pp. 1040-1054 ◽  
Author(s):  
Frédéric Quesnel ◽  
Guy Desaulniers ◽  
François Soumis
Keyword(s):  
Branch And Price ◽  
Crew Pairing ◽  
Pairing Problem

A New Compact Formulation for the Daily Crew Pairing Problem

2019 ◽  
Author(s):  
Mohamed Haouari ◽  
Farah Zeghal Mansour ◽  
Hanif D. Sherali
Keyword(s):  
Compact Formulation ◽  
Crew Pairing ◽  
Pairing Problem

Deadhead Selection for the Long-Haul Crew Pairing Problem

1995 ◽  
Vol 43 (3) ◽  
pp. 491-499 ◽  
Author(s):  
Cynthia Barnhart ◽  
Levent Hatay ◽  
Ellis L. Johnson
Keyword(s):  
Crew Pairing ◽  
Selection For ◽  
Pairing Problem
Sign in / Sign up

Export Citation Format

Share Document