We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
There are several studies on the desirable properties that a performance measure for evolutionary multiobjective algorithms must have. One of these properties is called “compati...
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Robert Ivo...
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
Rafael Ramirez, Amaury Hazan, Jordi Marine, Esteba...