Code: 07165112
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 ... more
English
35.65 €
RRP: 41.78 €
You save 6.12 €

You get 86 loyalty points
Book synopsis
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.
Book details
Book category Books in English Literature & literary studies Literature: history & criticism Literary studies: general
35.65 €
English
Collection points Bratislava a 12944 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25892 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )