A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem
Taking inspiration from an organizational evolutionary algorithm for numerical optimization, this paper designs a kind of dynamic population and combining evolutionary operators to form a novel algorithm, a cooperative coevolutionary cuckoo search algorithm (CCCS), for solving both unconstrained, co...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2013/912056 |
id |
doaj-4c5cd83a9c7f41a78365dac19d9463dd |
---|---|
record_format |
Article |
spelling |
doaj-4c5cd83a9c7f41a78365dac19d9463dd2020-11-24T23:13:39ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/912056912056A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization ProblemHongqing Zheng0Yongquan Zhou1Guangxi Key Laboratory of Hybrid Computation and Integrated Circuit Design Analysis, Nanning, Guangxi 530006, ChinaGuangxi Key Laboratory of Hybrid Computation and Integrated Circuit Design Analysis, Nanning, Guangxi 530006, ChinaTaking inspiration from an organizational evolutionary algorithm for numerical optimization, this paper designs a kind of dynamic population and combining evolutionary operators to form a novel algorithm, a cooperative coevolutionary cuckoo search algorithm (CCCS), for solving both unconstrained, constrained optimization and engineering problems. A population of this algorithm consists of organizations, and an organization consists of dynamic individuals. In experiments, fifteen unconstrained functions, eleven constrained functions, and two engineering design problems are used to validate the performance of CCCS, and thorough comparisons are made between the CCCS and the existing approaches. The results show that the CCCS obtains good performance in the solution quality. Moreover, for the constrained problems, the good performance is obtained by only incorporating a simple constraint handling technique into the CCCS. The results show that the CCCS is quite robust and easy to use.http://dx.doi.org/10.1155/2013/912056 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Hongqing Zheng Yongquan Zhou |
spellingShingle |
Hongqing Zheng Yongquan Zhou A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem Journal of Applied Mathematics |
author_facet |
Hongqing Zheng Yongquan Zhou |
author_sort |
Hongqing Zheng |
title |
A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem |
title_short |
A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem |
title_full |
A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem |
title_fullStr |
A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem |
title_full_unstemmed |
A Cooperative Coevolutionary Cuckoo Search Algorithm for Optimization Problem |
title_sort |
cooperative coevolutionary cuckoo search algorithm for optimization problem |
publisher |
Hindawi Limited |
series |
Journal of Applied Mathematics |
issn |
1110-757X 1687-0042 |
publishDate |
2013-01-01 |
description |
Taking inspiration from an organizational evolutionary algorithm for numerical optimization, this paper designs a kind of dynamic population and combining evolutionary operators to form a novel algorithm, a cooperative coevolutionary cuckoo search algorithm (CCCS), for solving both unconstrained, constrained optimization and engineering problems. A population of this algorithm consists of organizations, and an organization consists of dynamic individuals. In experiments, fifteen unconstrained functions, eleven constrained functions, and two engineering design problems are used to validate the performance of CCCS, and thorough comparisons are made between the CCCS and the existing approaches. The results show that the CCCS obtains good performance in the solution quality. Moreover, for the constrained problems, the good performance is obtained by only incorporating a simple constraint handling technique into the CCCS. The results show that the CCCS is quite robust and easy to use. |
url |
http://dx.doi.org/10.1155/2013/912056 |
work_keys_str_mv |
AT hongqingzheng acooperativecoevolutionarycuckoosearchalgorithmforoptimizationproblem AT yongquanzhou acooperativecoevolutionarycuckoosearchalgorithmforoptimizationproblem AT hongqingzheng cooperativecoevolutionarycuckoosearchalgorithmforoptimizationproblem AT yongquanzhou cooperativecoevolutionarycuckoosearchalgorithmforoptimizationproblem |
_version_ |
1725597299812335616 |