We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...
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...
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...