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: | , , |
|---|---|
| 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 |
| _version_ | 1803628434576900096 |
|---|---|
| author | Jubeir, Mohammed Almazrooie, Mishal Abdullah, Rosni |
| author_facet | Jubeir, Mohammed Almazrooie, Mishal Abdullah, Rosni |
| author_sort | Jubeir, Mohammed |
| collection | UUM |
| description | 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. |
| first_indexed | 2024-07-04T06:21:54Z |
| format | Conference or Workshop Item |
| id | uum-22800 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:21:54Z |
| publishDate | 2017 |
| record_format | dspace |
| spelling | uum-228002017-07-26T07:41:19Z https://repo.uum.edu.my/id/eprint/22800/ Enhanced selection method for genetic algorithm to solve traveling salesman problem Jubeir, Mohammed Almazrooie, Mishal Abdullah, Rosni QA75 Electronic computers. Computer science 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. 2017-04-25 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/22800/1/ICOCI%202017%2069-76.pdf 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. http://icoci.cms.net.my/PROCEEDINGS/2017/Pdf_Version_Chap02e/PID35-69-76e.pdf |
| spellingShingle | QA75 Electronic computers. Computer science Jubeir, Mohammed Almazrooie, Mishal Abdullah, Rosni Enhanced selection method for genetic algorithm to solve traveling salesman problem |
| title | Enhanced selection method for genetic algorithm to solve traveling salesman problem |
| title_full | Enhanced selection method for genetic algorithm to solve traveling salesman problem |
| title_fullStr | Enhanced selection method for genetic algorithm to solve traveling salesman problem |
| title_full_unstemmed | Enhanced selection method for genetic algorithm to solve traveling salesman problem |
| title_short | Enhanced selection method for genetic algorithm to solve traveling salesman problem |
| title_sort | enhanced selection method for genetic algorithm to solve traveling salesman problem |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/22800/1/ICOCI%202017%2069-76.pdf |
| work_keys_str_mv | AT jubeirmohammed enhancedselectionmethodforgeneticalgorithmtosolvetravelingsalesmanproblem AT almazrooiemishal enhancedselectionmethodforgeneticalgorithmtosolvetravelingsalesmanproblem AT abdullahrosni enhancedselectionmethodforgeneticalgorithmtosolvetravelingsalesmanproblem |