arrow
返回

A fast differential evolution algorithm using k-Nearest Neighbour predictor

delete2011-04-01
delete30
PRE
AI
Y
Yang Liu *
F
Fan Sun
DOI:10.1016/j.eswa.2010.09.092delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Genetic algorithms (GAS), particle swarm optimisation (PSO) and differential evolution (DE) have proven to be successful in engineering optimisation problems. The limitation of using these tools is their expensive computational requirement. The optimisation process usually needs to run the numerical model and evaluate the objective function thousands of times before converging to an acceptable solution. However, in real world applications, there is simply not enough time and resources to perform such a huge number of model runs. In this study, a computational framework, known as DE-kNN, is presented for solving computationally expensive optimisation problems. The concept of DE-kNN will be demonstrated via one novel approximate model using k-Nearest Neighbour (kNN) predictor. We describe the performance of DE and DE-kNN when applied to the optimisation of a test function. The simulation results suggest that the proposed optimisation framework is able to achieve good solutions as well as provide considerable savings of the function calls compared to DE algorithm. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Differential evolution algorithm
k-Nearest Neighbour
Meta-model
Optimisation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
2.9W
被引数:
10.2W

机构

H
Heriot Watt University
学者数:
6.0K
论文数: 6.5K
被引数: 57
U
University of East Anglia
学者数:
9.6K
论文数: 1.0W
被引数: 1.8W
引用论文

引用论文

Structures and Architecture
err
IF0
err2013-06-27
err0
errOAAI
err
err分享
err收藏
没有更多内容