Constructing constrained-version of magic squares using selection hyper-heuristics

Management Science

Text available via DOI:

https://doi.org/10.1093/comjnl/bxt130
Final published version

Keywords

computational design, hyper-heuristic, late acceptance, magic square

View graph of relations

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Constructing constrained-version of magic squares using selection hyper-heuristics. / Kheiri, Ahmed; Özcan, Ender.
In: Computer Journal, Vol. 57, No. 3, 01.03.2014, p. 469-479.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Bibtex

@article{fcb55fd77045456d9c7d59c3838ecd22,

title = "Constructing constrained-version of magic squares using selection hyper-heuristics",

abstract = "A square matrix of distinct numbers in which every row, column and both diagonals have the same total is referred to as a magic square. Constructing a magic square of a given order is considered a difficult computational problem, particularly when additional constraints are imposed. Hyper-heuristics are emerging high-level search methodologies that explore the space of heuristics for solving a given problem. In this study, we present a range of effective selection hyper-heuristics mixing perturbative low-level heuristics for constructing the constrained version of magic squares. The results show that selection hyper-heuristics, even the non-learning ones deliver an outstanding performance, beating the best-known heuristic solution on average.",

keywords = "computational design, hyper-heuristic, late acceptance, magic square",

author = "Ahmed Kheiri and Ender {\"O}zcan",

year = "2014",

month = mar,

day = "1",

doi = "10.1093/comjnl/bxt130",

language = "English",

volume = "57",

pages = "469--479",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "3",

}

RIS

TY - JOUR

T1 - Constructing constrained-version of magic squares using selection hyper-heuristics

AU - Kheiri, Ahmed

AU - Özcan, Ender

PY - 2014/3/1

Y1 - 2014/3/1

N2 - A square matrix of distinct numbers in which every row, column and both diagonals have the same total is referred to as a magic square. Constructing a magic square of a given order is considered a difficult computational problem, particularly when additional constraints are imposed. Hyper-heuristics are emerging high-level search methodologies that explore the space of heuristics for solving a given problem. In this study, we present a range of effective selection hyper-heuristics mixing perturbative low-level heuristics for constructing the constrained version of magic squares. The results show that selection hyper-heuristics, even the non-learning ones deliver an outstanding performance, beating the best-known heuristic solution on average.

AB - A square matrix of distinct numbers in which every row, column and both diagonals have the same total is referred to as a magic square. Constructing a magic square of a given order is considered a difficult computational problem, particularly when additional constraints are imposed. Hyper-heuristics are emerging high-level search methodologies that explore the space of heuristics for solving a given problem. In this study, we present a range of effective selection hyper-heuristics mixing perturbative low-level heuristics for constructing the constrained version of magic squares. The results show that selection hyper-heuristics, even the non-learning ones deliver an outstanding performance, beating the best-known heuristic solution on average.

KW - computational design

KW - hyper-heuristic

KW - late acceptance

KW - magic square

U2 - 10.1093/comjnl/bxt130

DO - 10.1093/comjnl/bxt130

M3 - Journal article

AN - SCOPUS:84897710869

VL - 57

SP - 469

EP - 479

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 3

ER -

Research

Links

Text available via DOI:

Keywords