Max-Min Ant Systemによる2次割り当て問題の実験

URI http://harp.lib.hiroshima-u.ac.jp/pu-hiroshima/metadata/8761
File
Title
Max-Min Ant Systemによる2次割り当て問題の実験
Author
氏名 廣田 真大
ヨミ ヒロタ マサヒロ
別名 Hirota Masahiro
氏名 市村 匠
ヨミ イチムラ タクミ
別名 Ichimura Takumi
Abstract

This paper describes the experimental results for Quadratic Assignment Problem (QAP) by using Max-Min Ant system (MMAS). MMAS is known as one of ACO search methods, which are based on cooperative behaviors by artificial ants. Generally, Traveling Salesman Problems (TSPs) are applied to verify the effectiveness of ACO methods. However, the many problems in real world are more difficult than TSP. Then, current researchers challenges to solve QAP benchmark test. In this paper, we report the empirical studies for Taillard, tai*a and tai*b to compare some ACO methods.

Description

開催日:平成23年7月9日 会場:広島市立大学

Journal Title
2011 IEEE SMC Hiroshima Chapter 若手研究会講演論文集
Spage
17
Epage
20
Published Date
2011
Publisher
IEEE SMC Hiroshima Chapter 
Language
jpn
NIIType
Conference Paper
Text Version
出版社版
Old URI
Set
pu-hiroshima