Smallest-small-world cellular harmony search for optimization of unconstrained benchmark problems

Sung Soo Im, Do Guen Yoo, Joong Hoon Kim

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS) algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.

Original languageEnglish
Article number635608
JournalJournal of Applied Mathematics
Volume2013
DOIs
Publication statusPublished - 2013 Dec 1

Fingerprint

Harmony Search
Small World
Search Algorithm
Benchmark
Optimization
Population Structure
Clustering Coefficient
Small-world Network
Small-world networks
Topological Structure
Path Length
Hybrid Method
Cellular Automata
Exploitation
Cellular automata
Optimization Problem
Evaluate
Data storage equipment

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

Smallest-small-world cellular harmony search for optimization of unconstrained benchmark problems. / Im, Sung Soo; Yoo, Do Guen; Kim, Joong Hoon.

In: Journal of Applied Mathematics, Vol. 2013, 635608, 01.12.2013.

Research output: Contribution to journalArticle

@article{87b8087f86964efd9b16dbf32d4c73fa,
title = "Smallest-small-world cellular harmony search for optimization of unconstrained benchmark problems",
abstract = "We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS) algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.",
author = "Im, {Sung Soo} and Yoo, {Do Guen} and Kim, {Joong Hoon}",
year = "2013",
month = "12",
day = "1",
doi = "10.1155/2013/635608",
language = "English",
volume = "2013",
journal = "Journal of Applied Mathematics",
issn = "1110-757X",
publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - Smallest-small-world cellular harmony search for optimization of unconstrained benchmark problems

AU - Im, Sung Soo

AU - Yoo, Do Guen

AU - Kim, Joong Hoon

PY - 2013/12/1

Y1 - 2013/12/1

N2 - We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS) algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.

AB - We presented a new hybrid method that combines cellular harmony search algorithms with the Smallest-Small-World theory. A harmony search (HS) algorithm is based on musical performance processes that occur when a musician searches for a better state of harmony. Harmony search has successfully been applied to a wide variety of practical optimization problems. Most of the previous researches have sought to improve the performance of the HS algorithm by changing the pitch adjusting rate and harmony memory considering rate. However, there has been a lack of studies to improve the performance of the algorithm by the formation of population structures. Therefore, we proposed an improved HS algorithm that uses the cellular automata formation and the topological structure of Smallest-Small-World network. The improved HS algorithm has a high clustering coefficient and a short characteristic path length, having good exploration and exploitation efficiencies. Nine benchmark functions were applied to evaluate the performance of the proposed algorithm. Unlike the existing improved HS algorithm, the proposed algorithm is expected to have improved algorithmic efficiency from the formation of the population structure.

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

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

U2 - 10.1155/2013/635608

DO - 10.1155/2013/635608

M3 - Article

AN - SCOPUS:84893712052

VL - 2013

JO - Journal of Applied Mathematics

JF - Journal of Applied Mathematics

SN - 1110-757X

M1 - 635608

ER -