Nearest neighbor evolutionary algorithm for constrained optimization problem

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

3 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publication2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages2335-2342
Publication statusPublished - 2008

Conference

Title2008 IEEE Congress on Evolutionary Computation, CEC 2008
LocationHong Kong Convention and Exhibition Centre
PlaceChina
CityHong Kong
Period1 - 6 June 2008

Abstract

Although there exist a lot of approaches to solve constrained optimization problem, few of them makes use of the knowledge obtained in the searching process. In the paper, a new algorithm called nearest neighbor evolutionary algorithm (NNE) is proposed to solve the constrained optimization problem. NNE not only performs global search and local search in the searching process, but also considers the knowledge obtained in the searching process. NNE also avail itself of the elitist strategy and keeps the best individuals for the next generation. The results in the experiments show that NNE not only achieves good performance in a lot of constrained optimization problems, but also outperforms most of state-ofart approaches in most of constrained optimization problems, such as ASCHEA and SEMS. © 2008 IEEE.

Citation Format(s)

Nearest neighbor evolutionary algorithm for constrained optimization problem. / Yu, Zhiwen; Wang, Dingwen; Wong, Hau-San.
2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 2335-2342 4631109.

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review