Discrete Random Search Method “RasID-D” for Optimization Problems

DOI Web Site 1 Citations 3 References
  • HIRASAWA Kotaro
    Graduate School of Information, Production and Systems, Waseda University
  • MIYAZAKI Hiroyuki
    Department of Electrical and Electronic Systems Engineering, Kyushu University
  • HU Jinglu
    Graduate School of Information, Production and Systems, Waseda University
  • GOTO Kenichi
    Graduate School of Information, Production and Systems, Waseda University

Bibliographic Information

Other Title
  • 適応的離散ランダム探索法RasID-Dと最適化問題への適用
  • テキオウテキ リサン ランダム タンサクホウ RasID D ト サイテキカ モンダイ エ ノ テキヨウ
  • Discrete Random Search Method ^|^ldquo;RasID-D^|^rdquo; for Optimization Problems

Search this article

Abstract

In this paper, a new algorithm for discrete optimization problems is proposed. The algorithm is called “Random Search Method with Intensification and Diversification - Discrete Version ‘RasID-D’. In intensification phase, RasID-D searches the neighborhood with small range, while in diversification phase, searches the large neighborhood. Therefore, RasID-D can search good solutions rapidly and can escape from local minimum. Simulation studies show that RasID-D is more useful and effective than the conventional methods for a certain discrete optimization problems.

Journal

Citations (1)*help

See more

References(3)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top