Recurring Two-Stage Evolutionary Programming: A Novel Approach for Numeric Optimization

Research output: Contribution to journalArticle

Standard

Recurring Two-Stage Evolutionary Programming: A Novel Approach for Numeric Optimization. / Alam, MS; Islam, MM; Yao, Xin; Murase, K.

In: IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), Vol. 41, No. 5, 01.10.2011, p. 1352-1365.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Bibtex

@article{295ea43b4dbf42af865dbbb5e5048b1e,
title = "Recurring Two-Stage Evolutionary Programming: A Novel Approach for Numeric Optimization",
abstract = "In the application of evolutionary algorithms (EAs) to complex problem solving, it is essential to maintain proper balance between global exploration and local exploitation to achieve a good near-optimum solution to the problem. This paper presents a recurring two-stage evolutionary programming (RTEP) to balance the explorative and exploitative features of the conventional EAs. Unlike most previous works, RTEP is based on repeated and alternated execution of two different stages, namely, the exploration and exploitation stages, each with its own mutation operator, selection strategy, and explorative/exploitative objective. Both analytical and empirical studies have been carried out to understand the necessity of repeated and alternated exploration and exploitation operations in EAs. A suite of 48 benchmark numerical optimization problems has been used in the empirical studies. The experimental results show the remarkable effectiveness of the repeated exploration and exploitation operations employed by RTEP.",
author = "MS Alam and MM Islam and Xin Yao and K Murase",
year = "2011",
month = oct,
day = "1",
doi = "10.1109/TSMCB.2011.2144968",
language = "English",
volume = "41",
pages = "1352--1365",
journal = "IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)",
issn = "1083-4419",
publisher = "Institute of Electrical and Electronics Engineers (IEEE)",
number = "5",

}

RIS

TY - JOUR

T1 - Recurring Two-Stage Evolutionary Programming: A Novel Approach for Numeric Optimization

AU - Alam, MS

AU - Islam, MM

AU - Yao, Xin

AU - Murase, K

PY - 2011/10/1

Y1 - 2011/10/1

N2 - In the application of evolutionary algorithms (EAs) to complex problem solving, it is essential to maintain proper balance between global exploration and local exploitation to achieve a good near-optimum solution to the problem. This paper presents a recurring two-stage evolutionary programming (RTEP) to balance the explorative and exploitative features of the conventional EAs. Unlike most previous works, RTEP is based on repeated and alternated execution of two different stages, namely, the exploration and exploitation stages, each with its own mutation operator, selection strategy, and explorative/exploitative objective. Both analytical and empirical studies have been carried out to understand the necessity of repeated and alternated exploration and exploitation operations in EAs. A suite of 48 benchmark numerical optimization problems has been used in the empirical studies. The experimental results show the remarkable effectiveness of the repeated exploration and exploitation operations employed by RTEP.

AB - In the application of evolutionary algorithms (EAs) to complex problem solving, it is essential to maintain proper balance between global exploration and local exploitation to achieve a good near-optimum solution to the problem. This paper presents a recurring two-stage evolutionary programming (RTEP) to balance the explorative and exploitative features of the conventional EAs. Unlike most previous works, RTEP is based on repeated and alternated execution of two different stages, namely, the exploration and exploitation stages, each with its own mutation operator, selection strategy, and explorative/exploitative objective. Both analytical and empirical studies have been carried out to understand the necessity of repeated and alternated exploration and exploitation operations in EAs. A suite of 48 benchmark numerical optimization problems has been used in the empirical studies. The experimental results show the remarkable effectiveness of the repeated exploration and exploitation operations employed by RTEP.

U2 - 10.1109/TSMCB.2011.2144968

DO - 10.1109/TSMCB.2011.2144968

M3 - Article

C2 - 21609887

VL - 41

SP - 1352

EP - 1365

JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)

JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)

SN - 1083-4419

IS - 5

ER -