Beedea's performance on knapsack problem - study of the performance of the balanced explore exploit

Beedea's performance on knapsack problem - study of the performance of the balanced explore exploit
29,00€

Vendu et expédié par : Cultura

État : Neuf


INDISPONIBLE EN LIGNE

 

Plus que pour profiter de la promotion
Plus que pour profiter de la livraison dès demain en magasin

stock en magasin

Retrouvez le produit près de chez vous.


*hors livres expédiés à domicile ou en point relais, hors remise et promotion au panier

Réservez en ligne &
retirez sous 2h
Livraison gratuite en
magasin
Retour en magasin
sous 30 jours

Coups de cœur Cultura

Tous les passeurs de culture peuvent partager leurs découvertes !
Tu as aimé ce produit ? Partage dès maintenant ton coup de coeur :

loader
loader
loader
loader
loader
loader
loader
loader

description

descriptif du fournisseur
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.
 
Beedea's performance on knapsack problem - study of the performance of the balanced explore exploit

Beedea's performance on knapsack problem - study of the performance of the balanced explore exploit


On vous recommande avec votre achat
Beedea's performance on knapsack problem - study of the performance of the balanced explore exploit

Beedea's performance on knapsack problem - study of the performance of the balanced explore exploit

29,00
+