12.07.2013 Views

Improved ant colony optimization algorithms for continuous ... - CoDE

Improved ant colony optimization algorithms for continuous ... - CoDE

Improved ant colony optimization algorithms for continuous ... - CoDE

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4.4 Per<strong>for</strong>mance Evaluation of ACOMV-o and ACOMV-c 39<br />

X2<br />

−2 0 2 4 6<br />

Natural<br />

−2 0 2 4 6<br />

X1<br />

X2<br />

−2 0 2 4 6<br />

Random<br />

−2 0 2 4 6<br />

Figure 4.3: Randomly rotated ellipsoid function (β = 5) with discrete variable<br />

x1 ∈ T, |T| = t = 30. The left plot presents the case in which the<br />

natural ordering of the intervals is used, while the right one presents the<br />

case in which a random ordering is used.<br />

characteristics such as non-separable, ill-conditioned and multi-modal. Nonseparate<br />

functions often exhibit intricate dependencies between decision<br />

variables. Ill-conditioned functions, like fRosenbrockMV , often lead to premature<br />

convergence. Multi-modal functions, like fAckleyMV , fRastriginMV and<br />

fGriewankMV , serves to find effectively a search globally in a highly multimodal<br />

topography [43]. For example, in the <strong>continuous</strong> study of [8], we<br />

can see PSO per<strong>for</strong>ms well on the separable problems. However, on nonseparable<br />

problems, PSO exhibits a strong per<strong>for</strong>mance decline, and PSO<br />

also per<strong>for</strong>ms very poorly even on moderately ill-conditioned functions, let<br />

alone in mixed-variable <strong>optimization</strong> cases. There<strong>for</strong>e, the proposed artificial<br />

mixed-variable benchmark functions are expected to lead a challenge<br />

<strong>for</strong> different mixed-variable <strong>optimization</strong> <strong>algorithms</strong>. In <strong>ant</strong>her aspect, the<br />

flexible discrete intervals and dimensions of the proposed benchmark functions<br />

are not only helpful <strong>for</strong> investigating the per<strong>for</strong>mance scalability of<br />

mixed-variable <strong>optimization</strong> <strong>algorithms</strong>, but also provide a convenient environment<br />

<strong>for</strong> automatic parameter tuning in mixed-variable <strong>optimization</strong><br />

solvers generalization, thereby facing unseen real-world complex engineering<br />

<strong>optimization</strong> problems.<br />

4.4 Per<strong>for</strong>mance Evaluation of ACOMV-o and<br />

ACOMV-c<br />

ACOMV-o and ACOMV-c represent a <strong>continuous</strong> relaxation approach and a<br />

native mixed-variable <strong>optimization</strong> approach on handling discrete variables,<br />

X1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!