By Topic

Adaptive cluster covering and evolutionary approach: comparison, differences and similarities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Solomatine, D. ; UNESCO-IHE Inst. for Water Educ., Delft, Netherlands

In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Paper gives a brief overview of GO methods, with the special attention to principles of clustering, covering and evolution. Nine algorithms, including a simple GA, are compared in terms of effectiveness (accuracy), efficiency (number of the needed function evaluations) and reliability on several problems. Particular features of adaptive cluster covering algorithm (ACCO) leading to its high efficiency are analyzed and compared with those of an evolutionary approach. The possibilities of (partially) attributing ACCO and other GO algorithms to the group of EA are considered.

Published in:

Evolutionary Computation, 2005. The 2005 IEEE Congress on  (Volume:3 )

Date of Conference:

2-5 Sept. 2005