#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1993

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Method

Learn More

- Michael W. Carter, Gilbert Laporte, +5 authors Edmund K. Burke
- 1998

It is well known that timetabling problems can be particularly difficult to solve, especially when dealing with particularly large instances. Finding near optimal results can prove to be extremely difficult, even when using advanced search methods such as evolutionary algorithms (EAs). In this paper we present a method of decomposing larger problems intoâ€¦ (More)

Scheduling exam timetables for large modular courses is a complex problem which often has to be solved in university departments. This is usually donÃ¨by hand', taking several days or weeks of iterative repair after feedback from students complaining that the timetable is unfair to them in some way. We describe an eeective solution to this problem involvingâ€¦ (More)

- Richard M Sibly, Andrew Meade, Nicola Boxall, Michael James Wilkinson, Dave W Corne, John C. Whittaker
- Molecular biology and evolution
- 2003

Microsatellite lengths change over evolutionary time through a process of replication slippage. A recently proposed model of this process holds that the expansionary tendencies of slippage mutation are balanced by point mutations breaking longer microsatellites into smaller units and that this process gives rise to the observed frequency distributions ofâ€¦ (More)

The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach which produces reasonably good results very quickly on standard benchmark job-shop scheduling problems, better than previous eeorts using genetic algorithms for this task, and comparable to existing conventional search-based methods. The representation used is aâ€¦ (More)

- Leighton Pritchard, Dave W Corne, Douglas B. Kell, Jem J. Rowland, Mike Winson
- Journal of theoretical biology
- 2005

In this paper, we generalize a previously-described model of the error-prone polymerase chain reaction (PCR) reaction to conditions of arbitrarily variable amplification efficiency and initial population size. Generalisation of the model to these conditions improves the correspondence to observed and expected behaviours of PCR, and restricts the extent toâ€¦ (More)

Arranging a lecture/tutorial/lab timetable in a large university department or school is a hard problem faced continually in educational establishments. We describe how this problem has been solved in one institution via the use of evolutionary algorithms. The technique extends easily and straightforwardly to any lecture timetabling problem. Although thereâ€¦ (More)

We describe the General Examination/Lecture Timetabling Problem (GELTP), which covers a very broad range of real problems faced continually in educational institutions, and we describe how Evolutionary Algorithms (EAs) can be employed to eeectively address arbitrary instances of the GELTP. Some benchmark GELTPs are described, including real and randomlyâ€¦ (More)

Various researchers have been applying evolutionary algorithms (EAs) to timetabling problems in the last few years. In this article we swiftly overview EA approaches to timetabling. We pay particular attention to discussing the salient aspects of approaches used, note results so far, and consider the general prospects of this pursuit.

- Rajesh Kumar, JosÃ© E. Gallardo, +8 authors Felix Halim
- 2014

This paper describes the method that constructs low autocorrelation binary sequences (LABS) which have applications in various engineering domains. We use a meta-heuristic search approach employing local search method known as Tabu Search, which solves mathematical optimization problems. Our paper is an extension to the existing one [1]. We were able toâ€¦ (More)

- Robert B. Fisher, Dave W Corne, Naoufel Werghi, andA. Ashbrook
- 1998

This paper examines the application of an evolutionary algorithm (GENO-COP III) to the problem of tting surfaces and lines to both 2D synthetic and real 3D range data. The tting is performed with both non-linear (domain) constraints and with non-linear (geometric and relational) constraints. Example ttings are given as well as an explanation of experimantalâ€¦ (More)

- â€¹
- 1
- â€º