IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 18 of 18  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
R 2024-02-29
16:20
Shimane   Algorithm of evaluating network performance for resilience analysis
Kotaro Fujikura, Natsumi Takahashi, Tetsushi Yuge (NDA) R2023-61
Resilience in engineering is the ability of a system to maintain its functionality and to recover quickly and effectivel... [more] R2023-61
pp.36-41
R 2023-07-28
10:45
Hokkaido
(Primary: On-site, Secondary: Online)
Algorithm for stochastic flow network interdiction problem
Kazuki Hayashi, Natsumi Takahashi, Tetsushi Yuge (NDA) R2023-10
In this paper, we consider the network interdiction problem using the expected profit as a metric. The objective is to m... [more] R2023-10
pp.1-6
R 2023-03-10
15:50
Hiroshima
(Primary: On-site, Secondary: Online)
Search Space Reduction using Neighborhood in Genetic Algorithm
Natsumi Takahashi, Tetsushi Yuge (NDA), Tomoaki Akiba (CIT) R2022-54
In this study, we consider two-objective network design problem with all-terminal reliability and construction costs. Th... [more] R2022-54
pp.37-40
R 2022-07-29
16:15
Hokkaido
(Primary: On-site, Secondary: Online)
System availability analysis of two-echelon repair system considering simultaneous failures
Naoto Okubo, Natsumi Takahashi, Tetsushi Yuge (NDA) R2022-15
The two-echelon repair system is a type of multi-echelon repair system. The maintenance facilities in the system are div... [more] R2022-15
pp.36-41
R 2021-12-04
16:35
Online Online Verification of search space reduction method for Pareto optimal solution for bi-objective network problem with all-terminal reliability
Tomoaki Akiba, Yuri kanazawa (CIT), Natsumi Takahashi (NDA) R2021-42
 [more] R2021-42
pp.19-24
R 2021-06-12
14:00
Online Online (Zoom) An approximate method of network resirience
Yasumasa Sagawa, Natsumi Takahashi, Tetushi Yuge (NDA) R2021-11
Resilience is an index that takes into account not only the reduction of damage caused by system failures, but also the ... [more] R2021-11
pp.1-6
R 2019-07-26
14:50
Iwate Ichinoseki Cultural Center Bi-objective Reliable Network Design with Genetic Algorithm
Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisahi Yamamoto (Tokyo Metropolitan Univ.), Takashi Shinzato (Tamagawa Univ.) R2019-16
In this study, we consider two-objective network design problem with all-terminal reliability and construction costs. Th... [more] R2019-16
pp.13-18
R 2019-06-14
15:55
Tokyo Kikai-Shinko-Kaikan Bldg. Evaluation for the Algorithm of Minimum Cost-Flow Problem by Using Iterative Deepening Depth- First Search
Tomoaki Akiba (CIT), Natsumi Takahashi (AGU), Hisashi Yamamoto (TMU) R2019-13
In this study, I considered to treat the network of a transporting route problem with minimum cost that it satisfied flo... [more] R2019-13
pp.25-30
R 2018-07-27
14:00
Hokkaido   Evaluation for Obtaining the Pareto Solutions of a Bi-Objective Network with All-Terminal Reliability by Genetic Algorithm
Tomoaki Akiba (CIT), Natsumi Takahashi (AGU) R2018-11
There are many network systems in the real world, for example, Internet, electricity network and traffic network. In thi... [more] R2018-11
pp.1-6
R 2018-07-27
14:25
Hokkaido   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
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] R2018-12
pp.7-12
R 2018-05-25
16:20
Aichi Aichi Institute of Technology, Motoyama Campus Search Space Restriction by Spanning Tree in Multi-Objective Network
Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.), Shao-Chin Sung (Aoyama Gakuin Univ.) R2018-6
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] R2018-6
pp.31-36
R 2017-10-20
16:20
Kumamoto   Search for Optimal Construction Network with Multi-Objective Functions
Natsumi Takahashi (Aoyama Gakuin Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.), Shao-Chin Sung (Aoyama Gakuin Univ.) R2017-49
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] R2017-49
pp.29-33
R 2017-05-26
14:50
Okayama Purity Makibi Analytical inference on the best network construction
Daichi Enomoto, Xiao Xiao (Tokyo Metropolitan Univ.), Natsumi Takahashi (Aoyama Gakuin Univ.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2017-6
In this study,we propose the network system construction which has the maximum all-terminal reliability with specific re... [more] R2017-6
pp.31-36
R 2015-05-22
14:35
Shimane Okinoshima-Bunka-Kaikan Search process for optimal paths in multi-objective network
Natsumi Takahashi, Hisashi Yamamoto (Tokyo Met. Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Xiao Xiao (Tokyo Met. Univ.), Koji Shingyochi (Jumonji Univ.) R2015-5
Many networks have been applied extensively in the real world, for example, scheduling of a production and distribution ... [more] R2015-5
pp.25-30
R 2014-08-01
16:20
Hokkaido Smile Hotel Hakodate Evaluation of algorithm for the reliability of a 3-dimensional k-system
Tomoaki Akiba (CIT), Natsumi Takahashi (TMU), Yoshiki Watanabe (CIT), Hisashi Yamamoto (TMU) R2014-20
As some types of 2-dimensional consecutive-k-out-of-n:F system, there are connected-(r, s)-out-of-(m, n):F lattice syste... [more] R2014-20
pp.37-42
R 2014-05-23
15:45
Aichi   Effective restriction method on calculated networks for obtaining Pareto solutions
Natsumi Takahashi, Hisashi Yamamoto (Tokyo Met. Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Xiao Xiao (Tokyo Met. Univ.) R2014-6
In this study, we consider two-objective network design problem with all-terminal reliability and construction cost. And... [more] R2014-6
pp.29-34
R 2013-05-17
10:40
Hiroshima   Improvement of an algorithm to search two-objective network for Pareto solutions
Natsumi Takahashi (Tokyo Metropolitan Univ.), Tomoaki Akiba (Chiba Inst. of Tech.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2013-2
In this study, we consider two-objective network design problem with all-terminal reliability and construction cost. And... [more] R2013-2
pp.7-12
R 2012-12-14
10:00
Tokyo   An Algorithm for Searching Pareto Solutions of Multi-objective Network Design Problems
Natsumi Takahashi (Tokyo Met. Univ.), Tomoaki Akiba (Chiba Tech.), Hisashi Yamamoto (Tokyo Met. Univ.) R2012-68
In our study, we consider an algorithm for searching Pareto solutions of optimal design problem of a two-objective netwo... [more] R2012-68
pp.1-6
 Results 1 - 18 of 18  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan