Clustering Search and Variable Mesh Algorithms for continuous optimization

Yasel Costa

doi:10.1016/j.eswa.2014.08.040

Clustering Search and Variable Mesh Algorithms for continuous optimization

2015-02-01

4

PRE

AI

Alexandre Cêsar Muniz de Oliveira

A

Antônio Augusto Chaves

L

Luiz Antônio Nogueira Lorena

DOI：10.1016/j.eswa.2014.08.040

原文链接

原文求助

摘要

En 中文

The hybridization of population-based meta-heuristics and local search strategies is an effective algorithmic proposal for solving complex continuous optimization problems. Such hybridization becomes much more effective when the local search heuristics are applied in the most promising areas of the solution space. This paper presents a hybrid method based on Clustering Search (CS) to solve continuous optimization problems. The CS divides the search space in clusters, which are composed of solutions generated by a population meta-heuristic, called Variable Mesh Optimization. Each cluster is explored further with local search procedures. Computational results considering a benchmark of multimodal continuous functions are presented. (C) 2014 Elsevier Ltd. All rights reserved.

Keyword:

Continuous function optimization

Hybrid methods

Clustering Search and Variable Mesh Algorithms for continuous optimization

摘要

AI总结

期刊

机构