Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
In this paper we propose an agent-based model of evolutionary algorithms (EAs) which extends seamlessly from concurrent single-host to distributed multi-host installations. Since ...
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...