| Presentation | 2013-10-29 Solving Shortest Path Problems of Complex Networks Using Adaptable Independent-minded Particle Swarm Optimization Yoko ISHII, Haruna MATSUSHITA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The Shortest Path Problem (SPP) is one of the most fundamental problems in graph theory. The purpose of this study is to investigate on the applicability of Adaptable Independent-minded Particle Swarm Optimization (AIPSO) for SPP. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Shortest Path Problem / Particle Swarm Optimization (PSO) |
| Paper # | NLP2013-109 |
| Date of Issue |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2013/10/21(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Nonlinear Problems (NLP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Solving Shortest Path Problems of Complex Networks Using Adaptable Independent-minded Particle Swarm Optimization |
| Sub Title (in English) | |
| Keyword(1) | Shortest Path Problem |
| Keyword(2) | Particle Swarm Optimization (PSO) |
| 1st Author's Name | Yoko ISHII |
| 1st Author's Affiliation | Dept. of Reliability-based Information Systems Engineering, Kagawa University() |
| 2nd Author's Name | Haruna MATSUSHITA |
| 2nd Author's Affiliation | Dept. of Reliability-based Information Systems Engineering, Kagawa University |
| Date | 2013-10-29 |
| Paper # | NLP2013-109 |
| Volume (vol) | vol.113 |
| Number (no) | 271 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |