A genetic algorithm considering earth curvature to plan a flight route of minimal distance

Suter, Lukas DavidMeyer, DominikHanne, ThomasDornberger, Rolf2025-03-072023979-8-3503-5937-4979-8-3503-5938-110.1109/ISCMI59957.2023.10458489https://irf.fhnw.ch/handle/11654/48254The traveling salesman problem (TSP) is a common combinatorial optimization problem, often solved by nature-inspired algorithms. In this paper, a genetic algorithm (GA) is used to solve a particular TSP for planning a flight roundtrip with the shortest total distance between different airports, while taking into account the curvature of the earth. Test runs are conducted to assess the feasibility of the algorithm and to determine suitable parameter values.en330 - WirtschaftA genetic algorithm considering earth curvature to plan a flight route of minimal distance04B - Beitrag Konferenzschrift59-64