Kontakt
Wie einkaufen
Versand
Kaufberater
Beedea's Performance on Knapsack Problem
Englisch
141 b
30 Tage für die Rückgabe der Ware
Das könnte Sie auch interessieren
/
Hardcover
121.03
€
/
Broschur
138.22
€
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.
Informationen zum Buch
Englisch
