Pith. sign in

REVIEW

Tactical fleet assignment and crew pairing problem with crew flight time allocation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.13904 v1 pith:7XLDBODO submitted 2022-09-28 math.OC

classification math.OC
keywords crewaircraftproblemresourcesairlinesallocationadditionassignment
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Aircraft and crew are two major resources that ensure the smooth operations of airlines. However, with the anticipated growth in the aviation industry, the crew resource is predicted to be insufficient worldwide and has been one of the bottlenecks in fast-developing airlines. In addition, the mismatch between aircraft and crew has influenced the airlines' operation, and limited the full usage of all resources. To resolve this problem, we propose a tactical fleet assignment and crew pairing problem with crew flight time allocation (TFACPP). The basic integrated model is reformulated by the Benders decomposition, where the Benders master problem (BMP) poses the most significant computational barrier. To efficiently solve the BMP, we propose a column generation algorithm. The TFACPP can provide superior solutions compared to the equal allocation of crew resources. In addition, we provide a quantitative method for evaluating the scarcities of crew and aircraft resources and the matching degree between crew and aircraft based on the shadow prices of the proposed model. These information can provide rich managerial insights regarding the acquisition, replacement, and transition of crew and aircraft.

Discussion (0). Continue with ORCID to comment.

Pith tools