An Enhanced Swap Sequence-Based Particle Swarm Optimization Algorithm to Solve TSP

An Enhanced Swap Sequence-Based Particle Swarm Optimization Algorithm to Solve TSP

Show other versions (1)

The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that is useful in a number of applications. Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and P...

Full description

Bibliographic Details
Main Authors: Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Metaheuristics
optimization problem
particle swarm optimization
swarm intelligence
traveling salesman problem
Online Access:https://ieeexplore.ieee.org/document/9638688/

Internet

https://ieeexplore.ieee.org/document/9638688/

Similar Items