dc.contributor.author | Kheiri, Ahmed | |
dc.contributor.author | Özcan, Ender | |
dc.date.accessioned | 2014-09-15T10:23:25Z | |
dc.date.issued | 2013-11-11 | |
dc.description.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. | en_GB |
dc.identifier.citation | Vol. 57 (3), pp. 469 - 479 | en_GB |
dc.identifier.doi | 10.1093/comjnl/bxt130 | |
dc.identifier.uri | http://hdl.handle.net/10871/15558 | |
dc.language.iso | en | en_GB |
dc.publisher | Oxford University Press for BCS, The Chartered Institute for IT | en_GB |
dc.subject | magic square | en_GB |
dc.subject | hyper-heuristic | en_GB |
dc.subject | late acceptance | en_GB |
dc.subject | computational design | en_GB |
dc.title | Constructing constrained-version of magic squares using selection hyper-heuristics | en_GB |
dc.type | Article | en_GB |
dc.date.available | 2014-09-15T10:23:25Z | |
dc.identifier.issn | 0010-4620 | |
dc.description | Copyright © The British Computer Society 2013 | en_GB |
dc.description | This is a pre-copyedited, author-produced PDF of an article accepted for publication in the Computer Journal following peer review. The version of record in Volume 57, Issue 3, pp. 469-479 is available online at: http://dx.doi.org/10.1093/comjnl/bxt130 | en_GB |
dc.identifier.eissn | 1460-2067 | |
dc.identifier.journal | The Computer Journal | en_GB |