Ant Colony Optimization for Optimal Control of Pumps in Water Distribution Networks (2008)
Journal Article
López-Ibáñez, M., Prasad, T. D., & Paechter, B. (2008). Ant Colony Optimization for Optimal Control of Pumps in Water Distribution Networks. Journal of Water Resources Planning and Management, 134(4), 337-346. https://doi.org/10.1061/%28asce%290733-9496%282008%29134%3A4%28337%29

Reducing energy consumption of water distribution networks has never had more significance than today. The greatest energy savings can be obtained by careful scheduling of operation of pumps. Schedules can be defined either implicitly, in terms of ot... Read More about Ant Colony Optimization for Optimal Control of Pumps in Water Distribution Networks.

Solving optimal pump control problem using max-min ant system. (2007)
Presentation / Conference Contribution
Lopez-Ibanez, M., Prasad, T. D., & Paechter, B. (2007, July). Solving optimal pump control problem using max-min ant system. Presented at 9th Annual Genetic and Evolutionary Computation Conference (GECCO), London, UK

Finding feasible timetables using group-based operators. (2007)
Journal Article
Lewis, R. M. R., & Paechter, B. (2007). Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation, 11, 397-413. https://doi.org/10.1109/TEVC.2006.885162

This paper describes the applicability of the so-called "grouping genetic algorithm" to a well-known version of the university course timetabling problem. We note that there are, in fact, various scaling up issues surrounding this sort of algorithm a... Read More about Finding feasible timetables using group-based operators..

A tabu search evolutionary algorithm for solving constraint satisfaction problems. (2006)
Presentation / Conference Contribution
Craenen, B. G. W., & Paechter, B. (2006, September). A tabu search evolutionary algorithm for solving constraint satisfaction problems. Presented at Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, Reykjavik, Iceland

The paper introduces a hybrid Tabu Search-Evolutionary Algorithm for solving the constraint satisfaction problem, called STLEA. Extensive experimental fine-tuning of parameters of the algorithm was performed to optimise the performance of the algorit... Read More about A tabu search evolutionary algorithm for solving constraint satisfaction problems..

Solving a real world routing problem using evolutionary agents. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002, September). Solving a real world routing problem using evolutionary agents. Presented at Parallel Problem Solving From Nature VII, Granada, Spain

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using evolutionary agents..

A framework for distributed evolutionary algorithms. (2002)
Presentation / Conference Contribution
Arenas, M. G., Collet, P., Eiben, A. E., Jeasity, M., Merelo Guervós, J. J., Paechter, B., Preuss, M., & Schoenauer, M. (2002, September). A framework for distributed evolutionary algorithms. Presented at Parallel Problem Solving from Nature - PPSN VII 7th International Conference

This paper describes the recently released DREAM (Distributed Resource Evolutionary Algorithm Machine) framework for the automatic distribution of evolutionary algorithm (EA) processing through a virtual machine built from large numbers of individual... Read More about A framework for distributed evolutionary algorithms..

Improving street based routing using building block mutations. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002, April). Improving street based routing using building block mutations. Presented at Workshops on Applications of Evolutionary Computation EvoWorkshops 2002, Kinsale, Ireland

Street based routing (SBR) is a real-world inspired routing problem that builds routes within an urban area for mail deliveries. The authors have previously attempted to solve this problem using an Evolutionary Algorithm (EA). In this paper the autho... Read More about Improving street based routing using building block mutations..

Street-based routing using an evolutionary algorithm (2001)
Presentation / Conference Contribution
Urquhart, N. B., Paechter, B., & Chisholm, K. (2001, April). Street-based routing using an evolutionary algorithm. Presented at Workshops on Applications of Evolutionary Computation EvoWorkshops 2001, Como, Italy

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 Evolutionary Algorithms to solve the Street-Based Routing Problem (SBRP). The... Read More about Street-based routing using an evolutionary algorithm.

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.