Modeling and solving a Crew Assignment Problem in air transportation

Zeghal, Farah; Minoux, Michel

doi:10.1016/j.ejor.2004.11.028

Cited by 46 publications

(31 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Dessa forma, podem surgir conflitos durante a atribuição das escalas aos tripulantes no PAE, ocasionando custos extras e perda de qualidade da solução final. Para contornar tais desvantagens, o estado da arte do PPT envolve uma solução integrada, em que ambos os subproblemas (PDV e PAE) são resolvidos simultaneamente (Zeghal e Minoux, 2006;Gomes, 2009;Souai e Teghem, 2009). …”

Section: O Problema Na Literaturaunclassified

“…Zeghal e Minoux (2006) propuseram uma estratégia para a solução integrada do PPT através de uma abordagem com duas fases distintas, eliminando a necessidade de geração de viagens. Na primeira fase, todas as jornadas viáveis são geradas a partir dos voos.…”

Section: O Problema Na Literaturaunclassified

“…Souai e Teghem (2009) adotaram uma estratégia similar à apresentada por Zeghal e Minoux (2006). Na primeira fase, todas as jornadas viáveis são geradas, mas na segunda fase a atribuição de jornadas aos tripulantes é otimizada através de um algoritmo genético híbrido.…”

Section: O Problema Na Literaturaunclassified

See 2 more Smart Citations

Modelagem Integrada do Problema de Programação de Tripulantes de Aeronaves

Gomes

2011

TRANSPORTES

View full text Add to dashboard Cite

Resumo: Este artigo trata o Problema de Programação de Tripulantes (PPT), de importância fundamental no planejamento operacional das empresas aéreas. O PPT é normalmente dividido na literatura em dois subproblemas, formulados e resolvidos sequencialmente: Problema de Determinação das Viagens (PDV) e Problema de Atribuição de Escalas (PAE). Esta decomposição justifica-se pela sua natureza combinatória, porém deixa de proporcionar um tratamento global ao PPT, em termos de custo e qualidade da solução final. Portanto, o estado da arte envolve a solução integrada do PPT. O problema, no entanto, é NP-Difícil. Esta pesquisa apresenta uma metodologia para modelagem integrada do PPT através de um Algoritmo Genético Híbrido (AGH) associado a um procedimento de busca em profundidade e a um modelo de programação linear inteira, levando em conta as particularidades da legislação brasileira. A metodologia foi testada, com sucesso, para a solução de instâncias baseadas na malha real de uma empresa aérea brasileira.Palavras-chave: transporte aéreo; programação de tripulantes; meta-heurística; algoritmo genético híbrido.Abstract: This paper treats the Crew Scheduling Problem (CSP), important part of the airlines operational planning. The CSP is usually divided in the literature into two subproblems, formulated and solved sequentially: Crew Pairing Problem (CPP) and Crew Rostering Problem (CRP). This decomposition is justified by its combinatorial nature, but it does not provide a global treatment to the CSP, in terms of cost and quality of final solution. Therefore, the state of the art involves the integrated solution of CSP. The problem, however, is NP-Hard. This research presents a methodology for an integrated modeling of the CSP through a Hybrid Genetic Algorithm (HGA) associated with a depth-first search procedure and an integer linear programming model, taking into account the Brazilian crew legislation. The methodology was tested, with success, to solve instances related to the network of a Brazilian airline.

show abstract

Section: O Problema Na Literaturaunclassified

See 1 more Smart Citation

Modelagem Integrada do Problema de Programação de Tripulantes de Aeronaves

Gomes

2011

TRANSPORTES

View full text Add to dashboard Cite

show abstract

“…First, one solves the problem in just one phase (Crew pairing and crew rostering together) like in references [1] and [2]. However, the requirement of high calculation capabilities and an overlarge search space, reduces the probability of generating a feasible solution using an optimization algorithm.…”

Section: Introductionmentioning

confidence: 99%

An Improved Genetic Algorithm for Crew Pairing Optimization

Zeren¹,

Özkol²

2012

JILSA

View full text Add to dashboard Cite

Crew pairing is a sequence of flights beginning and ending at the same crewbase. Crew pairing planning is one of the primary processes in airline crew scheduling; it is also the primary cost-determining phase in airline crew scheduling. Optimizing crew pairings in an airline timetable helps minimize operational crew costs and maximize crew utilization. There are numerous restrictions that must be considered and just as many regulations that must be satisfied in crew pairing generation. The most important regulations-and the ones that make crew pairing planning a highly constrained optimization problem-are the the limits of the flight and the duty periods. Keeping these restrictions and regulations in mind, the main goal of the optimization is the generation of low cost sets of valid crew pairings which cover all flights in the airline's timetable. For this research study, We examined studies about crew pairing optimization and used these previously existing methods of crew pairing to develop a new solution of the crew pairing problem using genetic algorithms. As part of the study we created a new genetic operator-called perturbation operator. Unlike traditional genetic algorithm implementations, this new perturbation operator provides much more stable results, an obvious increase in the convergence rate, and takes into account the existence of multiple crewbases.

show abstract

“…Approaches for an integrated solution of the CAP are still at an early stage of development in the literature. Zeghal and Minoux (2006), Souai andTeghem (2009), andGomes andGualda (2010) proposed integrated strategies in which the rosters of the crew members are formed from grouping the duty periods (instead of the pairings) with other activities, such Wagner de Paula Gomes, Nicolau Dionísio Fares Gualda (2015). Journal of Transport Literature, 9(1), 25-29, Jan.…”

mentioning

confidence: 99%

Heuristics to solve the integrated airline crew assignment problem

Gomes

Gualda

2015

J. Transp. Lit.

View full text Add to dashboard Cite

Article Info AbstractKeywords: air transportation airline crew assignment combinatorial optimization heuristics A typical problem related to airline crew management consists of optimally assigning the required crew members to planned flights for a given period of time, while complying with a variety of labor regulations, safety rules and policies of the airline. This problem, called crew assignment problem (CAP), is of the NPHard class. So, it is usually divided into two independent subproblems, crew pairing problem (CPP) and crew rostering problem (CRP), modeled and solved sequentially. This division does not provide a global treatment to the CAP in terms of total cost and quality of the final solution. IntroductionThis paper presents the main results of a research addressed to solve the crew assignment problem (CAP) with a proposed heuristic procedure. The importance of this type of approach is given by the combinatorial nature of the problem, which turns it impossible to be solved through exact models for large instances. The proposed heuristics presented results equal to or better than those obtained by exact models for the tested instances related to small and medium-sized Brazilian airlines (up to 894 flights and 36 crew members), with reduced CPU times (less than 5 seconds). Exact models led to feasible solutions in instances with up to 656 flights and 20 crew members.The CAP treated in this paper is defined as the problem of assigning the required crew members of the same category (only technical crew, in this case) to a set of flights of a given aircraft type, such that it minimizes the total cost of the aircrew, taking into consideration the proper legislation and the satisfaction of the crew members.CAP has been decomposed in the literature into two subproblems, both of which are solved sequentially: crew pairing problem (CPP) and crew rostering problem (CRP). The CPP seeks to provide an optimal set of pairings that covers all the planned flights. Then, in the CRP, the best combination of rosters (composed by the pairings of CPP and other activities) to crew members is determined, seeking the optimal coverage of planned flights and, eventually, the balancing of the total flying time among the crew members (Andersson et al., 1998;Barnhart et al., 2003; Kohl and Karisch, 2004;Gopalakrishnan and Johnson, 2005).Pairing (or crew rotation) is the work accomplished by crew member starting and ending at the same home base, featuring a cycle. A pairing can be formed by one or more duty periods, which are series of sequential flights comprising a workday for a crew member.Subproblems CPP and CRP are usually modelled as a set partitioning (or covering) problem, and solved through approaches based on heuristics or metaheuristics. The exact methods are only used for small-sized problems (Andersson et al., 1998;Barnhart et al., 2003;Cabral et al., 2000;Kohn and Karisch, 2004;Gopalakrishnan and Johnson, 2005;Lucic and Teodorovic, 2007;Maenhout and Vanhoucke, 2010).This decomposition does not incorporate all the cre...

show abstract

Modeling and solving a Crew Assignment Problem in air transportation

Cited by 46 publications

References 10 publications

Modelagem Integrada do Problema de Programação de Tripulantes de Aeronaves

Modelagem Integrada do Problema de Programação de Tripulantes de Aeronaves

An Improved Genetic Algorithm for Crew Pairing Optimization

Heuristics to solve the integrated airline crew assignment problem

Contact Info

Product

Resources

About