Random search method with intensification and diversification - discrete version

Kotaro Hirasawa, Hiroyuki Miyazaki, Jinglu Hu

研究成果査読

抄録

A new local search method RasID-D is proposed in this paper in order to improve the searching performance of discrete optimization problems. RasID-D is a discrete version of RasID which was developed for optimizing continuous optimization problems. RasID-D can achieve the high searching ability for the near optimal solutions without falling into local minima by iterating the intensification and diversification search. From simulations on Traveling Salesman Problem, it has been cleared that RasID-D can give better searching performances than the best local search method now being used.

本文言語English
ページ(範囲)209-214
ページ数6
ジャーナルResearch Reports on Information Science and Electrical Engineering of Kyushu University
5
2
出版ステータスPublished - 2000 9 1
外部発表はい

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • 電子工学および電気工学

フィンガープリント

「Random search method with intensification and diversification - discrete version」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル