Development of an Innovative Algorithm for Huge Scale Placement Problems

• Project/Area Number: 25330281
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Soft computing
• Research Institution: Utsunomiya University
• Principal Investigator: TOYAMA FUBITO 宇都宮大学, 工学(系)研究科(研究院), 准教授 (60323317)
• Project Period (FY): 2013-04-01 – 2016-03-31
• Project Status: Completed (Fiscal Year 2015)
• Budget Amount: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000); Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000); Fiscal Year 2013: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
• Keywords: メタ戦略 / 組合せ最適化 / 最適配置

Outline of Final Research Achievements

In this study, we proposed a new algorithm for huge scale placement problems. Many metaheuristics have been proposed for placement problems. But these metaheurisitcs have been only applied to small scale placement problems. In our research, a new metaheuristic algorithm specialized for huge scale placement problem was proposed. In our experiments, the computational results showed that the proposed method outperformed previous methods for huge scale quadratic assignment problems.

Research Products

• [Journal Article] Memory Efficient de novo Assembly Algorithm using Disk Streaming of K-mers (2016)
  • Author(s): Yuki Endo, Fubito Toyama, Chikafumi Chiba, Hiroshi Mori and Kenji Shoji
  • Journal Title: Proceedings of the 9th International Joint Conference on Biomedical Engineering Systems and Technologies Volume: 3 Pages: 266-271
  • DOI: 10.5220/0005798302660271
  • Peer Reviewed
• [Journal Article] A Memory Efficient Short Read De Novo Assembly Algorithm (2015)
  • Author(s): Yuki Endo, Fubito Toyama, Chikafumi Chiba, Hiroshi Mori and Kenji Shoji
  • Journal Title: IPSJ Transactions on Bioinformatics Volume: 8 Pages: 1-6
  • NAID: 130004946339
  • Peer Reviewed
• [Journal Article] De Novo Short Read Assembly Algorithm with Low Memory Usage (2014)
  • Author(s): Endo, Y., Toyama, F., Chiba, C., Mori, H. and Shoji, K.
  • Journal Title: Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms Volume: in press Pages: 215-220
  • DOI: 10.5220/0004881002150220
  • Peer Reviewed
• [Presentation] Brick Partitioningと初期閾値推定を用いた高速テンプレートマッチング (2016)
  • Author(s): 町井 孝充, 外山 史, 森 博志, 東海林 健二
  • Organizer: 情報処理学会コンピュータビジョンとイメージメディア
  • Place of Presentation: 金沢
  • Year and Date: 2016-03-03
• [Presentation] ジグソーパズル組み立てにおけるL*a*b*色空間を用いたピース間評価値の検討 (2015)
  • Author(s): 鎌田 拓也，外山 史，森 博志，東海林 健二
  • Organizer: 第18回画像の認識・理解シンポジウム
  • Place of Presentation: 大阪
  • Year and Date: 2015-07-27
• [Presentation] 適応的領域分割を用いた多段階Winner Update Algorithmによる高速テンプレートマッチング (2015)
  • Author(s): 町井 孝充，外山 史，森 博志，東海林 健二
  • Organizer: 第18回画像の認識・理解シンポジウム
  • Place of Presentation: 大阪
  • Year and Date: 2015-07-27
• [Presentation] メモリ効率の良いde novoアセンブリアルゴリズム (2015)
  • Author(s): 遠藤 友基，外山 史，千葉 親文，森 博志，東海林 健二
  • Organizer: 情報処理学会研究報告 バイオ情報学
  • Place of Presentation: 北海道大学
  • Year and Date: 2015-03-20
• [Presentation] 大規模な2 次割当問題に対する近傍探索の高速化 (2014)
  • Author(s): 佐藤文也, 外山史, 森博志, 東海林健二
  • Organizer: 第8回進化計算シンポジウム
  • Place of Presentation: 広島県廿日市市
  • Year and Date: 2014-12-20 – 2014-12-21
• [Presentation] 大規模な最大多様性問題に対する反復タブー探索法 (2014)
  • Author(s): 鈴木浩史，外山史，森博志，東海林健二
  • Organizer: 第6回進化計算学会研究会
  • Place of Presentation: 東京