Chaotic cuckoo search
- Publisher:
- SPRINGER
- Publication Type:
- Journal Article
- Citation:
- Soft Computing, 2016, 20, (9), pp. 3349-3362
- Issue Date:
- 2016-09-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
Wang2016_Article_ChaoticCuckooSearch.pdf | Published version | 794.4 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
This study proposes a novel chaotic cuckoo search (CCS) optimization method by incorporating chaotic theory into cuckoo search (CS) algorithm. In CCS, chaos characteristics are combined with the CS with the intention of further enhancing its performance. Further, the elitism scheme is incorporated into CCS to preserve the best cuckoos. In CCS method, 12 chaotic maps are applied to tune the step size of the cuckoos used in the original CS method. Twenty-seven benchmark functions and an engineering case are utilized to investigate the efficiency of CCS. The results clearly demonstrate that the performance of CCS together with a suitable chaotic map is comparable as well as superior to that of the CS and other metaheuristic algorithms.
Please use this identifier to cite or link to this item: