Date


Output Type

Download Available

66 results

Street-based routing using an evolutionary algorithm

Conference Proceeding
Urquhart, N. B., Paechter, B., & Chisholm, K. (2001)
Street-based routing using an evolutionary algorithm. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, …H. Tijink (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Proceedings. , (495-504). https://doi.org/10.1007/3-540-45365-2_51
Much research has been carried out into solving routing problems using both Evolutionary Techniques and other methods. In this paper the authors investigate the usage of an Ev...

Real-world applications of evolutionary computing

Conference Proceeding
Cagnoni, S., Poli, R., Smith, G. D., Corne, D., Oates, M., Hart, E., …Fogarty, T. C. (2000)
Real-world applications of evolutionary computing. In Proceedings of EvoWorkshops 2000
This book constitutes the refereed proceedings of six workshops on evolutionary computation held concurrently as EvoWorkshops 2000 in Edinburgh, Scotland, UK, in April 2000. T...

Optimising an evolutionary algorithm for scheduling

Conference Proceeding
Urquhart, N. B., Chisholm, K., & Paechter, B. (2000)
Optimising an evolutionary algorithm for scheduling. In S. Cagnoni, R. Poli, G. D. Smith, D. Corne, M. Oates, E. Hart, …T. C. Fogarty (Eds.), Real-World Applications of Evolutionary Computing: EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight, Proceedings. , (307-318). https://doi.org/10.1007/3-540-45561-2_30
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. ...

Post-publication timetabling.

Conference Proceeding
Cumming, A., Paechter, B., & Rankin, R. C. (2000)
Post-publication timetabling. In 3rd International Conference on the Practice And Theory of Automated Timetabling, PATAT 2000, (107-108

Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating

Conference Proceeding
Eiben, A. E., Jansen, B., Michalewicz, Z., & Paechter, B. (2000)
Solving CSPs using self-adaptive constraint weights: how to prevent EAs from cheating. In GECCO'00: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation. , (128-134
This paper examines evolutionary algorithms (EAs) extended by various penalty-based approaches to solve constraint satisfaction problems (CSPs). In some approaches, the penalt...

Optimising an Evolutionary Algorithm for Scheduling

Conference Proceeding
Urquhart, N., Chisholm, K., & Paechter, B. (2000)
Optimising an Evolutionary Algorithm for Scheduling. In Real-World Applications of Evolutionary Computing: EvoWorkshops 2000. , (307-318
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. ...

Solving CSPs with evolutionary algorithms using self-adaptive constraint weights.

Conference Proceeding
Eiben, A. E., Jansen, B., Michalewicz, Z., & Paechter, B. (2000)
Solving CSPs with evolutionary algorithms using self-adaptive constraint weights. In D. Whitley (Ed.), GECCO-2000 : proceedings of the genetic and evolutionary computation conference, 128-134
This paper examines evolutionary algorithms (EAs) extended by various penalty-based approaches to solve constraint satisfaction problems (CSPs). In some approaches, the penalt...

Two evolutionary approaches to cross-clustering problems.

Conference Proceeding
Luchian, H., Paechter, B., Radulescu, V., & Luchian, S. (1999)
Two evolutionary approaches to cross-clustering problems. In Proceedings of the 1999 Congress on Evolutionary Computation, (860-870). https://doi.org/10.1109/CEC.1999.782514
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...

The continuous equilibrium optimal network design problem: a genetic approach.

Conference Proceeding
Cree, N. D., Maher, M., & Paechter, B. (1999)
The continuous equilibrium optimal network design problem: a genetic approach. In M. G. H. Bell (Ed.), Transportation Networks: Recent Methodological advances, 163-174
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 networ...

Improving a lecture timetabling system for university wide use

Conference Proceeding
Paechter, B., Rankin, B., & Cumming, A. (1998)
Improving a lecture timetabling system for university wide use. In Practice and Theory of Automated Timetabling II. , (156-165). https://doi.org/10.1007/BFb0055887
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...