| Autor: |
Trust Tawanda, Philimon Nyamugure, Santosh Kumar, Elias Munapo |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Applied Sciences, Vol 13, Iss 11, p 6417 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2076-3417 |
| DOI: |
10.3390/app13116417 |
| Popis: |
The travelling salesman problem (TSP) is a problem whereby a finite number of nodes are supposed to be visited exactly once, one after the other, in such a way that the total weight of connecting arcs used to visit these nodes is minimized. We propose a labelling method to solve the TSP problem. The algorithm terminates after K−1 iterations, where K is the total number of nodes in the network. The algorithm’s design allows it to determine alternative tours if there are any in the TSP network. The computational complexity of the algorithm reduces as iterations increase, thereby making it a powerful and efficient algorithm. Numerical illustrations are used to prove the efficiency and validity of the proposed algorithm. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
