Enhanced selection method for genetic algorithm to solve traveling salesman problem
Genetic algorithms (GAs) have been applied by many researchers to get an optimized solution for hard problems such as Traveling Salesman Problem (TSP). The selection method in GA plays a significant role in the runtime to get the optimized solution as well as in the quality of the solution. Stochas...
Main Authors: | Jubeir, Mohammed, Almazrooie, Mishal, Abdullah, Rosni |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/22800/1/ICOCI%202017%2069-76.pdf |
Similar Items
-
A GPU accelerated parallel genetic algorithm for the traveling salesman problem
by: Binjubier, Mohammed, et al.
Published: (2024) -
The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem
by: Pook, Mei Foong, et al.
Published: (2019) -
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
by: Lim, Yai Fung, et al.
Published: (2011) -
Simulated annealing with probabilistic analysis for solving traveling salesman problems
by: Hong, Pei Yee, et al.
Published: (2013) -
Tutorials on African Buffalo Optimization for Solving the Travelling Salesman Problem
by: Odili, Julius Beneoluchi, et al.
Published: (2017)