Next Article in Journal
Technical Efficiency and Total Factor Productivity Growth in the Hazelnut Agricultural Sales Cooperatives Unions in Turkey
Previous Article in Journal
Entropy in Dichotic Listening EEEG Recordings
Article Menu

Article Versions

Export Article

Open AccessArticle
Math. Comput. Appl. 2011, 16(1), 53-65; doi:10.3390/mca16010053

Searching for the Shortest Path Through Group Processing for TSP

1
Epoka University, Computer Engineering Dept., Rruga Durres - Tirana, Albania
2
Mevlana University, Computer Engineering Dept, 42003 Selçuklu - Konya, Turkey
*
Authors to whom correspondence should be addressed.
Published: 1 April 2011
Download PDF [404 KB, uploaded 5 April 2016]

Abstract

Thanks to its complexity, Traveling Salesman Problem (TSP) has been one of the most intensively studied problems in computational mathematics. Although many solutions have been offered so far, all of them have yielded some disadvantages and none has been able to claim for the best solution. We believe that better solution could be obtained through iterative evaluations, until a certain number of islands are reached, if we could develop an algorithm which grows geometrically. Some algorithms have suggested random solutions and many suggested using the closest neighbors. In many cases islands exist in groups or chains in any length. Therefore they can be connected to any other island rather than the closest one. This can be better identified when we spot out the patterns and island chains. In this paper, we have searched for the identification of patterns and chains. We propose an iterative Group Processing (GP) approach which finds better paths in the 90% of the cases overall as we compare it to Random Logic (RL) programs and most up-to-date Artificial Neural Network based TSP programs.
Keywords: Group Processing; Traveling Salesman Problem Group Processing; Traveling Salesman Problem
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Meşecan, İ.; Bucak, İ.Ö.; Asilkan, Ö. Searching for the Shortest Path Through Group Processing for TSP. Math. Comput. Appl. 2011, 16, 53-65.

Show more citation formats Show less citations formats

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top