A differential evolution algorithm with a variable neighborhood search for constrained function optimization

Loading...
Publication Logo

Date

2015

Authors

M. Fatih Tasgetiren
Ponnuthurai Nagaratnam Suganthan
Sel Ozcan
Damla Kizilay

Journal Title

Journal ISSN

Volume Title

Publisher

Springer Verlag service@springer.de

Open Access Color

Green Open Access

Yes

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Top 10%
Influence
Average
Popularity
Average

Research Projects

Journal Issue

Abstract

In this paper a differential evolution algorithm based on a variable neighborhood search algorithm (DE_VNS) is proposed in order to solve the constrained real-parameter optimization problems. The performance of DE algorithm depends on the mutation strategies crossover operators and control parameters. As a result a DE_VNS algorithm that can employ multiple mutation operators in its VNS loops is proposed in order to further enhance the solution quality. We also present an idea of injecting some good dimensional values to the trial individual through the injection procedure. In addition we also present a diversification procedure that is based on the inversion of the target individuals and injection of some good dimensional values from promising areas in the population by tournament selection. The computational results show that the simple DE_VNS algorithm was very competitive to some of the best performing algorithms from the literature. © 2015 Elsevier B.V. All rights reserved.

Description

Keywords

Fields of Science

Citation

WoS Q

Scopus Q

OpenCitations Logo
OpenCitations Citation Count
6

Source

Adaptation, Learning, and Optimization

Volume

18

Issue

Start Page

171

End Page

184
PlumX Metrics
Citations

CrossRef : 5

Scopus : 9

Captures

Mendeley Readers : 9

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
2.3899

Sustainable Development Goals