Prof Ben Paechter's Outputs (93)

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..

Single Front Genetic Algorithms: A Performance Study (2003)
Presentation / Conference Contribution
de Toro Negro, F., Ortega, J., & Paechter, B. (2003, April). Single Front Genetic Algorithms: A Performance Study

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 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..

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..

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..

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..

A Scalable and Robust Framework for Distributed Applications (2002)
Presentation / Conference Contribution
Jelasity, M., Preuss, M., & Paechter, B. (2002, May). A Scalable and Robust Framework for Distributed Applications. Presented at 2002 Congress on Evolutionary Computation (CEC'02), Honolulu, HI, US

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 Scalable and Robust Framework for Distributed Applications.

A distributed resource evolutionary algorithm machine. (2002)
Presentation / Conference Contribution
Paechter, B., Baeck, T., Schoenauer, M., Eiben, A. E., Merelo Guervós, J. J., Sebag, M., & Fogarty, T. C. (2000, July). A distributed resource evolutionary algorithm machine. Presented at 2000 Congress on Evolutionary Computation

This paper describes a project funded by the
European Commission’ which seeks to provide the
technology and software infrastructure necessary to
support the next generation of evolving infohabitants in
a way that makes that infrastructure univers... Read More about A distributed resource evolutionary algorithm machine..

A General Model for the Answer-Perturbation Techniques (2002)
Presentation / Conference Contribution
Stamate, D., Luchian, H., & Paechter, B. (1994, September). A General Model for the Answer-Perturbation Techniques. Presented at Seventh International Working Conference on Scientific and Statistical Database Management, Charlottesville, VA, US

Answer-perturbation techniques for the protection of statistical databases have been previously introduced (Luchian and Stamate, 1992); they are flexible (perturbation kept under control), modular (do not interact with the DBMS) techniques, which com... Read More about A General Model for the Answer-Perturbation Techniques.

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.

Real-world applications of evolutionary computing (2000)
Presentation / Conference Contribution
Cagnoni, S., Poli, R., Smith, G. D., Corne, D., Oates, M., Hart, E., Lanzi, P. L., Willem, E. J., Li, Y., Paechter, B., & Fogarty, T. C. (2000, April). Real-world applications of evolutionary computing. Presented at EvoWorkshops 2000, Edinburgh, Scotland

This book constitutes the refereed proceedings of six workshops on evolutionary computation held concurrently as EvoWorkshops 2000 in Edinburgh, Scotland, UK, in April 2000.
The 37 revised papers presented were carefully reviewed and selected by the... Read More about Real-world applications of evolutionary computing.

Stone Soup (2000)
Presentation / Conference Contribution
Paechter, B., Fogarty, T. C., Burke, E., Cumming, A., & Rankin, B. (2000, August). Stone Soup

Solving CSPs with evolutionary algorithms using self-adaptive constraint weights. (2000)
Presentation / Conference Contribution
Eiben, A. E., Jansen, B., Michalewicz, Z., & Paechter, B. (2000, July). Solving CSPs with evolutionary algorithms using self-adaptive constraint weights. Presented at Genetic and Evolutionary Computation Conference (GECCO-2000)

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 appro... Read More about Solving CSPs with evolutionary algorithms using self-adaptive constraint weights..

Post-publication timetabling. (2000)
Presentation / Conference Contribution
Cumming, A., Paechter, B., & Rankin, R. C. (2000, August). Post-publication timetabling. Presented at 3rd International Conference on the Practice And Theory of Automated Timetabling, PATAT 2000