Skip to main content

Research Repository

Advanced Search

Outputs (84)

PSFGA: Parallel processing and evolutionary computation for multiobjective optimisation (2004)
Journal Article
de Toro Negro, F., Ortega, J., Ros, E., Mota, S., Paechter, B., & Martin, J. M. (2004). PSFGA: Parallel processing and evolutionary computation for multiobjective optimisation. Parallel Computing, 30(5-6), 721-739. https://doi.org/10.1016/j.parco.2003.12.012

This paper deals with the study of the cooperation between parallel processing and evolutionary computation to obtain efficient procedures for solving multiobjective optimisation problems. We propose a new algorithm called PSFGA (parallel single fron... Read More about PSFGA: Parallel processing and evolutionary computation for multiobjective optimisation.

Improving vehicle routing using a customer waiting time colony. (2004)
Presentation / Conference Contribution
Sa'adah, S., Ross, P., & Paechter, B. (2004, April). Improving vehicle routing using a customer waiting time colony

In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimise the total distance travelled by all vehicles. This paper describes so... Read More about Improving vehicle routing using a customer waiting time colony..

Routing using evolutionary agents and proactive transitions. (2003)
Book Chapter
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2003). Routing using evolutionary agents and proactive transitions. In Applications of Evolutionary Computing (696-705). Springer-Verlag

The authors have previously introduced the concept of building a delivery network using an agent-based system. The delivery networks are built in response to a real-world problem that involves delivering post to a large number of households within an... Read More about Routing using evolutionary agents and proactive transitions..

A comparison of the performance of different metaheuristics on the timetabling problem. (2003)
Presentation / Conference Contribution
Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L. M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., & Stutzle, T. (2002, August). A comparison of the performance of different metaheuristics on the timetabling problem

The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration... Read More about A comparison of the performance of different metaheuristics on the timetabling problem..

A scaleable and robust framework for distributed application. (2002)
Journal Article
Jelasity, M., Preuss, M., & Paechter, B. (2002). A scaleable and robust framework for distributed application. World Congress on Computational Intelligence, 2, 1540-1545

This paper describes a novel tool for running distributed experiments on the Internet. The possible applications include simple load balancing, parallel evolutionary computation, agent-based simulation and artificial life. Our environment is based on... Read More about A scaleable and robust framework for distributed application..

A local search for the timetabling problem. (2002)
Presentation / Conference Contribution
Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., & Paechter, B. (2002, August). A local search for the timetabling problem. Presented at PATAT 2002

This work is part of the Metaheuristic Network, a European Commission project that seeks to empirically compare the performance of various metaheuristics on different combinatorial optimization problems. In this paper we define a representation, a ne... Read More about A local search for the timetabling problem..

Maintaining connectivity in a scaleable and robust distributed environment. (2002)
Journal Article
Jelasity, M., Preuss, M., Van Steen, M., & Paechter, B. (2002). Maintaining connectivity in a scaleable and robust distributed environment. Cluster Computing and the Grid, 389-394. https://doi.org/10.1109/CCGRID.2002.1017166

This paper describes a novel peer-to-peer (P2P) environment for running distributed Java applications on the Internet. The possible application areas include simple load balancing, parallel evolutionary computation, agent-based simulation and artific... Read More about Maintaining connectivity in a scaleable and robust distributed environment..

A GA evolving instructions for a timetable builder. (2002)
Presentation / Conference Contribution
Blum, C., Correia, S., Dorigo, M., Paechter, B., Rossi-Doria, O., & Snoek, M. (2002, August). A GA evolving instructions for a timetable builder. Presented at PATAT 2002

In this work we present a Genetic Algorithm for tackling timetabling problems. Our approach uses an indirect solution representation, which denotes a number of instructions for a timetable builder on how to sequentially build a solution. These instru... Read More about A GA evolving instructions for a timetable builder..

Solving a real world routing problem using multiple evolutionary algorithms. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002, September). Solving a real world routing problem using multiple evolutionary algorithms. Presented at 7th International Conference PPSN: International Conference on Parallel Problem Solving from Nature-, 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 multiple evolutionary algorithms..