Busca avançada
Ano de início
Entree


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

Texto completo
Autor(es):
de Campos, Rafael Ajudarte ; Vieira, Thiago ; Munari, Pedro ; Mes, M ; LallaRuiz, E ; Voss, S
Número total de Autores: 6
Tipo de documento: Artigo Científico
Fonte: COMPUTATIONAL LOGISTICS (ICCL 2021); v. 13004, p. 16-pg., 2021-01-01.
Resumo

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)

Processo FAPESP: 19/22235-6 - Roteamento de aeronaves sob incertezas via otimização robusta
Beneficiário:Rafael Ajudarte de Campos
Modalidade de apoio: Bolsas no Brasil - Mestrado
Processo FAPESP: 16/01860-1 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento, localização e suas integrações em contextos industriais e logísticos
Beneficiário:Reinaldo Morabito Neto
Modalidade de apoio: Auxílio à Pesquisa - Temático
Processo FAPESP: 20/11602-5 - Otimização do roteamento de aeronaves com alocação de tripulações e passageiros para o transporte aéreo não regular
Beneficiário:Thiago José dos Santos Vieira
Modalidade de apoio: Bolsas no Brasil - Doutorado
Processo FAPESP: 19/23596-2 - Problemas de roteamento de veículos ricos: modelos e algoritmos para variantes determinísticas e estocásticas
Beneficiário:Pedro Augusto Munari Junior
Modalidade de apoio: Auxílio à Pesquisa - Regular