A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
<p style="font: 13.33px/20px Tahoma, Geneva, sans-serif; text-align: left; color: #515151; text-transform: none; text-indent: 0px; letter-spacing: normal; word-spacing: 0px; white-space: normal; widows: 1; font-size-adjust: none; font-stretch: normal; background-color: #eceaeb; -webkit-text-...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Pamukkale University
2016-02-01
|
| Series: | Pamukkale University Journal of Engineering Sciences |
| Online Access: | http://dergipark.ulakbim.gov.tr/pajes/article/view/5000180424 |
| _version_ | 1797909651365298176 |
|---|---|
| author | Tevfik YILDIRIM Can Berk KALAYCI Özcan MUTLU |
| author_facet | Tevfik YILDIRIM Can Berk KALAYCI Özcan MUTLU |
| author_sort | Tevfik YILDIRIM |
| collection | DOAJ |
| description | <p style="font: 13.33px/20px Tahoma, Geneva, sans-serif; text-align: left; color: #515151; text-transform: none; text-indent: 0px; letter-spacing: normal; word-spacing: 0px; white-space: normal; widows: 1; font-size-adjust: none; font-stretch: normal; background-color: #eceaeb; -webkit-text-stroke-width: 0px;">Traveling Salesman Problem (TSP) is the problem of finding a minimum distance tour of cities beginning and ending at the same city and that each city are visited only once. As the number of cities increases, it is difficult to find an optimal solution by exact methods in a reasonable duration. Therefore, in recent five decades many heuristic solution methods inspired of nature and biology have been developed. In this paper, a new metaheuristic method inspired of the by-passing the obstacle strategy of blind mole rats living in their individual tunnel systems under the soil is designed for solving TSP. The method is called as Blind Mole-rat Algorithm. The proposed algorithm is tested on different size of symmetric TSP problems and the results are compared to the best known results. Initial test results are promising although proposed metaheuristic is not yet competitive enough among other algorithms in the literature.</p><strong style="text-align: left; color: #515151; text-transform: none; line-height: 20px; text-indent: 0px; letter-spacing: normal; font-family: Tahoma, Geneva, sans-serif; font-size: 13.33px; font-style: normal; font-variant: normal; word-spacing: 0px; white-space: normal; widows: 1; background-color: #eceaeb; -webkit-text-stroke-width: 0px;">Keywords:</strong><span style="font: 13.33px/20px Tahoma, Geneva, sans-serif; text-align: left; color: #515151; text-transform: none; text-indent: 0px; letter-spacing: normal; word-spacing: 0px; float: none; display: inline !important; white-space: normal; widows: 1; font-size-adjust: none; font-stretch: normal; background-color: #eceaeb; -webkit-text-stroke-width: 0px;"> Traveling salesman problem, Combinatorial optimization, Metaheuristic, Blind mole-Rat algorithm</span> |
| first_indexed | 2024-04-10T11:11:42Z |
| format | Article |
| id | doaj.art-d603cf54343f4919b0ef30c141cd1ee5 |
| institution | Directory Open Access Journal |
| issn | 1300-7009 2147-5881 |
| language | English |
| last_indexed | 2024-04-10T11:11:42Z |
| publishDate | 2016-02-01 |
| publisher | Pamukkale University |
| record_format | Article |
| series | Pamukkale University Journal of Engineering Sciences |
| spelling | doaj.art-d603cf54343f4919b0ef30c141cd1ee52023-02-15T16:19:02ZengPamukkale UniversityPamukkale University Journal of Engineering Sciences1300-70092147-58812016-02-0122164705000157553A novel metaheuristic for traveling salesman problem: blind mole-rat algorithmTevfik YILDIRIMCan Berk KALAYCIÖzcan MUTLU<p style="font: 13.33px/20px Tahoma, Geneva, sans-serif; text-align: left; color: #515151; text-transform: none; text-indent: 0px; letter-spacing: normal; word-spacing: 0px; white-space: normal; widows: 1; font-size-adjust: none; font-stretch: normal; background-color: #eceaeb; -webkit-text-stroke-width: 0px;">Traveling Salesman Problem (TSP) is the problem of finding a minimum distance tour of cities beginning and ending at the same city and that each city are visited only once. As the number of cities increases, it is difficult to find an optimal solution by exact methods in a reasonable duration. Therefore, in recent five decades many heuristic solution methods inspired of nature and biology have been developed. In this paper, a new metaheuristic method inspired of the by-passing the obstacle strategy of blind mole rats living in their individual tunnel systems under the soil is designed for solving TSP. The method is called as Blind Mole-rat Algorithm. The proposed algorithm is tested on different size of symmetric TSP problems and the results are compared to the best known results. Initial test results are promising although proposed metaheuristic is not yet competitive enough among other algorithms in the literature.</p><strong style="text-align: left; color: #515151; text-transform: none; line-height: 20px; text-indent: 0px; letter-spacing: normal; font-family: Tahoma, Geneva, sans-serif; font-size: 13.33px; font-style: normal; font-variant: normal; word-spacing: 0px; white-space: normal; widows: 1; background-color: #eceaeb; -webkit-text-stroke-width: 0px;">Keywords:</strong><span style="font: 13.33px/20px Tahoma, Geneva, sans-serif; text-align: left; color: #515151; text-transform: none; text-indent: 0px; letter-spacing: normal; word-spacing: 0px; float: none; display: inline !important; white-space: normal; widows: 1; font-size-adjust: none; font-stretch: normal; background-color: #eceaeb; -webkit-text-stroke-width: 0px;"> Traveling salesman problem, Combinatorial optimization, Metaheuristic, Blind mole-Rat algorithm</span>http://dergipark.ulakbim.gov.tr/pajes/article/view/5000180424 |
| spellingShingle | Tevfik YILDIRIM Can Berk KALAYCI Özcan MUTLU A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm Pamukkale University Journal of Engineering Sciences |
| title | A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm |
| title_full | A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm |
| title_fullStr | A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm |
| title_full_unstemmed | A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm |
| title_short | A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm |
| title_sort | novel metaheuristic for traveling salesman problem blind mole rat algorithm |
| url | http://dergipark.ulakbim.gov.tr/pajes/article/view/5000180424 |
| work_keys_str_mv | AT tevfikyildirim anovelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT canberkkalayci anovelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT ozcanmutlu anovelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT tevfikyildirim novelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT canberkkalayci novelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT ozcanmutlu novelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm |