Constructing Constrained-Version of Magic Squares Using Selection Hyper-heuristics
نویسندگان
چکیده
A square matrix of distinct numbers in which every row, column and both diagonals has the same total is referred to as a magic square. Constructing a magic square of a given order is considered as 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 hyperheuristics, even the non-learning ones deliver an outstanding performance, beating the best known heuristic solution on average.
منابع مشابه
Corrigendum: Constructing Constrained-Version of Magic Squares Using Selection Hyper-heuristics
متن کامل
Markov Chain Selection Hyper-heuristic for the Optimisation of Constrained Magic Squares
A square matrix of size n × n, containing each of the numbers (1, . . . , n) in which every row, column and both diagonals has the same total is referred to as a magic square. The problem can be formulated as an optimisation problem where the task is to minimise the deviation from the magic square constraints and is tackled here by using hyperheuristics. Hyper-heuristics have recently attracted...
متن کاملMulti-stage hyper-heuristics for optimisation problems
There is a growing interest towards self configuring/tuning automated general-purpose reusable heuristic approaches for combinatorial optimisation, such as, hyper-heuristics. Hyper-heuristics are search methodologies which explore the space of heuristics rather than the solutions to solve a broad range of hard computational problems without requiring any expert intervention. There are two commo...
متن کاملEvolving Hyper-Heuristics for a Highly Constrained Examination Timetabling Problem
A lot of research has been conducted on hyper-heuristics for examination timetabling. However, most of this work has been focused on an uncapacitated version of the problem. This study reports on evolving hyper-heuristics for a highly constrained version of the problem, namely, the set of problems from the second International Timetabling Competition (ITC ’07). Previous work has shown that usin...
متن کاملA Tensor-based Approach to Nurse Rostering
Hyper-heuristics are high level improvement search methodologies exploring space of heuristics [4]. According to [5], hyper-heuristics can be categorized in many ways. A hyper-heuristic either selects from a set of available low level heuristics or generates new heuristics from components of existing low level heuristics to solve a problem, leading to a distinction between selection and generat...
متن کامل