Based On Optimal Search Algorithm Automatic Route Generation

FlighT Planning, which is an important task of every airline, is the premise of organizingand effecting aviation. The Manual Flight Planning that is limited by the experience andknowledge of the decision-maker is the bottle-neck of the quick reaction to emergencysituation. The problem is divided into several factors, each of which is endued with aweight, using Analytic Hierarchy Process in this paper.Automatic Flight Planning is an application of Multiple Criteria Decision Making. Peopletend to solve the problem of decision making using Analytic Hierarchy Process (AHP). Inthis paper, with the attributes of the Automatic Flight Planning being analyzed and withAHP and the Shortest Path Problem (SP) being discussed, a fast, practical engineeringalgorithm is explored. Mapping the Automatic Flight Planning to the Shortest PathProblem using DIJKSTRA Algorithm is the emphasis of this text, which can find theshortest or the least cost flight course. In the process of searching for the least cost flightcourse, the key problem is the determination of the cost of every segment of the path. Oneof the available approaches is to analyze every component that has influences on flightplanning by AHP. With weights being evaluated, the cost of every segment is thesummation of the cost of every factor.Finally, a practical Automatic Flight Planning discussed above is created.