Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem

AES Ezugwu, AO Adewumi, ME Frîncu - Expert Systems with Applications, 2017 - Elsevier
Abstract Symbiotic Organisms Search (SOS) algorithm is an effective new metaheuristic
search algorithm, which has recently recorded wider application in solving complex …

Discrete firefly algorithm for traveling salesman problem: A new movement scheme

GK Jati, R Manurung - Swarm Intelligence and Bio-Inspired Computation, 2013 - Elsevier
The “firefly algorithm”(FA) is a nature-inspired technique originally designed for solving
continuous optimization problems. There are several existing approaches that apply FA also …

D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm

P Pirozmand, AAR Hosseinabadi, MJ Chari… - IEEE …, 2023 - ieeexplore.ieee.org
The Traveling Salesman Problem (TSP) which is a theoretical computer science and
operations research problem, has several applications even in its purest formulation, such …

Discrete cuckoo search algorithm for the travelling salesman problem

A Ouaarab, B Ahiod, XS Yang - Neural Computing and Applications, 2014 - Springer
In this paper, we present an improved and discrete version of the Cuckoo Search (CS)
algorithm to solve the famous traveling salesman problem (TSP), an NP-hard combinatorial …

Discrete symbiotic organisms search algorithm for travelling salesman problem

AES Ezugwu, AO Adewumi - Expert Systems with Applications, 2017 - Elsevier
Abstract A Discrete Symbiotic Organisms Search (DSOS) algorithm for finding a near optimal
solution for the Travelling Salesman Problem (TSP) is proposed. The SOS is a metaheuristic …

Beam-ACO for the travelling salesman problem with time windows

M López-Ibáñez, C Blum - Computers & operations research, 2010 - Elsevier
The travelling salesman problem with time windows is a difficult optimization problem that
arises, for example, in logistics. This paper deals with the minimization of the travel-cost. For …

Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem

Y Wang, YW Wu, N Xu - Computers & Industrial Engineering, 2019 - Elsevier
Traveling salesman problem (TSP) is one of the well-known NP-hard problems in
combinatorial optimization. The optimal solution of large-scale TSP is difficult to find with …

Discrete bat-inspired algorithm for travelling salesman problem

Y Saji, ME Riffi, B Ahiod - 2014 Second World Conference on …, 2014 - ieeexplore.ieee.org
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 …

A hybrid honey bees mating optimization algorithm for the probabilistic traveling salesman problem

Y Marinakis, M Marinaki - 2009 IEEE Congress on Evolutionary …, 2009 - ieeexplore.ieee.org
The probabilistic traveling salesman problem is a variation of the classic traveling salesman
problem and one of the most significant stochastic routing problems. In this paper, a new …

Multiagent optimization system for solving the traveling salesman problem (TSP)

XF Xie, J Liu - IEEE Transactions on Systems, Man, and …, 2008 - ieeexplore.ieee.org
The multiagent optimization system (MAOS) is a nature-inspired method, which supports
cooperative search by the self-organization of a group of compact agents situated in an …