Random search method with intensification and diversification - discrete version

Kotaro Hirasawa, Hiroyuki Miyazaki, Jinglu Hu

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)209-214
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Issue number2
Publication statusPublished - 2000 Sept 1
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'Random search method with intensification and diversification - discrete version'. Together they form a unique fingerprint.

Cite this