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...
Saved in:
Main Authors: | Jubeir, Mohammed, Almazrooie, Mishal, Abdullah, Rosni |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/22800/1/ICOCI%202017%2069-76.pdf http://repo.uum.edu.my/22800/ http://icoci.cms.net.my/PROCEEDINGS/2017/Pdf_Version_Chap02e/PID35-69-76e.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem
by: Pang, Li Sim
Published: (2010) -
Solving traveling salesman problem on cluster compute nodes
by: I.A., Aziz, et al.
Published: (2009) -
Genetic algorithm software for solving the travelling salesman problem
by: Sekharan, Vijayan Sandiara
Published: (1996) -
The Anglerfish algorithm: a derivation of randomized incremental construction technique for solving the traveling salesman problem
by: Pook, Mei Foong, et al.
Published: (2019) -
Study on genetic algorithm and heuristic method for solving traveling salesman problem
by: Sze , San Nah
Published: (2004)