Jubeir, Mohammed and Almazrooie, Mishal and Abdullah, Rosni (2017) Enhanced selection method for genetic algorithm to solve traveling salesman problem. In: 6th International Conference on Computing & Informatics (ICOCI2017), 25 - 27 April 2017, Kuala Lumpur.

PDF Restricted to Registered users only Download (788kB)

Abstract

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. Stochastic Universal Selection (SUS) is one of the selection methods in GA which is considered fast but it leads to lower quality solution.Although using Rank Method Selection (RMS) may lead to high quality solution, it has long runtime.In this work, an enhanced selection method is presented which maintains both fast runtime and high solution quality.First, we present a framework to solve TSP using GA with the original selection method SUS. Then, the SUS is replaced by the proposed enhanced selection method.The experimental results show that a better quality solution was obtained by using the proposed enhanced selection method compared to the original SUS.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	EISSN 2289-7402 E-ISBN 978-967-0910-33-8 Organized by: School of Computing, Universiti Utara Malaysia
Uncontrolled Keywords:	TSP, Genetic Algorithm, GA, Evolutionary algorithms, Selection Methods
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Computing
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	26 Jul 2017 07:41
Last Modified:	26 Jul 2017 07:41
URI:	https://repo.uum.edu.my/id/eprint/22800

Actions (login required)

View Item