An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems

Abstract

Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. 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 propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student's $t$-test, the Holm's test, and the Friedman test. We have also compared the convergence behaviour shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases.

1 figure, 8 tables

References in corpus (3)

• Bat Algorithm: A Novel Approach for Global Engineering Optimization
• A comprehensive review of firefly algorithms
• Bat Algorithm: Literature Review and Applications

Cited by in corpus (11)

• Nature-Inspired Optimization Algorithms: Challenges and Open Problems
• Swarm Intelligence: Past, Present and Future
• The Global Convergence Analysis of the Bat Algorithm Using a Markovian Framework and Dynamical System Theory
• Critical Analysis: Bat Algorithm based Investigation and Application on Several Domains
• Neighborhood Information-based Probabilistic Algorithm for Network Disintegration
• Robot Path Planning by Traveling Salesman Problem with Circle Neighborhood: modeling, algorithm, and applications
• Focusing on the Hybrid Quantum Computing -- Tabu Search Algorithm: new results on the Asymmetric Salesman Problem
• A Generalized Evolutionary Metaheuristic (GEM) Algorithm for Engineering Optimization
• COEBA: A Coevolutionary Bat Algorithm for Discrete Evolutionary Multitasking
• Nature-Inspired Algorithms in Optimization: Introduction, Hybridization and Insights
• Analysis of Parameter Settings for the Bat Algorithm Using Variance Evolution