2021
DOI: 10.14569/ijacsa.2021.0120855
|View full text |Cite
|
Sign up to set email alerts
|

Experimental Study of Hybrid Genetic Algorithms for the Maximum Scatter Travelling Salesman Problem

Abstract: We consider the maximum scatter travelling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the shortest edge in the tour that travels each city only once in the given network. It is a very complicated NP-hard problem, and hence, exact solutions are obtainable for small sizes only. For large sizes, heuristic algorithms must be applied, and genetic algorithms (GAs) are observed to be very successful in dealing with such problems. In our study, a simple GA (SGA)… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 23 publications
(54 reference statements)
0
1
0
Order By: Relevance
“…Several selection procedures are present in the literature. We implement the fitness proportional selection (FPS) [25] for our GAs, which is very popular operator where the fitness value of every chromosome in a population relates the area of roulette-wheel portions. en, a chromosome is pointed by the roulette-wheel pointer after it is rotated.…”
Section: Fitness Function and Selection Operatormentioning
confidence: 99%
“…Several selection procedures are present in the literature. We implement the fitness proportional selection (FPS) [25] for our GAs, which is very popular operator where the fitness value of every chromosome in a population relates the area of roulette-wheel portions. en, a chromosome is pointed by the roulette-wheel pointer after it is rotated.…”
Section: Fitness Function and Selection Operatormentioning
confidence: 99%