Skip to main content

Research Repository

Advanced Search

Prof Ben Paechter's Outputs (72)

Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating (2000)
Presentation / Conference Contribution
Eiben, A. E., Jansen, B., Michalewicz, Z., & Paechter, B. (2000, July). Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating. Presented at 2nd Annual Conference on Genetic and Evolutionary Computation, Las Vegas, US

This paper examines evolutionary algorithms (EAs) extended by various penalty-based approaches to solve constraint satisfaction problems (CSPs). In some approaches, the penalties are set in advance and they do not change during a run. In other approa... Read More about Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating.

Optimising an evolutionary algorithm for scheduling (2000)
Presentation / Conference Contribution
Urquhart, N. B., Chisholm, K., & Paechter, B. (2000, April). Optimising an evolutionary algorithm for scheduling. Presented at EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight,, Edinburgh

This paper examines two techniques for setting the parameters of an evolutionary Algorithm (EA). The example EA used for test purposes undertakes a simple scheduling problem. An initial version of the EA was tested utilising a set of parameters that... Read More about Optimising an evolutionary algorithm for scheduling.

Two evolutionary approaches to cross-clustering problems. (1999)
Presentation / Conference Contribution
Luchian, H., Paechter, B., Radulescu, V., & Luchian, S. (1999, July). Two evolutionary approaches to cross-clustering problems. Presented at 1999 Congress on Evolutionary Computation

Cross-clustering asks for a Boolean matrix to
be brought to a quasi-canonical form. The problem has
many applications in image processing, circuit design,
archaeology, ecology etc. The heuristics currently used
to solve it rely on either topologi... Read More about Two evolutionary approaches to cross-clustering problems..

The continuous equilibrium optimal network design problem: a genetic approach. (1999)
Presentation / Conference Contribution
Cree, N. D., Maher, M., & Paechter, B. (1996, September). The continuous equilibrium optimal network design problem: a genetic approach. Presented at Transportation Networks: Recent Methodological Advances 4th EURO Transportation Meeting

A genetic algorithm (GA) program for providing a solution to the Continuous Equilibrium Network Design Problem (NDP) is introduced following a general discussion of the network design problem and genetic algorithms. A description of the current GA op... Read More about The continuous equilibrium optimal network design problem: a genetic approach..

Timetabling the classes of an entire university with an evolutionary algorithm. (1998)
Presentation / Conference Contribution
Paechter, B., Rankin, B., Cumming, A., & Fogarty, T. C. (1998, September). Timetabling the classes of an entire university with an evolutionary algorithm. Presented at 5th International Conference Parallel Problem Solving from Nature — PPSN V, Amsterdam

This paper describes extensions to an evolutionary algorithm that timetables classes for an entire University. A new method of dealing with multi-objectives is described along with a user interface designed for it. New results are given concerning re... Read More about Timetabling the classes of an entire university with an evolutionary algorithm..

Improving a lecture timetabling system for university wide use (1998)
Presentation / Conference Contribution
Paechter, B., Rankin, B., & Cumming, A. (1997, August). Improving a lecture timetabling system for university wide use. Presented at Second International Conference, PATAT’97, Toronto, Canada

During the academic year 1996/97 the authors were commissioned by their institution to produce an automated timetabling system for use by all departments within the Faculty of Science. The system had to cater for the varying requirements of all the d... Read More about Improving a lecture timetabling system for university wide use.

Extensions to a memetic timetabling system. (1996)
Presentation / Conference Contribution
Paechter, B., Cumming, A., Norman, M. G., & Luchian, H. (1995, August). Extensions to a memetic timetabling system. Presented at International Conference on the Practice and Theory of Automated Timetabling, Edinburgh

This paper describes work in progress to increase the performance of a memetic timetabling system. The features looked at are two directed mutation operators, targeted mutation and a structured population that facilitates parallel implementation. Exp... Read More about Extensions to a memetic timetabling system..

The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. (1995)
Presentation / Conference Contribution
Paechter, B., Cumming, A., & Luchian, H. (1995, April). The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms. Presented at AISB International Workshop on Evolutionary Computing 1996, Brighton, UK

This paper presents a new genetic representation for timetabling with evolutionary algorithms. The representation involves the use of suggestion lists for the placement of events into timeslots. A set of recombination operators is defined for the new... Read More about The use of local search suggestion lists for improving the solution of timetable problems with evolutionary algorithms..

Two solutions to the general timetable problem using evolutionary algorithms. (1994)
Presentation / Conference Contribution
Paechter, B., Luchian, H., Cumming, A., & Petriuc, M. (1994, June). Two solutions to the general timetable problem using evolutionary algorithms. Presented at First IEEE Conference on Evolutionary Computation, 1994 IEEE World Congress on Computational Intelligence

The general timetable problem, which involves the placing
of events requiring limited resources into timeslots,
has been approached in many different ways. This paper
describes two approaches to solving the problem using
evolutionary algorithms.... Read More about Two solutions to the general timetable problem using evolutionary algorithms..

A general model for the answer-pertubation techniques. (1994)
Presentation / Conference Contribution
Stamate, D., Luchian, H., & Paechter, B. (1994, September). A general model for the answer-pertubation techniques

Answer-perturbation techniques for the protection
of statistical databases were introduced in [7]; they
are flexible (perturbation kept under control),
modular (do not interact with the DBMS)
techniques, which compare fmorably to previous
protec... Read More about A general model for the answer-pertubation techniques..

Optimising a Presentation Timetable Using Evolutionary Algorithms (1994)
Presentation / Conference Contribution
Paechter, B. (1994, April). Optimising a Presentation Timetable Using Evolutionary Algorithms. Presented at AISB EC: AISB Workshop on Evolutionary Computing, Leeds

This paper describes a solution to the problem of scheduling student presentations which uses evolutionary algorithms. The solution uses a permutation based approach with each candidate schedule being coded for by a genotype containing six chromosome... Read More about Optimising a Presentation Timetable Using Evolutionary Algorithms.