A memetic algorithm with non gradient-based local search assisted by a meta-model

13Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The development of multi-objective evolutionary algorithms (MOEAs) assisted by meta-models has increased in the last few years. However, the use of local search engines assisted by meta-models for multi-objective optimization has been less common in the specialized literature. In this paper, we propose the use of a local search mechanism which is assisted by a meta-model based on support vector machines. The local search mechanism adopts a free-derivative mathematical programming technique and consists of two main phases: the first generates approximations of the Pareto optimal set. Such solutions are obtained by solving a set of aggregating functions which are defined by different weighted vectors. The second phase generates new solutions departing from those obtained during the first phase. The solutions found by the local search mechanism are incorporated into the evolutionary process of our MOEA. Our experiments show that our proposed approach can produce good quality results with a budget of only 1,000 fitness function evaluations in test problems having between 10 and 30 decision variables. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Martínez, S. Z., & Coello Coello, C. A. (2010). A memetic algorithm with non gradient-based local search assisted by a meta-model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6238 LNCS, pp. 576–585). https://doi.org/10.1007/978-3-642-15844-5_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free