BEEDEA's Performance on Knapsack problem. Study of the performance of the Balanced Explore Exploit Distributed Evolutionary Algorithm BEEDEA
Par :Formats :
- Paiement en ligne :
- Livraison à domicile ou en point Mondial Relay estimée à partir du 22 septembreCet article sera commandé chez un fournisseur et vous sera envoyé 21 jours après la date de votre commande.
- Retrait Click and Collect en magasin gratuit
- Nombre de pages76
- FormatPoche
- PrésentationBroché
- Poids0.126 kg
- Dimensions15,0 cm × 22,0 cm × 0,0 cm
- ISBN978-613-1-57616-4
- EAN9786131576164
- Date de parution29/05/2011
- CollectionOMN.UNIV.EUROP.
- ÉditeurUniv Européenne
Résumé
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.
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.
