Hybrid self-organizing map approach for traveling salesman problem
© 2014 Chiang Mai University. As efficient planning and design of transportation route can reduce transportation cost of an organization, the development of an effective algorithm for solving this problem can be used as a guideline for developing the route and transportation cost. Currently, several...
Saved in:
Main Authors: | , |
---|---|
Format: | Journal |
Published: |
2019
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85065135833&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65919 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
id |
th-cmuir.6653943832-65919 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-659192019-08-05T04:44:30Z Hybrid self-organizing map approach for traveling salesman problem Pongpinyo Tinarut Komgrit Leksakul Multidisciplinary © 2014 Chiang Mai University. As efficient planning and design of transportation route can reduce transportation cost of an organization, the development of an effective algorithm for solving this problem can be used as a guideline for developing the route and transportation cost. Currently, several studies focus on the study and development of the Traveling Salesman Problem (TSP), which is largely similar to transportation route. One of the algorithms that helps solve this type of problem quickly is the Self-Organizing Map (SOM), which is adapted from the Artificial Neural Networks algorithm. However, using SOM to solve TSP problem does not provide the shortest path, nor is it the optimal solution. Therefore, this study aims to develop the solution based on SOM together with Local Search algorithm to provide better quality solution. The results of this research, both in terms of processing time and quality of solution, were compared to the results of previous research. The findings indicated that the solution from the proposed algorithm improved the processing time when compared to every problem in previous research. 2019-08-05T04:44:30Z 2019-08-05T04:44:30Z 2019-01-01 Journal 16851994 2-s2.0-85065135833 10.12982/CMUJNS.2019.0003 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85065135833&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65919 |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
topic |
Multidisciplinary |
spellingShingle |
Multidisciplinary Pongpinyo Tinarut Komgrit Leksakul Hybrid self-organizing map approach for traveling salesman problem |
description |
© 2014 Chiang Mai University. As efficient planning and design of transportation route can reduce transportation cost of an organization, the development of an effective algorithm for solving this problem can be used as a guideline for developing the route and transportation cost. Currently, several studies focus on the study and development of the Traveling Salesman Problem (TSP), which is largely similar to transportation route. One of the algorithms that helps solve this type of problem quickly is the Self-Organizing Map (SOM), which is adapted from the Artificial Neural Networks algorithm. However, using SOM to solve TSP problem does not provide the shortest path, nor is it the optimal solution. Therefore, this study aims to develop the solution based on SOM together with Local Search algorithm to provide better quality solution. The results of this research, both in terms of processing time and quality of solution, were compared to the results of previous research. The findings indicated that the solution from the proposed algorithm improved the processing time when compared to every problem in previous research. |
format |
Journal |
author |
Pongpinyo Tinarut Komgrit Leksakul |
author_facet |
Pongpinyo Tinarut Komgrit Leksakul |
author_sort |
Pongpinyo Tinarut |
title |
Hybrid self-organizing map approach for traveling salesman problem |
title_short |
Hybrid self-organizing map approach for traveling salesman problem |
title_full |
Hybrid self-organizing map approach for traveling salesman problem |
title_fullStr |
Hybrid self-organizing map approach for traveling salesman problem |
title_full_unstemmed |
Hybrid self-organizing map approach for traveling salesman problem |
title_sort |
hybrid self-organizing map approach for traveling salesman problem |
publishDate |
2019 |
url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85065135833&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65919 |
_version_ |
1681426358575562752 |