Discrete bat-inspired algorithm for travelling salesman problem

Bat algorithm (BA) is a new nature-inspired metaheuristic optimization algorithm based on the echolocation behavior of bats to find their prey and to avoid obstacles in the darkness. This new algorithm has showed a higher efficiency in solving continuous optimization problems. 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 problem. We have also redefined some operators used in basic BA. Implementation is carried out in MATLAB on examples of symmetric instance. The results are optimistic and clearly demonstrate the efficiency of the proposed algorithm in terms of convergence towards optimal solution.