A fast differential evolution algorithm using k-Nearest Neighbour predictor

Authors:
Yang Liu;Fan Sun
Affiliations:
School of the Built Environment, Heriot-Watt University, Edinburgh EH14 4AS, UK;Norwich Business School, University of East Anglia, UK
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 2
Cited 4

A comprehensive survey of fitness approximation in evolutionary computation

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Automatic calibration of a rainfall-runoff model using a fast and elitist multi-objective particle swarm algorithm

Expert Systems with Applications: An International Journal

Optimized distance metrics for differential evolution based nearest prototype classifier

Expert Systems with Applications: An International Journal
Modeling the leadership - project performance relation: radial basis function, Gaussian and Kriging methods as alternatives to linear regression

Expert Systems with Applications: An International Journal
Differential evolution based nearest prototype classifier with optimized distance measures for the features in the data sets

Expert Systems with Applications: An International Journal
Parameter estimation of a pressure swing adsorption model for air separation using multi-objective optimisation and support vector regression model

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

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.