Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations

Moaath Shatnawi, Mohammad Faidzul Nasrudin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Cuckoo Search (CS) is a meta-heuristic optimization algorithm that is inspired by breeding strategy of some cuckoo species that involves laying of eggs in the nests of other host birds. Like other population based optimization algorithms, the initial positions of the population, in the case of CS are host nests, will influence the performance of the searching. Based on this fact, we believe that the CS algorithm can further be improved by strategically selecting the starting positions of the nests instead of the standard random selection. This work suggests the use of positions generated from the Centroidal Voronoi Tessellations (CVT) as the starting points for the nests. A CVT is a Voronoi tessellation of a set such that the generators of the Voronoi sets are simultaneously their centers of mass. The CVT will initially present the problem space in equally distributed manner. The performance of CS algorithm initialized using CVT is compared with those generated from the standard CS algorithm on several benchmark test functions. The results show that the initialization of CS algorithm using the CVT improves its performance especially for benchmark functions with high-dimensional input spaces.

Original languageEnglish
Title of host publicationProceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011
Pages40-45
Number of pages6
DOIs
Publication statusPublished - 2011
Event2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011 - Malacca
Duration: 5 Dec 20118 Dec 2011

Other

Other2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011
CityMalacca
Period5/12/118/12/11

Fingerprint

Birds

Keywords

  • Centroidal Voronoi Tesselaations (CVT)
  • Cuckoo Search (CS)
  • Meta-heuristic
  • Optimization algorithm

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Shatnawi, M., & Nasrudin, M. F. (2011). Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations. In Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011 (pp. 40-45). [6122077] https://doi.org/10.1109/HIS.2011.6122077

Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations. / Shatnawi, Moaath; Nasrudin, Mohammad Faidzul.

Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011. 2011. p. 40-45 6122077.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shatnawi, M & Nasrudin, MF 2011, Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations. in Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011., 6122077, pp. 40-45, 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011, Malacca, 5/12/11. https://doi.org/10.1109/HIS.2011.6122077
Shatnawi M, Nasrudin MF. Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations. In Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011. 2011. p. 40-45. 6122077 https://doi.org/10.1109/HIS.2011.6122077
Shatnawi, Moaath ; Nasrudin, Mohammad Faidzul. / Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations. Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011. 2011. pp. 40-45
@inproceedings{6eee1f74d2b34e3c8e5c8fc443485723,
title = "Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations",
abstract = "Cuckoo Search (CS) is a meta-heuristic optimization algorithm that is inspired by breeding strategy of some cuckoo species that involves laying of eggs in the nests of other host birds. Like other population based optimization algorithms, the initial positions of the population, in the case of CS are host nests, will influence the performance of the searching. Based on this fact, we believe that the CS algorithm can further be improved by strategically selecting the starting positions of the nests instead of the standard random selection. This work suggests the use of positions generated from the Centroidal Voronoi Tessellations (CVT) as the starting points for the nests. A CVT is a Voronoi tessellation of a set such that the generators of the Voronoi sets are simultaneously their centers of mass. The CVT will initially present the problem space in equally distributed manner. The performance of CS algorithm initialized using CVT is compared with those generated from the standard CS algorithm on several benchmark test functions. The results show that the initialization of CS algorithm using the CVT improves its performance especially for benchmark functions with high-dimensional input spaces.",
keywords = "Centroidal Voronoi Tesselaations (CVT), Cuckoo Search (CS), Meta-heuristic, Optimization algorithm",
author = "Moaath Shatnawi and Nasrudin, {Mohammad Faidzul}",
year = "2011",
doi = "10.1109/HIS.2011.6122077",
language = "English",
isbn = "9781457721502",
pages = "40--45",
booktitle = "Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011",

}

TY - GEN

T1 - Starting configuration of cuckoo search algorithm using centroidal voronoi tessellations

AU - Shatnawi, Moaath

AU - Nasrudin, Mohammad Faidzul

PY - 2011

Y1 - 2011

N2 - Cuckoo Search (CS) is a meta-heuristic optimization algorithm that is inspired by breeding strategy of some cuckoo species that involves laying of eggs in the nests of other host birds. Like other population based optimization algorithms, the initial positions of the population, in the case of CS are host nests, will influence the performance of the searching. Based on this fact, we believe that the CS algorithm can further be improved by strategically selecting the starting positions of the nests instead of the standard random selection. This work suggests the use of positions generated from the Centroidal Voronoi Tessellations (CVT) as the starting points for the nests. A CVT is a Voronoi tessellation of a set such that the generators of the Voronoi sets are simultaneously their centers of mass. The CVT will initially present the problem space in equally distributed manner. The performance of CS algorithm initialized using CVT is compared with those generated from the standard CS algorithm on several benchmark test functions. The results show that the initialization of CS algorithm using the CVT improves its performance especially for benchmark functions with high-dimensional input spaces.

AB - Cuckoo Search (CS) is a meta-heuristic optimization algorithm that is inspired by breeding strategy of some cuckoo species that involves laying of eggs in the nests of other host birds. Like other population based optimization algorithms, the initial positions of the population, in the case of CS are host nests, will influence the performance of the searching. Based on this fact, we believe that the CS algorithm can further be improved by strategically selecting the starting positions of the nests instead of the standard random selection. This work suggests the use of positions generated from the Centroidal Voronoi Tessellations (CVT) as the starting points for the nests. A CVT is a Voronoi tessellation of a set such that the generators of the Voronoi sets are simultaneously their centers of mass. The CVT will initially present the problem space in equally distributed manner. The performance of CS algorithm initialized using CVT is compared with those generated from the standard CS algorithm on several benchmark test functions. The results show that the initialization of CS algorithm using the CVT improves its performance especially for benchmark functions with high-dimensional input spaces.

KW - Centroidal Voronoi Tesselaations (CVT)

KW - Cuckoo Search (CS)

KW - Meta-heuristic

KW - Optimization algorithm

UR - http://www.scopus.com/inward/record.url?scp=84856689695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856689695&partnerID=8YFLogxK

U2 - 10.1109/HIS.2011.6122077

DO - 10.1109/HIS.2011.6122077

M3 - Conference contribution

AN - SCOPUS:84856689695

SN - 9781457721502

SP - 40

EP - 45

BT - Proceedings of the 2011 11th International Conference on Hybrid Intelligent Systems, HIS 2011

ER -