| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2018-07-27 14:25 Search process for multi-objective network by applying efficiency of path search in one-objective network Natsumi Takahashi, Shao-Chin Sung (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.)  R2018-12 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (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) |
| (in English) | Multi-Objective Network / Dijkstra’s Algorithm / Optimal Path Problem / Pareto Solutions / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 118, no. 161, R2018-12, pp. 7-12, July 2018. | |
| Paper # | R2018-12 | |
| Date of Issue | 2018-07-20 (R) | |
| ISSN | Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | R2018-12 |
|
| Conference Information | |
| Committee | R |
| Conference Date | 2018-07-27 - 2018-07-27 |
| 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 |
| Paper Information | |
| Registration To | R |
| Conference Code | 2018-07-R |
| Language | Japanese |
| 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 |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 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.) |
| 5th Author's Name | |
| 5th Author's Affiliation | () |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2018-07-27 14:25:00 |
| Presentation Time | 25 minutes |
| Registration for | R |
| Paper # | R2018-12 |
| Volume (vol) | vol.118 |
| Number (no) | no.161 |
| Page | pp.7-12 |
| #Pages | 6 |
| Date of Issue | 2018-07-20 (R) |
[Return to Top Page]