Application of new hybrid harmony search algorithms based on cellular automata theory for solving magic square problems

Do Guen Yoo, Ali Sadollah, Joong Hoon Kim, Ho Min Lee

Research output: Contribution to journalArticle

Abstract

Magic square construction is a complex and hard permutation problem of recreational combinatorics with a long history. The complexity level enhances rapidly when the number of magic squares increases with the order of magic square. This paper proposes two hybrid metaheuristic algorithms, so-called cellular harmony search (CHS) and smallest-small-world cellular harmony search (SSWCHS) for solving magic square problems. The inspiration of the CHS is based on the cellular automata (CA) formation, while the SSWCHS is inspired by the structure of smallest-small-world network (SSWN) and CA using the concept of HS. Numerical optimization results obtained are compared with different optimizers in terms of statistical results and number of found feasible solutions. Computational results show that the proposed hybrid optimizers are computationally effective and highly efficient for tackling magic square problems.

Original languageEnglish
Pages (from-to)245-253
Number of pages9
JournalAdvances in Intelligent Systems and Computing
Volume335
DOIs
Publication statusPublished - 2014

Fingerprint

Automata theory
Cellular automata
Small-world networks

Keywords

  • Combinatorial optimization
  • Feasibility problem
  • Harmony search
  • Magic square
  • Metaheuristics

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Application of new hybrid harmony search algorithms based on cellular automata theory for solving magic square problems. / Yoo, Do Guen; Sadollah, Ali; Kim, Joong Hoon; Lee, Ho Min.

In: Advances in Intelligent Systems and Computing, Vol. 335, 2014, p. 245-253.

Research output: Contribution to journalArticle

@article{564570912e024da489d2bdf7a27b2697,
title = "Application of new hybrid harmony search algorithms based on cellular automata theory for solving magic square problems",
abstract = "Magic square construction is a complex and hard permutation problem of recreational combinatorics with a long history. The complexity level enhances rapidly when the number of magic squares increases with the order of magic square. This paper proposes two hybrid metaheuristic algorithms, so-called cellular harmony search (CHS) and smallest-small-world cellular harmony search (SSWCHS) for solving magic square problems. The inspiration of the CHS is based on the cellular automata (CA) formation, while the SSWCHS is inspired by the structure of smallest-small-world network (SSWN) and CA using the concept of HS. Numerical optimization results obtained are compared with different optimizers in terms of statistical results and number of found feasible solutions. Computational results show that the proposed hybrid optimizers are computationally effective and highly efficient for tackling magic square problems.",
keywords = "Combinatorial optimization, Feasibility problem, Harmony search, Magic square, Metaheuristics",
author = "Yoo, {Do Guen} and Ali Sadollah and Kim, {Joong Hoon} and Lee, {Ho Min}",
year = "2014",
doi = "10.1007/978-81-322-2217-0_21",
language = "English",
volume = "335",
pages = "245--253",
journal = "Advances in Intelligent Systems and Computing",
issn = "2194-5357",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Application of new hybrid harmony search algorithms based on cellular automata theory for solving magic square problems

AU - Yoo, Do Guen

AU - Sadollah, Ali

AU - Kim, Joong Hoon

AU - Lee, Ho Min

PY - 2014

Y1 - 2014

N2 - Magic square construction is a complex and hard permutation problem of recreational combinatorics with a long history. The complexity level enhances rapidly when the number of magic squares increases with the order of magic square. This paper proposes two hybrid metaheuristic algorithms, so-called cellular harmony search (CHS) and smallest-small-world cellular harmony search (SSWCHS) for solving magic square problems. The inspiration of the CHS is based on the cellular automata (CA) formation, while the SSWCHS is inspired by the structure of smallest-small-world network (SSWN) and CA using the concept of HS. Numerical optimization results obtained are compared with different optimizers in terms of statistical results and number of found feasible solutions. Computational results show that the proposed hybrid optimizers are computationally effective and highly efficient for tackling magic square problems.

AB - Magic square construction is a complex and hard permutation problem of recreational combinatorics with a long history. The complexity level enhances rapidly when the number of magic squares increases with the order of magic square. This paper proposes two hybrid metaheuristic algorithms, so-called cellular harmony search (CHS) and smallest-small-world cellular harmony search (SSWCHS) for solving magic square problems. The inspiration of the CHS is based on the cellular automata (CA) formation, while the SSWCHS is inspired by the structure of smallest-small-world network (SSWN) and CA using the concept of HS. Numerical optimization results obtained are compared with different optimizers in terms of statistical results and number of found feasible solutions. Computational results show that the proposed hybrid optimizers are computationally effective and highly efficient for tackling magic square problems.

KW - Combinatorial optimization

KW - Feasibility problem

KW - Harmony search

KW - Magic square

KW - Metaheuristics

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

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

U2 - 10.1007/978-81-322-2217-0_21

DO - 10.1007/978-81-322-2217-0_21

M3 - Article

AN - SCOPUS:84926674602

VL - 335

SP - 245

EP - 253

JO - Advances in Intelligent Systems and Computing

JF - Advances in Intelligent Systems and Computing

SN - 2194-5357

ER -