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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Green University Press
2014
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/39781/1/J17-03_PSOPS-TSP_GreenUnv.pdf http://irep.iium.edu.my/39781/ http://green.edu.bd/academics/journal/45-gubjse/525-gubjse-volume-1-issue-1-july-2014 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|