A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem

2021 ◽  
Vol 172 ◽  
pp. 114639
Author(s):  
Yassine Saji ◽  
Mohammed Barkatou
Keyword(s):  
Traveling Salesman Problem ◽  
Bat Algorithm ◽  
Traveling Salesman ◽  
Lévy Flights ◽  
Levy Flights ◽  
Euclidean Traveling Salesman Problem

scholarly journals A Novel Bat Algorithm Based on Differential Operator and Lévy Flights Trajectory

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Jian Xie ◽  
Yongquan Zhou ◽  
Huan Chen
Keyword(s):  
Differential Operator ◽  
Dimensional Space ◽  
Bat Algorithm ◽  
High Dimensional ◽  
Local Minima ◽  
Lévy Flights ◽  
Levy Flights ◽  
Mutation Strategy ◽  
Differential Algorithm ◽  
Simulation Results

Aiming at the phenomenon of slow convergence rate and low accuracy of bat algorithm, a novel bat algorithm based on differential operator and Lévy flights trajectory is proposed. In this paper, a differential operator is introduced to accelerate the convergence speed of proposed algorithm, which is similar to mutation strategy “DE/best/2” in differential algorithm. Lévy flights trajectory can ensure the diversity of the population against premature convergence and make the algorithm effectively jump out of local minima. 14 typical benchmark functions and an instance of nonlinear equations are tested; the simulation results not only show that the proposed algorithm is feasible and effective, but also demonstrate that this proposed algorithm has superior approximation capabilities in high-dimensional space.

scholarly journals Simple Constructive, Insertion, and Improvement Heuristics Based on the Girding Polygon for the Euclidean Traveling Salesman Problem

Algorithms ◽  
2019 ◽  
Vol 13 (1) ◽  
pp. 5 ◽  
Author(s):  
Víctor Pacheco-Valencia ◽  
José Alberto Hernández ◽  
José María Sigarreta ◽  
Nodari Vakhania
Keyword(s):  
Traveling Salesman Problem ◽  
Real Life ◽  
Traveling Salesman ◽  
Computational Time ◽  
Problem Instance ◽  
Dimensional Euclidean Space ◽  
Benchmark Problem ◽  
Small Constant ◽  
Euclidean Traveling Salesman Problem ◽  
Problem Instances

The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem, in which the locations are points in the two-dimensional Euclidean space and the distances are correspondingly Euclidean distances. We propose simple, fast, and easily implementable heuristics that work well, in practice, for large real-life problem instances. The algorithm works on three phases, the constructive, the insertion, and the improvement phases. The first two phases run in time O ( n 2 ) and the number of repetitions in the improvement phase, in practice, is bounded by a small constant. We have tested the practical behavior of our heuristics on the available benchmark problem instances. The approximation provided by our algorithm for the tested benchmark problem instances did not beat best known results. At the same time, comparing the CPU time used by our algorithm with that of the earlier known ones, in about 92% of the cases our algorithm has required less computational time. Our algorithm is also memory efficient: for the largest tested problem instance with 744,710 cities, it has used about 50 MiB, whereas the average memory usage for the remained 217 instances was 1.6 MiB.

Sign in / Sign up

Export Citation Format

Share Document