A self-adaptive binary differential evolution algorithm for large scale binary optimization problems
This study proposes a new self-adaptive binary variant of a differential evolution algorithm, based on measure of dissimilarity and named SabDE. It uses an adaptive mechanism for selecting how new trial solutions are generated, and a chaotic process for adapting parameter values. SabDE is compared a...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
Elsevier Inc.
2016
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utm.my/id/eprint/71960/ https://www.scopus.com/inward/record.uri?eid=2-s2.0-84975795338&doi=10.1016%2fj.ins.2016.05.037&partnerID=40&md5=1d8f502e2d8139abbf69da217b115b32 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | This study proposes a new self-adaptive binary variant of a differential evolution algorithm, based on measure of dissimilarity and named SabDE. It uses an adaptive mechanism for selecting how new trial solutions are generated, and a chaotic process for adapting parameter values. SabDE is compared against a number of existing state of the art algorithms, on a set of benchmark problems including high dimensional knapsack problems with up to 10,000 dimensions as well as on the 15 learning based problems of the Congress on Evolutionary Computation (CEC 2015). Experimental results reveal that the proposed algorithm performs competitively and in some cases is superior to the existing algorithms. |
|---|