An integrated column generation solution framework for optimal aircrew vacation planning subject to seniority ranking and priority preference satisfaction

• We consider the vacation planning problem in the context of commercial aviation. • We develop an integrated solution framework for this problem, which consists of two independent phases executed sequentially. • The first one, termed bid award phase , deals exclusively with the crew requests, aiming to satisfy them to the maximum possible extent. • The second one, termed automatic allocation phase , aims to allocate complementary vacation periods for maximizing the collective group vacation assignment. • We report computational results on realistic problem instances with variable characteristics, which demonstrate the behavior of the proposed solution methodology, assess its computational performance, and highlight its effectiveness. We consider the vacation planning problem in the context of commercial aviation, which aims to devise optimal vacation periods for a group of crew members, while also ensuring that the efficient operation of the airline remains intact. The problem definition includes two objectives treated lexicographically, the maximization of crew satisfaction with respect to specific vacation preferences (bids) they have expressed in advance, and the minimization of the collective vacation entitlement that remains unassigned. We develop an integrated solution framework for this problem, which consists of two independent phases executed sequentially. The first one ( bid award phase ) focuses exclusively on crew satisfaction, exploiting an innovative optimization model that examines the approval of each bid individually, according to the distribution logic in effect. Each grant/reject decision is made based on whether bid acceptance retains the feasibility of this model. The second one ( auto-allocation phase ) employs a column generation solution algorithm which assigns complementary vacation periods to the crew members for maximizing the total number of vacation days assigned combinedly to the group. We report computational results on realistic problem instances with variable characteristics, which demonstrate the behavior of the proposed solution methodology, assess its computational performance, and highlight its effectiveness. These results confirm that it succeeds in identifying robust solutions accommodating the highly variable user requirements of practical airline environments in satisfactory computational times.

Authors

Publication Details

Journal
Omega
Published
2025-03-28
DOI
https://doi.org/10.1016/j.omega.2025.103324
Citations
2
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An integrated column generation solution framework for optimal aircrew vacation planning subject to seniority ranking and priority preference satisfaction

George Kozanidis
2 citations
Omega
Vehicle Routing Optimization Methods
2.48
article

An integrated column generation solution framework for optimal aircrew vacation planning subject to seniority ranking and priority preference satisfaction

George Kozanidis
article en
2 citations

Abstract

• We consider the vacation planning problem in the context of commercial aviation. • We develop an integrated solution framework for this problem, which consists of two independent phases executed sequentially. • The first one, termed bid award phase , deals exclusively with the crew requests, aiming to satisfy them to the maximum possible extent. • The second one, termed automatic allocation phase , aims to allocate complementary vacation periods for maximizing the collective group vacation assignment. • We report computational results on realistic problem instances with variable characteristics, which demonstrate the behavior of the proposed solution methodology, assess its computational performance, and highlight its effectiveness. We consider the vacation planning problem in the context of commercial aviation, which aims to devise optimal vacation periods for a group of crew members, while also ensuring that the efficient operation of the airline remains intact. The problem definition includes two objectives treated lexicographically, the maximization of crew satisfaction with respect to specific vacation preferences (bids) they have expressed in advance, and the minimization of the collective vacation entitlement that remains unassigned. We develop an integrated solution framework for this problem, which consists of two independent phases executed sequentially. The first one ( bid award phase ) focuses exclusively on crew satisfaction, exploiting an innovative optimization model that examines the approval of each bid individually, according to the distribution logic in effect. Each grant/reject decision is made based on whether bid acceptance retains the feasibility of this model. The second one ( auto-allocation phase ) employs a column generation solution algorithm which assigns complementary vacation periods to the crew members for maximizing the total number of vacation days assigned combinedly to the group. We report computational results on realistic problem instances with variable characteristics, which demonstrate the behavior of the proposed solution methodology, assess its computational performance, and highlight its effectiveness. These results confirm that it succeeds in identifying robust solutions accommodating the highly variable user requirements of practical airline environments in satisfactory computational times.

OmegaVol. 135
Climate action
Openalex Percentile: Top 11%
Vehicle Routing Optimization Methods
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.