Kód: 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 ... celý popis
Angličtina
Nákupem získáte 81 bodů
Anotace knihy
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.
Parametry knihy
Zařazení knihy Knihy v angličtině Literature & literary studies Literature: history & criticism Literary studies: general
813 Kč
Angličtina
Osobní odběr Praha, Brno a 47512 dalších
Copyright ©2008-26 nejlevnejsi-knihy.cz Všechna práva vyhrazenaSoukromíCookies
Vrácení do měsíce
571 999 099 (8-15.30h)Nákupní košík ( prázdný )