PSO to solve combinatorial optimization problems - Babukarthik Raju Govindaraj
-25% su kodu BOOKS
Pristatymas per 12-18 d.d.
30 dienų grąžinimo politika
Proposed an algorithm for multi-constraint knapsack problem based on best known position (gbest) topological structure of communication. The standard data set for knapsack problem is consider and is compared with proposed algorithm. The minimum deviation, average deviation and standard deviation are calculated, the performance of proposed algorithm is compared with normal PSO knapsack problem. In future we ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
Proposed an algorithm for multi-constraint knapsack problem based on best known position (gbest) topological structure of communication. The standard data set for knapsack problem is consider and is compared with proposed algorithm. The minimum deviation, average deviation and standard deviation are calculated, the performance of proposed algorithm is compared with normal PSO knapsack problem. In future we plan to extend our work for other multi-objective problem
Daugiau informacijos
| Autorius | Babukarthik Raju Govindaraj |
|---|---|
| Leidėjas | LAP LAMBERT Academic Publishing |
| Išleidimo metai | 2018 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9786202075701 |