Optimize a Thru Flight Inspection of a Fighting Falcon using Routing Algorithms

摘要

In this study we introduced a methodology for using routing algorithms in the context of inspection procedures for FXX military aircraft. The objective function of the model minimizes the inspection time thus improving the operational readiness of aircraft. We applied three different algorithms for two types of inspections. In all cases we achieved lower inspection times. Also we tried two different versions of the problem by varying the number of inspectors. In these cases, the improvement of the inspection time was larger. By employing more than one inspector it is possible to reduce the total inspection time as shown by the data. This is true because some of the inspection tasks can be executed concurrently. There is a hard limit to this improvement. Let Actual Completion Time for each task be the sum of the minimum required waiting time for the task plus the time it takes to execute it. By increasing the number of inspectors used, the total inspection time converge to the longest Actual Completion Time.