.png){kind=icon}
.png){kind=icon}
Return
Buffered local search for efficient memetic agent-based continuous optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2017.02.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a memetic search in classic and agent-based evolutionary algorithms are discussed. A local search is applied in an innovative way; namely, during an agent's life and in a classic way during the course of reproduction. Moreover, in order to efficiently utilize the computing power available, an efficient mechanism based on caching parts of the fitness function in the local search is proposed. The experimental results obtained for selected high-dimensional benchmark functions (with 5000 dimensions) show the apparent advantage of the proposed mechanism. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Memetic algorithms
Agent-based computing
Continuous optimization
Meta-heuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K