[3L5-GS-1] Fundamental AI, theory, algorithm:

[3L5-GS-1-04] Crew assignment problem considering the education and training of new pilots

〇Kotaro Mineyuki¹, Ikuha Nishitani¹, Tenda Okimoto¹, Hiroki Sakai¹, Jun Mizutani¹ (1. Kobe University)

Keywords:Airline crew scheduling, Crew assignment problem, Education and Training of new pilots

Airline Crew Scheduling Problem (ACSP) is a combinatorial optimization problem that creates a work schedule that satisfies given constraints for a set of crews, work days, and work contents. ACSP consists of two sub-problems, namely Crew Pairing Problem (CPP) and Crew Assignment Problem (CAP). The objective of the former problem is to generate feasible flight-crew pairings that covers all scheduled flights. The aim of the latter problem is actually assigning a crew to each generated pairing. In the aviation industry, the education and training of new pilots is essential to maintaining the provision of safe and secure flight services. In previous works on ACSP, there exists few works on considering the newcomer education. In this paper, the focus is laid on the Education and Training of new pilots in CAP. The crew assignment problem considering the newcomer education (CAP^ED) is defined. In the experiments, the CAP^ED is formalized as 0-1 integer programming problem by using the real flight data of JAL, and the optimal solution is provided.