|
 |
| |
 |
Deas is a branch of nonlinear optimization
algorithms. The principle of DEAS is based on the distinct
properties of binary strings. If a binary digit, 0 or
1, is appended to any binary string as a least significant
bit (LSB), the decoded real number of a new binary string
decreases for 0, and increases for 1 compared with that
of the original binary string. Moreover, if a binary string
undergoes increment addition or decrement subtraction,
the real number of each processed string increases or
decreases equidistantly. These two characteristics of
binary strings are adopted for the determination of a
search direction and a step length in DEAS.
|
|
| |
|
|
|
Fig.1 Search aspect of DEAS in a
two-dimensional problem |
|
| |
|
|
| |
|
Copyright
¨Ï2003 by DEAS. All rights reserved...... |
|
 |
