#### Filter Results:

- Full text PDF available (321)

#### Publication Year

1942

2017

- This year (9)
- Last 5 years (86)
- Last 10 years (221)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Edmund K. Burke, Graham Kendall, Eric Soubeiga
- J. Heuristics
- 2003

Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach… (More)

- Edmund K. Burke, Patrick De Causmaecker, Greet Vanden Berghe, Hendrik Van Landeghem
- J. Scheduling
- 2004

Nurse rostering is a complex scheduling problem that affects hospital personnel on a daily basis all over the world. The need for quality software solutions is acute for a number of reasons. In particular, it is very important to efficiently utilise time and effort, to evenly balance the workload among people and to attempt to satisfy personnel preferences.… (More)

- Edmund K. Burke, James P. Newall, Rupert F. Weare
- PATAT
- 1995

The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a significant increase in its complexity, imposing even more difficulties on university administrators who must find a solution, often without any computer aid. Of the many methods… (More)

- Edmund K. Burke, Sanja Petrovic
- European Journal of Operational Research
- 2002

The aim of this paper is to give a brief introduction to some recent approaches to timetabling problems that have been developed or are under development in the Automated Scheduling, Optimisation and Planning Research Group (ASAP) at the University of Nottingham. We have concentrated upon university timetabling but we believe that some of the methodologies… (More)

- Edmund K. Burke, Graham Kendall, Glenn Whitwell
- Operations Research
- 2004

This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches. A placement algorithm usually takes a list of shapes, sorted by some property such as increasing height or decreasing area, and then applies a placement rule to each of… (More)

- Edmund K. Burke, Michel Gendreau, +4 authors Rong Qu
- JORS
- 2013

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the goal of automating the design of heuristic methods to solve hard computational search problems. An underlying strategic research challenge is to develop more generally applicable search methodologies. The term hyperheuristic is relatively new; it was first used in… (More)

1. INTRODUCTION The biological immune system is a robust, complex, adaptive system that defends the body from foreign pathogens. It is able to categorize all cells (or molecules) within the body as self-cells or non-self cells. It does this with the help of a distributed task force that has the intelligence to take action from a local and also a global… (More)

This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide… (More)

In recent years the computational power of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of… (More)

- Salwani Abdullah, Edmund K. Burke, Barry McCollum
- IEEE Congress on Evolutionary Computation
- 2007

Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such an algorithm for university course timetabling. This problem is concerned with the assignment of lectures to specific timeslots and rooms. For a solution to be feasible, a number… (More)