Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)

ZHANG Xiao; SHINDO Takuya; HIRAGURI Takefumi; JIN'NO Kenya; Kenya JINNO

Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)

寄稿の翻訳タイトル: Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)

ZHANG Xiao, SHINDO Takuya, HIRAGURI Takefumi, JIN'NO Kenya, Kenya JINNO

知能情報工学科

研究成果: ジャーナルへの寄稿 › Misc

抄録

Recently, AGO with memory algorithm has been proposed to solve traveling salesman problems. In this article, we propose an improved AGO with memory algorithm which is applied 2-opt algorithm. We compare the solution search performance.

寄稿の翻訳タイトル	Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)
本文言語	アメリカ英語
ページ（範囲）	71 - 74
ジャーナル	IEICE technical report. Nonlinear problems
巻	113
号	341
出版ステータス	出版済み - 6 12月 2013

他のファイルとリンク

http://id.ndl.go.jp/bib/025143981

引用スタイル

@article{884d8fa3d7c745018fcaebdad3cb8e52,

title = "Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)",

abstract = "Recently, AGO with memory algorithm has been proposed to solve traveling salesman problems. In this article, we propose an improved AGO with memory algorithm which is applied 2-opt algorithm. We compare the solution search performance.",

author = "\{ZHANG Xiao\} and \{SHINDO Takuya\} and \{HIRAGURI Takefumi\} and \{JIN'NO Kenya\} and Kenya JINNO",

year = "2013",

month = dec,

day = "6",

language = "American English",

volume = "113",

pages = "71 -- 74",

journal = "IEICE technical report. Nonlinear problems",

issn = "0913-5685",

publisher = "The Institute of Electronics, Information and Communication Engineers",

number = "341",

}

TY - JOUR

T1 - Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)

AU - ZHANG Xiao, null

AU - SHINDO Takuya, null

AU - HIRAGURI Takefumi, null

AU - JIN'NO Kenya, null

AU - JINNO, Kenya

PY - 2013/12/6

Y1 - 2013/12/6

N2 - Recently, AGO with memory algorithm has been proposed to solve traveling salesman problems. In this article, we propose an improved AGO with memory algorithm which is applied 2-opt algorithm. We compare the solution search performance.

AB - Recently, AGO with memory algorithm has been proposed to solve traveling salesman problems. In this article, we propose an improved AGO with memory algorithm which is applied 2-opt algorithm. We compare the solution search performance.

UR - http://id.ndl.go.jp/bib/025143981

M3 - Misc

SN - 0913-5685

VL - 113

SP - 71

EP - 74

JO - IEICE technical report. Nonlinear problems

JF - IEICE technical report. Nonlinear problems

IS - 341

ER -

Performance Comparison of Search Ability of ACO with Memory for TSP (Nonlinear Problems)

抄録

他のファイルとリンク

フィンガープリント

引用スタイル