• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Development ofPractical Algorithms for Network Optimization Problems in order to Improve Reliability of Information Networks

Research Project

Project/Area Number 22500029
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Software
Research InstitutionHiroshima University

Principal Investigator

TAOKA Satoshi  広島大学, 大学院・工学研究院, 助教 (80274116)

Project Period (FY) 2010 – 2012
Project Status Completed (Fiscal Year 2012)
Budget Amount *help
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
Keywords情報ネットワーク構成法 / 確率ネットワーク / ネットワークの信頼性 / ネットワーク最適化問題 / アルゴリズム設計 / 計算機実験と評価 / グラフ理論 / ネット理論 / グラフの辺連結度 / グラフの点連結度 / ネットワーク信頼性 / 近似解精度 / ベクター加算システム
Research Abstract

The purpose of my study is to develop practical algorithms for network optimization problems in order to improve reliability of information networks. For the following (1) through (4), I proposed algorithms having practicality and evaluate the algorithms and existing ones through results of computing experiment: (1) fundamental problems related to network optimization problems, (2) problems about investing a network or design of protocol on a network, (3) calculating reliability of a stochastic network, (4) improving reliability of a stochastic network based on the vertex capacity assignment.

Report

(4 results)
  • 2012 Annual Research Report   Final Research Report ( PDF )
  • 2011 Annual Research Report
  • 2010 Annual Research Report
  • Research Products

    (56 results)

All 2013 2012 2011 2010 Other

All Journal Article (8 results) (of which Peer Reviewed: 8 results) Presentation (48 results)

  • [Journal Article] A Distributed Algorithm for 2-Edge-Connectivity Augmentation Problem of a Connected Graph"2013

    • Author(s)
      Satoshi Taoka, and Toshimasa Watanabe
    • Journal Title

      The 28th International Technical Conference on Circuits/Systems, Computers and Communications

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets2013

    • Author(s)
      第26回回路とシステムワークショップ
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: 2 Pages: 540-553

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] Computing-based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs2013

    • Author(s)
      Satoshi Taoka
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: Vol.E96-A, No.6

    • NAID

      10031193819

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets2013

    • Author(s)
      Satoru Ochiiwa
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: Vol.E96-A, No.2 Pages: 540-553

    • Related Report
      2012 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2012

    • Author(s)
      Tadachika OKI, Satoshi TAOKA, Toshiya MASHIMA, Toshimasa WATANABE
    • Journal Title

      IEICE Trans. Information and Systems

      Volume: 3 Pages: 769-777

    • NAID

      10030611587

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2012

    • Author(s)
      Tadachika Oki
    • Journal Title

      IEICE Trans. Information and Systems

      Volume: Vol.E95-D, No.3 Pages: 769-777

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Journal Article] The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms2011

    • Author(s)
      Satoshi Taoka, Toshimasa Watanabe
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: 9 Pages: 1833-1841

    • NAID

      10030190835

    • Related Report
      2012 Final Research Report
    • Peer Reviewed
  • [Journal Article] The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms2011

    • Author(s)
      Satoshi Taoka
    • Journal Title

      IEICE Trans.Fundamentals

      Volume: Vol.E94-A, No.9 Pages: 1833-1841

    • NAID

      10030190835

    • Related Report
      2011 Annual Research Report
    • Peer Reviewed
  • [Presentation] 通信ネットワークのトラフィックパスに基づく信頼性計算法の改良2013

    • Author(s)
      田岡 智志, 野口 威, 渡邉 敏正
    • Organizer
      第26回回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Year and Date
      2013-07-30
    • Related Report
      2012 Final Research Report
  • [Presentation] A Distributed Algorithm for 2-Edge-Connectivity Augmentation Problem of a Connected Graph"2013

    • Author(s)
      Satoshi Taoka, and Toshimasa Watanabe
    • Organizer
      The 28th International Technical Conference on Circuits/Systems
    • Place of Presentation
      Yeosu, Korea
    • Year and Date
      2013-07-03
    • Related Report
      2012 Final Research Report
  • [Presentation] 格子グラフ上の二重入れ子状矩形境界間を接続する互いに点素なパスについて"2013

    • Author(s)
      花田 英人, 高藤 大介, 田岡 智志, 渡邉 敏正.
    • Place of Presentation
      別府市
    • Year and Date
      2013-01-29
    • Related Report
      2012 Final Research Report
  • [Presentation] ネットワークのトラフィックパスに基づく信頼性計算における要素分解順序の改良について2013

    • Author(s)
      野口 威, 田岡 智志, 渡邉 敏正
    • Place of Presentation
      別府市
    • Year and Date
      2013-01-29
    • Related Report
      2012 Final Research Report
  • [Presentation] カンファレンスプログラム編成のための局所探索法の性能強化 初期解生成と近傍交換2013

    • Author(s)
      奥本 政彦, 田岡 智志, 渡邉 敏正
    • Organizer
      信学技報
    • Place of Presentation
      大阪市
    • Year and Date
      2013-01-23
    • Related Report
      2012 Final Research Report
  • [Presentation] カンファレンスプログラム編成のための局所探索法の性能強化 ~ 初期解生成と近傍交換 ~2013

    • Author(s)
      奥本 政彦
    • Organizer
      電子情報通信学会システム数理と応用研究会
    • Place of Presentation
      大阪市
    • Related Report
      2012 Annual Research Report
  • [Presentation] ネットワークのトラフィックパスに基づく信頼性計算における要素分解順序の改良について2013

    • Author(s)
      野口 威
    • Organizer
      電子情報通信学会回路とシステム研究会
    • Place of Presentation
      別府市
    • Related Report
      2012 Annual Research Report
  • [Presentation] 確率ネットワークにおける信頼性評価法の性能比較2012

    • Author(s)
      田原 将充, 坂本 達哉, 田岡 智志, 渡邉 敏正
    • Organizer
      気・情報関連学会中国支部第63回連合大会
    • Place of Presentation
      松江市
    • Year and Date
      2012-10-20
    • Related Report
      2012 Final Research Report
  • [Presentation] フローネットワーク故障耐性のための頂点容量割り当て法の性能強化2012

    • Author(s)
      坂本 達哉, 田岡 智志, 渡邉 敏正
    • Organizer
      第25回回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Year and Date
      2012-07-31
    • Related Report
      2012 Final Research Report
  • [Presentation] 点の非隣接性を考慮した最小重み点カバー問題解法2012

    • Author(s)
      山崎 雄太, 田岡 智志, 渡邉 敏正
    • Organizer
      第25回回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Year and Date
      2012-07-31
    • Related Report
      2012 Final Research Report
  • [Presentation] Pseudo-polynomial Time Solvability for The Maximum Legal Firing Sequence Problem of Inhibitor-Arc Petri nets - Weighted Marked Graphs with Inhibitor Arcs2012

    • Author(s)
      Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      The 27th International Technical Conference on Circuits/Systems
    • Place of Presentation
      札幌市
    • Year and Date
      2012-07-18
    • Related Report
      2012 Final Research Report
  • [Presentation] Performance Comparison of Approximation Algorithms for the Minimum Weight Vertex Cover Problem2012

    • Author(s)
      Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      2012 IEEE International Symposium on Circuit and Systems
    • Place of Presentation
      Soul, Korea
    • Year and Date
      2012-05-23
    • Related Report
      2012 Final Research Report
  • [Presentation] グラフ点彩色問題の発見的解法の性能比較2012

    • Author(s)
      小新 雄太, 田岡 智志, 渡邉 敏正.
    • Place of Presentation
      新潟市
    • Year and Date
      2012-03-09
    • Related Report
      2012 Final Research Report
  • [Presentation] グラフ点彩色問題の発見的解法の性能比較2012

    • Author(s)
      小新雄太
    • Organizer
      電子情報通信学会回路とシステム研究会
    • Place of Presentation
      新潟市
    • Year and Date
      2012-03-09
    • Related Report
      2011 Annual Research Report
  • [Presentation] 描画固定部分グラフを有するグラフの平面性2012

    • Author(s)
      大野 峻, 高藤 大介, 田岡 智志, 渡邉 敏正.
    • Organizer
      信学技報
    • Place of Presentation
      福岡市
    • Year and Date
      2012-01-20
    • Related Report
      2012 Final Research Report
  • [Presentation] Pseudo-polynomial Time Solvability for The Maximum Legal Firing Sequence Problem of Inhibitor-Arc Petri nets - Weighted Marked Graphs with Inhibitor Arcs -2012

    • Author(s)
      Satoru Ochiiwa
    • Organizer
      The 27th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2012)
    • Place of Presentation
      札幌市
    • Related Report
      2012 Annual Research Report
  • [Presentation] Performance Comparison of Approximation Algorithms for the Minimum Weight Vertex Cover Problem2012

    • Author(s)
      Satoshi Taoka
    • Organizer
      2012 IEEE International Symposium on Circuit and Systems (ISCAS 2012)
    • Place of Presentation
      韓国
    • Related Report
      2012 Annual Research Report
  • [Presentation] フローネットワーク故障耐性のための頂点容量割り当て法の性能強化2012

    • Author(s)
      坂本 達哉
    • Organizer
      第25回 回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Related Report
      2012 Annual Research Report
  • [Presentation] 点の非隣接性を考慮した最小重み点カバー問題解法2012

    • Author(s)
      山崎 雄太
    • Organizer
      第25回 回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Related Report
      2012 Annual Research Report
  • [Presentation] A Simplified Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2011

    • Author(s)
      Tadachika OKI, Satoshi TAOKA, Toshimasa WATANABE
    • Organizer
      The First International Workshop on Networking, Computing, Systems, and Software (NCSS)
    • Place of Presentation
      吹田市
    • Year and Date
      2011-12-02
    • Related Report
      2012 Final Research Report
  • [Presentation] A Simplified Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2011

    • Author(s)
      Tadachika Oki
    • Organizer
      The First International Workshop on Networking, Computing, Systems, and Software
    • Place of Presentation
      吹田市
    • Year and Date
      2011-12-01
    • Related Report
      2011 Annual Research Report
  • [Presentation] カンファレンスプログラム編成のための局所探索法の改良2011

    • Author(s)
      上原 康史, 田岡 智志, 渡邉 敏正.
    • Organizer
      第24回回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Year and Date
      2011-08-02
    • Related Report
      2012 Final Research Report 2011 Annual Research Report
  • [Presentation] 確率的頂点容量を持つフローネットワークのコスト付き頂点容量割り当て問題の発見的解法2011

    • Author(s)
      大和 秀彰, 田岡 智志, 渡邉 敏正
    • Organizer
      第24回回路とシステムワークショップ
    • Place of Presentation
      淡路市
    • Year and Date
      2011-08-02
    • Related Report
      2012 Final Research Report 2011 Annual Research Report
  • [Presentation] A Fast Algorithm for Augmenting Edge-Connectivity by One with Multipartition Constraints2011

    • Author(s)
      Tadachika Oki
    • Organizer
      The 26th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)
    • Place of Presentation
      韓国
    • Year and Date
      2011-06-21
    • Related Report
      2011 Annual Research Report
  • [Presentation] Two Heuristic Algorithms for Minimizing Initial Markings of Timed Petri Nets2011

    • Author(s)
      Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe.
    • Organizer
      The 26th International Technical Conference on Circuits/Systems
    • Place of Presentation
      Gyeogju, Korea
    • Year and Date
      2011-06-20
    • Related Report
      2012 Final Research Report
  • [Presentation] A Fast Algorithm for Augmenting Edge-Connectivity by One with Multipartition Constraints2011

    • Author(s)
      Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      The 26th International Technical Conference on Circuits/Systems
    • Place of Presentation
      Gyeogju, Korea
    • Year and Date
      2011-06-20
    • Related Report
      2012 Final Research Report
  • [Presentation] Two Heuristic Algorithms for Minimizing Initial Markings of Timed Petri Nets2011

    • Author(s)
      Satoru Ochiiwa
    • Organizer
      The 26th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)
    • Place of Presentation
      韓国
    • Year and Date
      2011-06-20
    • Related Report
      2011 Annual Research Report
  • [Presentation] カンファレンスプログラム編成のための局所探索法の改良2011

    • Author(s)
      上原 康史, 田岡 智志, 渡邉 敏正
    • Place of Presentation
      那覇市
    • Year and Date
      2011-03-07
    • Related Report
      2012 Final Research Report
  • [Presentation] カンファレンスプログラム編成のための局所探索法の改良2011

    • Author(s)
      上原康史
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      那覇市
    • Year and Date
      2011-03-07
    • Related Report
      2010 Annual Research Report
  • [Presentation] 確率フローネットワークの頂点容量割り当て問題に対する発見的解法2011

    • Author(s)
      大和 秀彰, 田岡 智志, 渡邉 敏正
    • Organizer
      信学技報
    • Place of Presentation
      下関市
    • Year and Date
      2011-01-21
    • Related Report
      2012 Final Research Report
  • [Presentation] Enhanced Algorithms for the Marking Construction Problem of Petri Nets based on Improvement of Finding Firing Sequeunces2011

    • Author(s)
      吉岡 篤人, 田岡 智志, 渡邉 敏正
    • Organizer
      IEICE Tech. Rep
    • Place of Presentation
      下関市
    • Year and Date
      2011-01-21
    • Related Report
      2012 Final Research Report
  • [Presentation] 確率フローネットワークの頂点容量割り当て問題に対する発見的解法2011

    • Author(s)
      大和秀彰
    • Organizer
      電子情報通信学会コンカレント工学研究会
    • Place of Presentation
      下関市
    • Year and Date
      2011-01-21
    • Related Report
      2010 Annual Research Report
  • [Presentation] Enhanced Algorithms for the Marking Construction Problem of Petri Nets based on Improvement of Finding Firing Sequeunces2011

    • Author(s)
      吉岡篤人
    • Organizer
      電子情報通信学会コンカレント工学研究会
    • Place of Presentation
      下関市
    • Year and Date
      2011-01-21
    • Related Report
      2010 Annual Research Report
  • [Presentation] A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints2010

    • Author(s)
      Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      2nd International Workshop on Parallel and Distributed Algorithms and Applications (PDAA)
    • Place of Presentation
      東広島市
    • Year and Date
      2010-11-19
    • Related Report
      2012 Final Research Report
  • [Presentation] A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints2010

    • Author(s)
      Tadachika Oki
    • Organizer
      2nd International Workshop on Parallel and Distributed Algorithms and Applications(PDAA)
    • Place of Presentation
      広島県東広島市
    • Year and Date
      2010-11-19
    • Related Report
      2010 Annual Research Report
  • [Presentation] 時間付きペトリネットにおける最小初期マーキング問題に対する発見的解法 TPM とTMDLO2010

    • Author(s)
      落岩 諭, 田岡 智志, 渡邊 敏正
    • Organizer
      Tech. Rep. CST2010-40 IEICE of Japan
    • Place of Presentation
      吹田市
    • Year and Date
      2010-11-18
    • Related Report
      2012 Final Research Report
  • [Presentation] 時間付きペトリネットにおける最小初期マーキング問題に対する発見的解法TPMとTMDLO2010

    • Author(s)
      落岩諭
    • Organizer
      電子情報通信学会コンカレント工学研究会
    • Place of Presentation
      吹田市
    • Year and Date
      2010-11-18
    • Related Report
      2010 Annual Research Report
  • [Presentation] A Fast Algorithm for (δ+1)-Edge-Connectivity Augmentation of a δ-Edge-Connected Graph with Multipartition Constraints2010

    • Author(s)
      Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      IPSJ SIG Technical Report
    • Place of Presentation
      函館市
    • Year and Date
      2010-09-22
    • Related Report
      2012 Final Research Report
  • [Presentation] A Fast Algorithm for(σ+1)-Edge-Connectivity Augmentation of a σ-Edge-Connected Graph with Multipartition Constraints2010

    • Author(s)
      沖忠親
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      函館市
    • Year and Date
      2010-09-22
    • Related Report
      2010 Annual Research Report
  • [Presentation] Heuristic Algorithms for the Marking Construction Problem of Petri Nets2010

    • Author(s)
      Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      2010 IEEE International Symposium on Circuit and Systems (ISCAS 2010)
    • Place of Presentation
      Paris, France
    • Year and Date
      2010-06-02
    • Related Report
      2012 Final Research Report
  • [Presentation] Heuristic Algorithms for the Marking Construction Problem of Petri Nets2010

    • Author(s)
      Satoshi Taoka
    • Organizer
      Proc.2010 IEEE International Symposium on Circuit and Systems (ISCAS 2010)
    • Place of Presentation
      France
    • Year and Date
      2010-05-31
    • Related Report
      2010 Annual Research Report
  • [Presentation] σ辺連結 2 部グラフの(σ + 1)辺連結化のための高速アルゴリズム"2010

    • Author(s)
      沖 忠親, 田岡 智志, 間島 利也, 渡邉 敏正
    • Organizer
      第23回回路とシステム軽井沢ワークショップ
    • Place of Presentation
      北佐久郡
    • Year and Date
      2010-04-20
    • Related Report
      2012 Final Research Report
  • [Presentation] カンファレンスプログラムの自動編成について2010

    • Author(s)
      畑 守之, 田岡 智志, 渡邉 敏正
    • Organizer
      第23回回路とシステム軽井沢ワークショップ
    • Place of Presentation
      北佐久郡
    • Year and Date
      2010-04-20
    • Related Report
      2012 Final Research Report
  • [Presentation] Heuristic Extraction of a Maximum Induced Tree from a Graph2010

    • Author(s)
      Hiroyuki Yoshida, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe
    • Organizer
      the 23rd Workshop on Circuits and Systems in Karuizawa
    • Place of Presentation
      北佐久郡
    • Year and Date
      2010-04-20
    • Related Report
      2012 Final Research Report
  • [Presentation] σ辺連結2部グラフの(σ+1)辺連結化のための高速アルゴリズム2010

    • Author(s)
      沖忠親
    • Organizer
      第23回 回路とシステム軽井沢ワークショップ
    • Place of Presentation
      長野県北佐久郡
    • Year and Date
      2010-04-20
    • Related Report
      2010 Annual Research Report
  • [Presentation] Heuristic Extraction of a Maximum Induced Tree from a Graph2010

    • Author(s)
      吉田浩之
    • Organizer
      第23回 回路とシステム軽井沢ワークショップ
    • Place of Presentation
      長野県北佐久郡
    • Year and Date
      2010-04-20
    • Related Report
      2010 Annual Research Report
  • [Presentation] カンファレンスプログラムの自動編成について2010

    • Author(s)
      田岡智志
    • Organizer
      第23回 回路とシステム軽井沢ワークショップ
    • Place of Presentation
      長野県北佐久郡
    • Year and Date
      2010-04-19
    • Related Report
      2010 Annual Research Report
  • [Presentation] 確率ネットワークにおける信頼性評価法の性能比較

    • Author(s)
      田原 将充
    • Organizer
      電気・情報関連学会中国支部第63回連合大会
    • Place of Presentation
      松江市
    • Related Report
      2012 Annual Research Report

URL: 

Published: 2010-08-23   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi