An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

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
English
Published: Institute of Electrical and Electronics Engineers 2021
Subjects:
QA75.5-76.95 Electronic computers. Computer science
Online Access:https://eprints.ums.edu.my/id/eprint/33368/5/An%20enhanced%20swap%20sequence-based%20particle%20swarm%20optimization%20algorithm%20to%20solve%20tsp.ABSTRACT.pdf
https://eprints.ums.edu.my/id/eprint/33368/2/An%20enhanced%20swap%20sequence-based%20particle%20swarm%20optimization%20algorithm%20to%20solve%20tsp.pdf

Internet

https://eprints.ums.edu.my/id/eprint/33368/5/An%20enhanced%20swap%20sequence-based%20particle%20swarm%20optimization%20algorithm%20to%20solve%20tsp.ABSTRACT.pdf
https://eprints.ums.edu.my/id/eprint/33368/2/An%20enhanced%20swap%20sequence-based%20particle%20swarm%20optimization%20algorithm%20to%20solve%20tsp.pdf

Similar Items