2 863 169 libros electrónicos en 110 idiomas
¿No le conviene? No hay problema. Puede devolverlo en un plazo de 30 días
No se equivocará con un vale de regalo. El destinatario puede elegir cualquier producto de nuestra oferta.
Política de devolución de 30 días
Most real world problems require the simultaneous optimization of multiple, competing, criteria (or objectives). In this case, the aim of a multiobjective resolution approach is to find a number of solutions known as Paretooptimal solutions. Evolutionary algorithms manipulate a population of solutions and thus are suitable to solve multi-objective optimization problems. In addition parallel evolutionary algorithms aim at reducing the computation time and solving large combinatorial optimization problems. In this work we study the performance of the Balanced Explore Exploit Distributed Evolutionary Algorithm (BEEDEA) [1] on the multi-objective Knapsack problem which is a combinatorial optimization problem. BEEDA is implemented after some improvements and tested on the Knapsack problem. Key words: multi-objective optimization, evolutionary algorithms, Knapsack problem, distributed metaheuristics.
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?