Search

Your search keyword '"Kheiri, Ahmed"' showing total 3 results
Start Over Author "Kheiri, Ahmed" Topic computational design
3 results on '"Kheiri, Ahmed"'

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

Author

Kheiri, Ahmed

Subjects
late acceptance, Computational design, Heuristic solutions, Magic square, Hyper-heuristics, Computational problem, Hyperheuristic, Square matrices, Heuristic methods, Number theory
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.

Published
2014

3. A HiddenMarkov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems.

Author

Kheiri, Ahmed and Keedwell, Ed

Subjects
*HIDDEN Markov models, *HEURISTIC programming, *COMBINATORIAL optimization, *EVOLUTIONARY computation, *METAHEURISTIC algorithms
Abstract

Operations research is a well-established field that uses computational systems to support decisions in business and public life. Good solutions to operations research problems can make a large difference to the efficient running of businesses and organisations and so the field often searches for new methods to improve these solutions. The high school timetabling problem is an example of an operations research problem and is a challenging task which requires assigning events and resources to time slots subject to a set of constraints. In this article, a new sequence-based selection hyper-heuristic is presented that produces excellent results on a suite of high school timetabling problems. In this study, we present an easy-to-implement, easy-to-maintain, and effective sequence-based selection hyper-heuristic to solve high school timetabling problems using a benchmark of unified real-world instances collected from different countries. We show that with sequence-based methods, it is possible to discover new best known solutions for a number of the problems in the timetabling domain. Through this investigation, the usefulness of sequence-based selection hyper-heuristics has been demonstrated and the capability of these methods has been shown to exceed the state of the art. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results