Particle swarm optimization with partial search for solving traveling salesman problem
Traveling Salesman Problem (TSP) is a well-studied combinatorial optimization problem and recently a number of Particle Swarm Optimization (PSO) based methods have been investigated to solve TSP. Among the popular conventional PSO based methods, several methods consider Swap Sequence (SS) and Swap O...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Green University Press
2014
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/39781/ http://irep.iium.edu.my/39781/ http://irep.iium.edu.my/39781/1/J17-03_PSOPS-TSP_GreenUnv.pdf |