A new Hybrid Discrete Bat Algorithm for Traveling Salesman Problem using ordered crossover and 3-Opt operators for Bat's local search

Abstract

In this paper we propose a new Hybrid Bat Algo rithm to solve the traveling salesman problem (TSP) that has attracted many researchers applying exact and metaheuristic methods trying to solve it. The new proposed method is based on the basics of Bat Algorithm (BA) recently proposed as a new bio-inspired meta-heuristic algorithm. Accordingly, we use the concepts of Swap Operator (SO) and Swap Sequence (SS) to redefine respectively BA position and velocity operators for TSP.Additionally, based on ordered crossover and 3-0pt algorithm, we propose to redefine the Bat's local search method. We compare our algorithm to other state of the art methods from the literature by using benchmark datasets of symmetric TSP from TSPLIB library in order to test its effectiveness. Based on the recorded experiments our method outperforms most of the compared methods.

Comparison of a Bat and Genetic Algorithm Generated Sequence Against Lead Through Programming When Assembling a PCB Using a Six-Axis Robot With Multiple Motions and Speeds

“…They report that the presented improved BA outperforms significantly all the other alternatives in most of the cases. Similar findings were reported by Amara et al [27] who proposed as a new concept of Swap Operator and Swap Sequence to redefine respectively BA position and velocity operators for Traveling Salesman Problem. They have also redefined the local search procedure with genetic crossover operator and 3-opt search algorithm.…”

“…BA, in its original form, was proposed for solving mainly continuous optimization problems. And indeed, many experimental results reported by researchers [27][28][29][30] have demonstrated its superior performance and ability to compete with other metaheuristic optimisation algorithms. In industrial and production engineering, BA was implemented by Kaven & Zakian [28] who used it for size optimisation of skeletal structures consisting of trusses and frames.…”

“…}. This procedure was first presented by Wang et al [35], and Amara et al [27] has implemented similar concept in their version of hybrid discrete BA. The swap sequence is an array of swap operators , each including indexes of two nodes that when exchanged in the current solution, allow the response to get closer to the global best solution = ( 1 , 2 , … , , ).…”

PERMS: An efficient rescue route planning system in disasters

“…With a higher number of TSP dimensions after transformation, the difficulty of solving the problem significantly increases. In order to solve this problem, different methods based on the research results of physics, genetics and bionics have been proposed in recent years, including simulated annealing (SA) [33], bat algorithm (BA) [34], GA [35] [36] and ant colony optimisation (ACO) [37]. In [22], the authors transformed MTSP into TSP by adding virtual cities to the city set.…”

A Hybrid Discrete Bat Algorithm with Krill Herd-based advanced planning and scheduling tool for the capital goods industry

“…Figure 4(a). Swapping operator (Amara, Hamdani, and Alimi 2015).…”