A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm
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. There...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Pamukkale University
2016-02-01
|
| Series: | Pamukkale University Journal of Engineering Sciences |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/tr/pub/pajes/issue/20565/219171 |
| _version_ | 1797916703948013568 |
|---|---|
| author | Can Berk Kalaycı Özcan Mutlu Tevfik Yıldırım |
| author_facet | Can Berk Kalaycı Özcan Mutlu Tevfik Yıldırım |
| author_sort | Can Berk Kalaycı |
| collection | DOAJ |
| description | 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.Keywords: Traveling salesman problem, Combinatorial optimization, Metaheuristic, Blind mole-Rat algorithm |
| first_indexed | 2024-04-10T13:01:33Z |
| format | Article |
| id | doaj.art-4b5c960e60f2419e83aea56e3467d1ea |
| institution | Directory Open Access Journal |
| issn | 1300-7009 2147-5881 |
| language | English |
| last_indexed | 2024-04-10T13:01:33Z |
| publishDate | 2016-02-01 |
| publisher | Pamukkale University |
| record_format | Article |
| series | Pamukkale University Journal of Engineering Sciences |
| spelling | doaj.art-4b5c960e60f2419e83aea56e3467d1ea2023-02-15T16:13:07ZengPamukkale UniversityPamukkale University Journal of Engineering Sciences1300-70092147-58812016-02-012216470218A novel metaheuristic for traveling salesman problem: blind mole-rat algorithmCan Berk KalaycıÖzcan MutluTevfik YıldırımTraveling 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.Keywords: Traveling salesman problem, Combinatorial optimization, Metaheuristic, Blind mole-Rat algorithmhttps://dergipark.org.tr/tr/pub/pajes/issue/20565/219171-gezgin satıcı problemi kombinatoryel eniyileme meta-sezgisel kör fare algoritması |
| spellingShingle | Can Berk Kalaycı Özcan Mutlu Tevfik Yıldırım A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm Pamukkale University Journal of Engineering Sciences - gezgin satıcı problemi kombinatoryel eniyileme meta-sezgisel kör fare algoritması |
| 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 |
| topic | - gezgin satıcı problemi kombinatoryel eniyileme meta-sezgisel kör fare algoritması |
| url | https://dergipark.org.tr/tr/pub/pajes/issue/20565/219171 |
| work_keys_str_mv | AT canberkkalaycı anovelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT ozcanmutlu anovelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT tevfikyıldırım anovelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT canberkkalaycı novelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT ozcanmutlu novelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm AT tevfikyıldırım novelmetaheuristicfortravelingsalesmanproblemblindmoleratalgorithm |