A comparison of linear rank and tournament for parent selection in a genetic algorithm solving a dynamic travelling salesman problem
Loading...
Author (Corporation)
Publication date
2022
Typ of student thesis
Course of study
Collections
Type
04B - Conference paper
Editors
Editor (Corporation)
Supervisor
Parent work
2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)
Special issue
DOI of the original publication
Link
Series
Series number
Volume
Issue / Number
Pages / Duration
97-102
Patent number
Publisher / Publishing institution
IEEE
Place of publication / Event location
Toronto
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
We compare the two parent selection methods “linear rank” and “tournament” in a Genetic Algorithm applied to a dynamic Travelling Salesman Problem (TSP). The inherent dynamics of the problem is considered by temporarily doubling the costs between two randomly selected cities. In our experiments we take into account tournament selection with tournament sizes of 3, 5, and 10. A larger tournament size results in as good a performance as with linear rank selection in a small-scale dynamic TSP, whereas smaller tournament sizes better preserve the diversity of the population and avoid getting stuck in local optima. However, the assumption that tournament is superior to linear rank on a dynamic TSP could neither be confirmed nor falsified in the applied testcases.
Keywords
Subject (DDC)
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-2088-6
979-8-3503-2087-9
979-8-3503-2087-9
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
Boeh, R., Hanne, T., & Dornberger, R. (2022). A comparison of linear rank and tournament for parent selection in a genetic algorithm solving a dynamic travelling salesman problem. 2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI), 97–102. https://doi.org/10.1109/ISCMI56532.2022.10068458