In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems.
Apr 14, 2016 · In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems.
Oct 22, 2024 · In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems.
In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems. In addition, we ...
In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we ...
Using extensive evaluations based on TSP benchmark instances taken from TSPLIB, the results show that IHDBA outperforms state-of-the-art discrete bat ...
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems. https://doi.org/10.1016/j.engappai.2015.10.006 · Full text.
People also ask
What is the best algorithm for the Traveling salesman problem?
Which algorithm technique is most suitable to implement to solve travelling salesman problem?
What are the advantages of the bat algorithm?
What is the multi objective bat algorithm?
In this study, we have proposed a novel adaptation of BA for solving travelling salesman problem (TSP), which is known as an NP-hard combinatorial optimization ...
Therefore, this paper introduces an unordered pair and proposes an unordered pair bat algorithm (UPBA) to make it more suitable for solving symmetric discrete ...
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems ... Eng. Appl. Artif. Intell. 2016. 293 Citations.