対称型マルチプロセッシングを用いた並列化ＡＣＯによる２次割当て問題の解法とその評価

• 筒井 茂義

  阪南大学経営情報学部

書誌事項

タイトル別名

• Solving the Quadratic Assignment Problems using Parallel ACO with Symmetric Multi Processing

抄録

In this paper, we propose several types of parallel ant colony optimization algorithms with symmetric multi processing for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. As a base ant colony optimization algorithm, we used the cunning Ant System (cAS) which showed promising performance our in previous studies. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ant colony optimization algorithms is promising in solving quadratic assignment problems for real or real-like instances.

収録刊行物

• 人工知能学会論文誌

  人工知能学会論文誌 24 (1), 46-57, 2009

  一般社団法人 人工知能学会

キーワード

• ant colony optimization
• parallel processing
• sysmmeteric multi processing
• quadratic assignment problem

詳細情報

• CRID: 1390001205106298496
• NII論文ID: 130000098269
• DOI: 10.1527/tjsai.24.46
• BIBCODE: 2009TJSAI..24...46T
• ISSN: 13468030
• ISSN: 13460714
• Web Site: http://www.jstage.jst.go.jp/article/tjsai/24/1/24_1_46/_pdf
• 本文言語コード: ja
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可