A Linear Programming Model for Optimal Check Airmen Allocation to Minimize Travel Costs

Abstract

Across the globe, civil aviation authorities (CAA) require pilots to be examined upon completion of their flight training and at regular intervals to uphold their pilot’s license. These flight examinations, or checkrides, are conducted by designated flight examiners and CAA pilots. While government employees are dispatched to different locations to conduct such exams, designated check airmen may only conduct checkrides that have limited coverage in the geographic area in which those exams are allowed. Thus, if the demand for checkrides at a given location is higher than the number of available designated flight examiners, those employed by the CAA may have to travel to satisfy the need for checkrides, incurring additional costs to these organizations. This paper aims at developing an optimization model using linear programming to find the optimal number of checkrides at different locations that minimizes the total travel cost of government check airmen (GCA) conducting checkrides, considering specific travel costs between locations. Based on a realistic set of initialization parameters, the optimal solution showed a minimal travel cost of $35,827.30 for six months. This model could be applied to other areas that may face a similar decision-making process.