Advanced search
Start date
Betweenand


A Branch-and-Cut Algorithm for Aircraft Routing with Crew Assignment for On-Demand Air Transportation

Full text
Author(s):
de Campos, Rafael Ajudarte ; Vieira, Thiago ; Munari, Pedro ; Mes, M ; LallaRuiz, E ; Voss, S
Total Authors: 6
Document type: Journal article
Source: COMPUTATIONAL LOGISTICS (ICCL 2021); v. 13004, p. 16-pg., 2021-01-01.
Abstract

We address the aircraft routing problem with crew assignment in the context of on-demand air transportation. This problem involves the design of least-cost routes for an aircraft set in order to service private flight requests, considering the customer preferences, fleet characteristics and maintenance events. Additionally, a crew team has to be assigned to each route while satisfying the crew legislation, including duty time limitations and minimum rest times. Despite its practical relevance, integrated aircraft routing and crew assignment has been barely explored in the literature addressing on-demand air transportation. In this paper, we propose a tailored branch-and-cut algorithm to effectively solve the addressed problem, which resorts to a strategy based on dynamic programming to separate cuts that guarantee the feasibility regarding crew legislation. In computational experiments carried out using real-life data provided by a company, the method obtained optimal solutions for all instances in less than five minutes. Moreover, these solutions indicate a potential improvement of around 23% in the operational cost when compared to the routes designed by the company, which highlights the benefits of using the proposed approach in practice. (AU)

FAPESP's process: 19/22235-6 - Aircraft routing under uncertainty via robust optimization
Grantee:Rafael Ajudarte de Campos
Support Opportunities: Scholarships in Brazil - Master
FAPESP's process: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants
FAPESP's process: 20/11602-5 - Optimization of aircraft routing with allocation of crews and passengers for non-regular air transport
Grantee:Thiago José dos Santos Vieira
Support Opportunities: Scholarships in Brazil - Doctorate
FAPESP's process: 19/23596-2 - Rich vehicle routing problems: models and algorithms for deterministic and stochastic variants
Grantee:Pedro Augusto Munari Junior
Support Opportunities: Regular Research Grants