New Encoding Method of Parameter for Dynamic Encoding Algorithm for Searches (DEAS)

この論文にアクセスする

この論文をさがす

著者

    • PARK Youngsu
    • Division of Electrical and Computer Engineering, Pohang University of Science and Technology (POSTETH)
    • KIM Johwan
    • Department of Electronics Engineering, Dong-A University
    • KIM Sang Woo
    • Division of Electrical and Computer Engineering, Pohang University of Science and Technology (POSTETH)

抄録

The dynamic encoding algorithm for searches (DEAS) is a recently developed algorithm that comprises a series of global optimization methods based on variable-length binary strings that represent real variables. It has been successfully applied to various optimization problems, exhibiting outstanding search efficiency and accuracy. Because DEAS manages binary strings or matrices, the decoding rules applied to the binary strings and the algorithm's structure determine the aspects of local search. The decoding rules used thus far in DEAS have some drawbacks in terms of efficiency and mathematical analysis. This paper proposes a new decoding rule and applies it to univariate DEAS (uDEAS), validating its performance against several benchmark functions. The overall optimization results of the modified uDEAS indicate that it outperforms other metaheuristic methods and obviously improves upon older versions of DEAS series.

収録刊行物

  • IEICE transactions on fundamentals of electronics, communications and computer sciences

    IEICE transactions on fundamentals of electronics, communications and computer sciences 94(9), 1804-1816, 2011-09-01

    一般社団法人 電子情報通信学会

参考文献:  30件中 1-30件 を表示

各種コード

  • NII論文ID(NAID)
    10030190771
  • NII書誌ID(NCID)
    AA10826239
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    09168508
  • データ提供元
    CJP書誌  J-STAGE 
ページトップへ