Five elements algorithm
by Yan Hong Cui
24 Jun 2008
(Updated 04 Nov 2008)
we propose a new global searching optimization algorithm, termed as harmony elements algorithm. Trad
|
Watch this File
|
| File Information |
| Description |
The harmony elements algorithm is proposed as a global searching technique of numerical computing which inspired by the old Chinese philosophy: Doctrine of Wu Xing, the five color theorem, and the Hoffman-Singleton graph. According to operation of overcoming and generating policy, each element in individuals altered extremely rapid during algorithm running period. The extreme rapid changing of individuals oriented by rule of deduction and generation, so the algorithm could made function quickly reach to the best solution. Inspired by five color theorem, we choose five elements 0s, 1s, 2s, 3s, and 4s consisting of each individual strings represent as candidate solutions. The algorithm method which generated from Hoffman-Singleton graph made whole algorithm could be globally covering every existing candidate solutions during algorithm running, so the algorithm would not be able to trap into local optimization value. |
| MATLAB release |
MATLAB 7.4 (R2007a)
|
| Other requirements |
No |
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Comments and Ratings (4) |
| 25 Jun 2008 |
John D'Errico
|
|
|
| 26 Jun 2008 |
Yan Hong Cui
|
|
|
| 26 Jun 2008 |
Yan Hong Cui
|
|
|
| 26 Jun 2008 |
John D'Errico
|
|
|
| Updates |
| 04 Nov 2008 |
update |
|
Contact us at files@mathworks.com