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 conc...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohammed Azmi Al-Betar, Ahamad Tajudin Khader, Mohammed A. Awadallah, Mahmmoud Hafsaldin Alawan, Belal Zaqaibeh
Format: Article
Language:English
Published: Wiley 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/139464
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832561978474758144
author Mohammed Azmi Al-Betar
Ahamad Tajudin Khader
Mohammed A. Awadallah
Mahmmoud Hafsaldin Alawan
Belal Zaqaibeh
author_facet Mohammed Azmi Al-Betar
Ahamad Tajudin Khader
Mohammed A. Awadallah
Mahmmoud Hafsaldin Alawan
Belal Zaqaibeh
author_sort Mohammed Azmi Al-Betar
collection DOAJ
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. The memory consideration and population update are modified 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.
format Article
id doaj-art-6618a52ed2fa41d6adac45731195dbd2
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2013-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-6618a52ed2fa41d6adac45731195dbd22025-02-03T01:23:43ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/139464139464Cellular Harmony Search for Optimization ProblemsMohammed Azmi Al-Betar0Ahamad Tajudin Khader1Mohammed A. Awadallah2Mahmmoud Hafsaldin Alawan3Belal Zaqaibeh4School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, MalaysiaSchool of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, MalaysiaSchool of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, MalaysiaSchool of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, MalaysiaDepartment of Computer Science, Jadara University, P.O. Box 733, Irbid, JordanStructured 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. The memory consideration and population update are modified 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.http://dx.doi.org/10.1155/2013/139464
spellingShingle Mohammed Azmi Al-Betar
Ahamad Tajudin Khader
Mohammed A. Awadallah
Mahmmoud Hafsaldin Alawan
Belal Zaqaibeh
Cellular Harmony Search for Optimization Problems
Journal of Applied Mathematics
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
url http://dx.doi.org/10.1155/2013/139464
work_keys_str_mv AT mohammedazmialbetar cellularharmonysearchforoptimizationproblems
AT ahamadtajudinkhader cellularharmonysearchforoptimizationproblems
AT mohammedaawadallah cellularharmonysearchforoptimizationproblems
AT mahmmoudhafsaldinalawan cellularharmonysearchforoptimizationproblems
AT belalzaqaibeh cellularharmonysearchforoptimizationproblems