| Presentation | 2018-07-27 Search process for multi-objective network by applying efficiency of path search in one-objective network Natsumi Takahashi, Shao-Chin Sung, Tomoaki Akiba, Hisashi Yamamoto, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution management system and search system for optimal routes in the Internet Services. These networks are formulated as a multi-objective network which has multiple criteria. In this study, we are dealing with the problem of finding optimal paths (Pareto solutions) on multi-objective networks. A solution method called extended Dijkstra’s algorithm is proposed. As standards solution methods for single objective optimal path problem, the algorithm repeatedly update path data of nodes based on path data of other nodes. However, this algorithm requires large memory area for the searching process. The original Dijkstra’s algorithm requires non-negative weights, and based on this requirement, optimal paths can be obtained efficiently by distinguishing nodes whose optimal path is determined or not during the searching process. Here, we propose a new version of extended Dijkstra’s algorithm which focus on the status of path data of each node, which reduces the running time and memory usage. Finally, we conduct numerical experiments for showing the effectiveness of our proposed algorithm. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Multi-Objective Network / Dijkstra’s Algorithm / Optimal Path Problem / Pareto Solutions |
| Paper # | R2018-12 |
| Date of Issue | 2018-07-20 (R) |
| Conference Information | |
| Committee | R |
|---|---|
| Conference Date | 2018/7/27(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Reliability theory, Reliability for communication network, Overall reliability engineering |
| Chair | Tetsushi Yuge(National Defense Academy) |
| Vice Chair | Akira Asato(Fujitsu) |
| Secretary | Akira Asato(Hosei Univ.) |
| Assistant | Shinji Inoue(Kansai Univ.) / Hiroyuki Okamura(Hiroshima Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Reliability |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Search process for multi-objective network by applying efficiency of path search in one-objective network |
| Sub Title (in English) | |
| Keyword(1) | Multi-Objective Network |
| Keyword(2) | Dijkstra’s Algorithm |
| Keyword(3) | Optimal Path Problem |
| Keyword(4) | Pareto Solutions |
| 1st Author's Name | Natsumi Takahashi |
| 1st Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| 2nd Author's Name | Shao-Chin Sung |
| 2nd Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| 3rd Author's Name | Tomoaki Akiba |
| 3rd Author's Affiliation | Chiba Institute of Technology(Chiba Inst. of Tech.) |
| 4th Author's Name | Hisashi Yamamoto |
| 4th Author's Affiliation | Tokyo Metropolitan University(Tokyo Metropolitan Univ.) |
| Date | 2018-07-27 |
| Paper # | R2018-12 |
| Volume (vol) | vol.118 |
| Number (no) | R-161 |
| Page | pp.pp.7-12(R), |
| #Pages | 6 |
| Date of Issue | 2018-07-20 (R) |