Development of Practical Algorithms for Network Optimization Problems based on Computer Experiments

• Project/Area Number: 18700031
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Single-year Grants
• Research Field: Software
• Research Institution: Hiroshima University
• Principal Investigator: TAOKA Satoshi Hiroshima University, 大学院・工学研究科, 助教 (80274116)
• Project Period (FY): 2006 – 2008
• Project Status: Completed (Fiscal Year 2008)
• Budget Amount: ¥3,480,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥180,000); Fiscal Year 2008: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000); Fiscal Year 2007: ¥600,000 (Direct Cost: ¥600,000); Fiscal Year 2006: ¥2,100,000 (Direct Cost: ¥2,100,000)
• Keywords: グラフ理論 / ネット理論 / NP困難問題 / 計算機実験と評価 / 多項式時間解法 / 総当り的解法 / 発見的解法 / 近似解法

Research Abstract

本研究の目的は,ネットワーク最適化問題に含まれるさまざまな問題に対して実用面において必要とされている解法の開発である。高速に(つまり多項式時間で)解ける問題のクラスの発見と、その実用的解法の開発と検証を行った。また、NP困難問題(解き難い問題)に対しては、総当り的(指数時間)解法の分散、並列処理などによる効率化とその検証、発見的解法の開発と検証を計算機実験に基づいて遂行した。

Research Products

• [Journal Article] Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs (2008)
  • Author(s): Dasisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, and Toshimasa Watanabe
  • Journal Title: IEICE Trans. Fundamentals Vol. 91-A, No. 4 Pages: 1129-1139
  • NAID: 10026848759
  • Peer Reviewed
• [Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem (2008)
  • Author(s): Satoshi Taoka, Dasisuke Takafuji, and Toshimasa Watanabe
  • Journal Title: IEICE Trans. Fundamentals Vol. 91-A, No. 4 Pages: 1140-1149
  • NAID: 10026848774
  • Peer Reviewed
• [Journal Article] Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs (2008)
  • Author(s): Dasisuke Takafuji
  • Journal Title: IEICE Trans. Fundamentals 91-A Pages: 1129-1139
  • Peer Reviewed
• [Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem (2008)
  • Author(s): Satoshi Taoka
  • Journal Title: IEICE Trans. Fundamentals 91-A Pages: 1140-1149
  • NAID: 10026848774
  • Peer Reviewed
• [Journal Article] Enhanced Approximation Algorithms for Maximum Weight Mafchings of Graphs (2008)
  • Author(s): Dasisuke Takafuji
  • Journal Title: IEICE Trans. Fundamentals 91-A(印刷中)
  • Peer Reviewed
• [Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Goloring problem (2008)
  • Author(s): Satoshi Taoka
  • Journal Title: IEICE Trans Fundamientals 91-A(印刷中)
  • Peer Reviewed
• [Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem (2007)
  • Author(s): Satoshi Taoka, Dasisuke Takafuji, Takashi Iguchi, and Toshimasa Watanabe
  • Journal Title: IEICE Trans. Fundamentals Vol. E90-A, No. 4
  • NAID: 110007519143
  • Peer Reviewed
• [Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem (2007)
  • Author(s): Satoshi Taoka
  • Journal Title: IEICE Trans. Fundamentals E90-A・4 Pages: 847-856
  • NAID: 110007519143
• [Journal Article] Experiment-based Evaluation of Algorithm Performance for the 2- or 3-Vertex Con-nectivity Augmentation Problem (2007)
  • Author(s): Hiroharu Sumiyoshi
  • Journal Title: IEICE Technical Report CAS2006-70 Pages: 1-6
• [Journal Article] Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs (2006)
  • Author(s): Satoshi Taoka, and Toshimasa Watanabe
  • Journal Title: IEICE Trans. Fundamentals Vol. E89-A, No. 11 Pages: 3216-3226
  • NAID: 110007537814
  • Peer Reviewed
• [Journal Article] On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree (2006)
  • Author(s): Toshiya Mashima, Satoshi Taoka, and Toshimasa Watanabe
  • Journal Title: IEICE Trans. Fundamentals Vol. E89-A, No. 4 Pages: 1042-1048
  • Peer Reviewed
• [Journal Article] Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs (2006)
  • Author(s): Satoshi Taoka, Kazuya Watanabe, and Toshimasa Watanabe
  • Journal Title: IEICE Trans. Fundamentals Vol. E89-A, No. 4 Pages: 1049-1057
  • NAID: 110007502808
  • Peer Reviewed
• [Journal Article] Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets With Inhibitor Arcs (2006)
  • Author(s): Satoshi Taoka
  • Journal Title: IEICE Trans. Fundamentals E89-A・11 Pages: 3216-3226
  • NAID: 110007537814
• [Journal Article] An Improved Heuristic Algorithm FEIDEQ for the Maximum Legal Firing Sequence Problem of Petri Nets (2006)
  • Author(s): Satoru Shimada
  • Journal Title: Proc. 2006 IEEE International Symposium on Circuits and Systems (ISCAS 2006) Pages: 4483-4486
• [Journal Article] Tri-Connectivity Augmentation Problems for Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase (2006)
  • Author(s): Takanori Fukuoka
  • Journal Title: Proc. the 19th Workshop on Circuits and Systems in Karuizawa Pages: 613-618
• [Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem (2006)
  • Author(s): Takashi Iguchi
  • Journal Title: Proc. the 19th Workshop on Circuits and Systems in Karuizawa Pages: 637-642
• [Journal Article] Constructing a Steiner Tree of a Rectilinear Graph with Obstracles -Enhancement based on Improved Selection of Steiner Candidate Points- (2006)
  • Author(s): Kazuhiro Egashira
  • Journal Title: IEICE Technical Report CAS2006-51 Pages: 56-60
• [Journal Article] Fast and Sharp Approximation Algorithms for the Maximum Weight Matching Problem of Graphs -Enchancing by improved search of weight augmenting paths- (2006)
  • Author(s): Yasunori Nishikawa
  • Journal Title: IEICE Technical Report CAS2006-52 Pages: 56-60
• [Journal Article] Experiment-based Evaluation of Algorithms for the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs (2006)
  • Author(s): Satoshi Taoka
  • Journal Title: IEICE Technical Report CST2006-6 Pages: 1-6
  • NAID: 110004776249
• [Journal Article] Siphon-trap-Based Algorithms for Computation of Petri Net Invariants with Supports Containing a Specified Place (2006)
  • Author(s): Tomohiro Chikada
  • Journal Title: IEICE Technical Report CST2006-7 Pages: 7-12
• [Presentation] Heuristic Algorithms AADO and AMDLO for the Minimum Initial Marking Problem of Petri Nets (2009)
  • Author(s): Satoru Ochiiwa
  • Organizer: Proc. the 22th Workshop on Circuits and Systems in Karuizawa
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2009-04-21
• [Presentation] グラフ点彩色問題の分散分枝限定解法ParaBSC に対するVNS に基づく性能強化 (2009)
  • Author(s): 田岡智志
  • Organizer: 第22回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2009-04-21
• [Presentation] Minimum Augmentation to Tri-Connect a Bi-Connected Graph with Upper Bounds on Vertex-Degree (2009)
  • Author(s): Toshiya Mashima
  • Organizer: Proc. the 22th Workshop on Circuits and Systems in Karuizawa
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2009-04-21
• [Presentation] MAX-LFS 解法と後処理の改良により性能強化されたペトリネットのマーキング構成問題解法 (2009)
  • Author(s): 田岡智志
  • Organizer: 第22回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2009-04-21
• [Presentation] 抑止辺を持つペトリネットの発火系列問題の解法について (2009)
  • Author(s): 竹歳裕一郎
  • Organizer: 電子情報通信学会回路とシステム研究会
  • Place of Presentation: 岐阜県岐阜市
  • Year and Date: 2009-03-03
• [Presentation] トークン供給フロー制御と競合トランジションに基づく後退操作によるペトリネット発火系列探索法の性能強化 (2009)
  • Author(s): 波多野開悟
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 神奈川県横浜市
  • Year and Date: 2009-01-29
• [Presentation] グラフ点彩色問題の分散分枝限定解法ParaBSCに対するVNSに基づく性能強化 (2009)
  • Author(s): 道後幸寛
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 神奈川県横浜市
  • Year and Date: 2009-01-29
• [Presentation] MAX-LFS解法と後処理の改良により性能強化されたペトリネットのマーキング構成問題解法 (2009)
  • Author(s): 石井稔久
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 神奈川県横浜市
  • Year and Date: 2009-01-29
• [Presentation] D-サイフォン縮小に基づくペトリネットの最小初期マーキング解法AMDL (2008)
  • Author(s): 落岩諭
  • Organizer: 電子情報通信学会ソサイエティ大会
  • Place of Presentation: 神奈川県川崎市
  • Year and Date: 2008-09-16
• [Presentation] A Linear Time Algorithm for Tri-connectivity Augmentation of Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase (2008)
  • Author(s): Toshiya Mashima
  • Organizer: Proc. of The 23rd International Technical Conference on Circuits/Systems, Computers and Communications
  • Place of Presentation: 山口県下関市
  • Year and Date: 2008-07-07
• [Presentation] グラフ点彩色問題解法の性能強化とその応用 (2008)
  • Author(s): 田岡智志
  • Organizer: 第21回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2008-04-21
• [Presentation] 最小重み点被覆問題に対する近似解法-計算機実験による性能比較- (2008)
  • Author(s): 田岡智志
  • Organizer: 第21回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2008-04-21
• [Presentation] A Linear Time Algorithm for Tri-connectivity Augmentation of Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase (2008)
  • Author(s): Toshiya Mashima
  • Organizer: Proc. of the 21st Karuizawa Workshop on Circuits and Systems
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2008-04-21
• [Presentation] グラフ点彩色問題解法の性能強化とその応用 (2008)
  • Author(s): 田岡智志
  • Organizer: 第21回回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2008-04-21
• [Presentation] 最小重み点被覆問題に対する近似解法-計算機実験による性能比較 (2008)
  • Author(s): 田岡智志
  • Organizer: 第21回回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2008-04-21
• [Presentation] A Linear Time Algorithm for Tri-connectivity Augmentation of Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase (2008)
  • Author(s): Toshiya Mashima
  • Organizer: 第21回回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2008-04-21
• [Presentation] 格予ズクイナー木問題に対する領域分割に墓づく並列解法 (2008)
  • Author(s): 江頭 一廣
  • Organizer: 電子情通信学会回路とシステム研究会
  • Place of Presentation: 山口県宇部市
  • Year and Date: 2008-03-06
• [Presentation] 最小重み点被覆問題に対する近似解法〜計算機実験による性能比較〜 (2008)
  • Author(s): 國近 拓也
  • Organizer: 電子情通信学会回路とシステム研究会
  • Place of Presentation: 沖縄県那覇市
  • Year and Date: 2008-02-01
• [Presentation] グラフ点彩色問題解法の性能強化 (2008)
  • Author(s): 岡田 慎司
  • Organizer: 電子情通信学会回路とシステム研究会
  • Place of Presentation: 沖縄県那覇市
  • Year and Date: 2008-01-31
• [Presentation] Finding Legal Firing Sequences Permitting Excess Firing of Transitions in Petri Nets (2008)
  • Author(s): koKi Katayama
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 徳島県徳島市
  • Year and Date: 2008-01-29
• [Presentation] A Heuristic Algorithm AADO for Minimizing Initial Markings of Petri Nets (2007)
  • Author(s): Satoru Ochiiwa
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 新潟県新潟市
  • Year and Date: 2007-11-30
• [Presentation] Enhancing Stability of the Fourier Motzkin Method based on Siphon-trap Extraction of Petri nets (2007)
  • Author(s): Tomohiro Chikada
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 島根県松江市
  • Year and Date: 2007-08-31
• [Presentation] Improving Firing Sequence Search for Marking Construction Problem of Petri Nets (2007)
  • Author(s): Toshihisa Ishii
  • Organizer: 電子情報通信学会コンカレント工学研究会
  • Place of Presentation: 沖縄県那覇市
  • Year and Date: 2007-06-29
• [Presentation] 重み増加パス探索改良によるグラフ最大重みマッチング近似解法の性能強化 (2007)
  • Author(s): 西河恭倫
  • Organizer: 第20回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2007-04-24
• [Presentation] 重み増加バス探索改良によるグラフ最大重みマッチング近似解法の性能強化 (2007)
  • Author(s): 西河 恭倫
  • Organizer: 第20回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡軽井沢町
  • Year and Date: 2007-04-24
• [Presentation] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem (2007)
  • Author(s): Satoshi Taoka
  • Organizer: Proc. the 20th Workshop on Circuits and Systems in Karuizawa
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2007-04-23
• [Presentation] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem (2007)
  • Author(s): Satoshi Taoka
  • Organizer: 第20回 回路とシステム軽井沢ワークショップ
  • Place of Presentation: 長野県北佐久郡軽井沢町
  • Year and Date: 2007-04-23
• [Presentation] An Improved Heuristic Algorithm FEIDEQ for the Maximum Legal Firing Sequence Problem of Petri Nets (2006)
  • Author(s): Toshimasa Watanabe
  • Organizer: Proc. 2006 IEEE International Symposium on Circuit and Systems (ISCAS 2006)
  • Place of Presentation: ギリシャ
  • Year and Date: 2006-05-24
• [Presentation] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem (2006)
  • Author(s): Satoshi Taoka
  • Organizer: Proc. the 19th Workshop on Circuits and Systems in Karuizawa
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2006-04-25
• [Presentation] Tri-Connectivity Augmentation Problems for Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase (2006)
  • Author(s): Toshiya Mashima
  • Organizer: Proc. the 19th Workshop on Circuits and Systems in Karuizawa
  • Place of Presentation: 長野県北佐久郡
  • Year and Date: 2006-04-25