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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , |
|---|---|
| Format: | Artikel |
| Bahasa: | English |
| Diterbitkan: |
Green University Press
2014
|
| Subjek-subjek: | |
| Capaian Atas Talian: | 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 |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|