A genetic algorithm considering earth curvature to plan a flight route of minimal distance
No Thumbnail Available
Author (Corporation)
Publication date
2023
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editors
Editor (Corporation)
Supervisor
Parent work
2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI)
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
59-64
Patent number
Publisher / Publishing institution
IEEE
Place of publication / Event location
Mexico City
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
The 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.
Keywords
Subject (DDC)
330 - Wirtschaft
Event
Soft Computing & Machine Intelligence (ISCMI)
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
979-8-3503-5937-4
979-8-3503-5938-1
979-8-3503-5938-1
ISSN
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Published
Review
Peer review of the complete publication
Open access category
Closed
License
Citation
SUTER, Lukas David, Dominik MEYER, Thomas HANNE und Rolf DORNBERGER, 2023. A genetic algorithm considering earth curvature to plan a flight route of minimal distance. In: 2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI). Mexico City: IEEE. 2023. S. 59–64. ISBN 979-8-3503-5937-4. Verfügbar unter: https://irf.fhnw.ch/handle/11654/48254