Random search method with intensification and diversification - discrete version

Kotaro Hirasawa, Hiroyuki Miyazaki, Takayuki Furuzuki

Research output: Contribution to journalArticle

Abstract

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
Volume5
Issue number2
Publication statusPublished - 2000 Sep
Externally publishedYes

Fingerprint

Traveling salesman problem

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

Random search method with intensification and diversification - discrete version. / Hirasawa, Kotaro; Miyazaki, Hiroyuki; Furuzuki, Takayuki.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 5, No. 2, 09.2000, p. 209-214.

Research output: Contribution to journalArticle

@article{50212c8cdab0444099cd96ea36d1d005,
title = "Random search method with intensification and diversification - discrete version",
abstract = "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.",
author = "Kotaro Hirasawa and Hiroyuki Miyazaki and Takayuki Furuzuki",
year = "2000",
month = "9",
language = "English",
volume = "5",
pages = "209--214",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "2",

}

TY - JOUR

T1 - Random search method with intensification and diversification - discrete version

AU - Hirasawa, Kotaro

AU - Miyazaki, Hiroyuki

AU - Furuzuki, Takayuki

PY - 2000/9

Y1 - 2000/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034263070&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034263070&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034263070

VL - 5

SP - 209

EP - 214

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

SN - 1342-3819

IS - 2

ER -