Published 2017
“…After critical assessments of the performances of eleven
algorithms consisting of two heuristics (Randomized Insertion
Algorithm and the Honey Bee Mating Optimization for the Travelling Salesman’s Problem), two trajectory
algorithms (Simulated Annealing and Evolutionary Simulated Annealing) and seven population-based optimization
algorithms (Genetic
Algorithm, Artificial Bee Colony, African Buffalo Optimization,
Bat Algorithm, Particle Swarm Optimization, Ant Colony Optimization and Firefly
Algorithm) in solving the 60 popular and complex benchmark symmetric Travelling Salesman’s optimization problems out of the total 118 as well as all the 18 asymmetric Travelling Salesman’s Problems test cases available in TSPLIB91. …”
Get full text
Get full text
Get full text
Article