Cellular Harmony Search for Optimization Problems

Structured population in evolutionary algorithms (EAs) is an important research track where an individual only interacts with its neighboring individuals in the breeding step. The main rationale behind this is to provide a high level of diversity to overcome the genetic drift. Cellular automata co...

Full description

Bibliographic Details
Main Authors: Al-Betar, Mohammed Azmi, Khader, Ahamad Tajudin, Awadallah, Mohammed A., Alawan, Mahmmoud Hafsaldin, Belal, Zaqaibeh
Format: Article
Language:English
Published: Hindawi Publishing Corporation 2013
Subjects:
Online Access:http://eprints.usm.my/38421/
http://eprints.usm.my/38421/1/Cellular_Harmony_Search_for_Optimization_Problems.pdf
_version_ 1848878464637075456
author Al-Betar, Mohammed Azmi
Khader, Ahamad Tajudin
Awadallah, Mohammed A.
Alawan, Mahmmoud Hafsaldin
Belal, Zaqaibeh
author_facet Al-Betar, Mohammed Azmi
Khader, Ahamad Tajudin
Awadallah, Mohammed A.
Alawan, Mahmmoud Hafsaldin
Belal, Zaqaibeh
author_sort Al-Betar, Mohammed Azmi
building USM Institutional Repository
collection Online Access
description Structured population in evolutionary algorithms (EAs) is an important research track where an individual only interacts with its neighboring individuals in the breeding step. The main rationale behind this is to provide a high level of diversity to overcome the genetic drift. Cellular automata concepts have been embedded to the process of EA in order to provide a decentralized method in order to preserve the population structure. Harmony search (HS) is a recent EA that considers the whole individuals in the breeding step. In this paper, the cellular automata concepts are embedded into the HS algorithm to come up with a new version called cellular harmony search (cHS). In cHS, the population is arranged as a two-dimensional toroidal grid, where each individual in the grid is a cell and only interacts with its neighbors.Thememory consideration and population update aremodified according to cellular EA theory. The experimental results using benchmark functions show that embedding the cellular automata concepts with HS processes directly affects the performance. Finally, a parameter sensitivity analysis of the cHS variation is analyzed and a comparative evaluation shows the success of cHS.
first_indexed 2025-11-15T17:31:45Z
format Article
id usm-38421
institution Universiti Sains Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T17:31:45Z
publishDate 2013
publisher Hindawi Publishing Corporation
recordtype eprints
repository_type Digital Repository
spelling usm-384212019-04-18T02:22:11Z http://eprints.usm.my/38421/ Cellular Harmony Search for Optimization Problems Al-Betar, Mohammed Azmi Khader, Ahamad Tajudin Awadallah, Mohammed A. Alawan, Mahmmoud Hafsaldin Belal, Zaqaibeh QA75.5-76.95 Electronic computers. Computer science Structured population in evolutionary algorithms (EAs) is an important research track where an individual only interacts with its neighboring individuals in the breeding step. The main rationale behind this is to provide a high level of diversity to overcome the genetic drift. Cellular automata concepts have been embedded to the process of EA in order to provide a decentralized method in order to preserve the population structure. Harmony search (HS) is a recent EA that considers the whole individuals in the breeding step. In this paper, the cellular automata concepts are embedded into the HS algorithm to come up with a new version called cellular harmony search (cHS). In cHS, the population is arranged as a two-dimensional toroidal grid, where each individual in the grid is a cell and only interacts with its neighbors.Thememory consideration and population update aremodified according to cellular EA theory. The experimental results using benchmark functions show that embedding the cellular automata concepts with HS processes directly affects the performance. Finally, a parameter sensitivity analysis of the cHS variation is analyzed and a comparative evaluation shows the success of cHS. Hindawi Publishing Corporation 2013 Article PeerReviewed application/pdf en http://eprints.usm.my/38421/1/Cellular_Harmony_Search_for_Optimization_Problems.pdf Al-Betar, Mohammed Azmi and Khader, Ahamad Tajudin and Awadallah, Mohammed A. and Alawan, Mahmmoud Hafsaldin and Belal, Zaqaibeh (2013) Cellular Harmony Search for Optimization Problems. Journal of Applied Mathematics, 2013 (139464). pp. 1-20. ISSN 1110-757X http://dx.doi.org/10.1155/2013/139464
spellingShingle QA75.5-76.95 Electronic computers. Computer science
Al-Betar, Mohammed Azmi
Khader, Ahamad Tajudin
Awadallah, Mohammed A.
Alawan, Mahmmoud Hafsaldin
Belal, Zaqaibeh
Cellular Harmony Search for Optimization Problems
title Cellular Harmony Search for Optimization Problems
title_full Cellular Harmony Search for Optimization Problems
title_fullStr Cellular Harmony Search for Optimization Problems
title_full_unstemmed Cellular Harmony Search for Optimization Problems
title_short Cellular Harmony Search for Optimization Problems
title_sort cellular harmony search for optimization problems
topic QA75.5-76.95 Electronic computers. Computer science
url http://eprints.usm.my/38421/
http://eprints.usm.my/38421/
http://eprints.usm.my/38421/1/Cellular_Harmony_Search_for_Optimization_Problems.pdf