PSO to solve combinatorial optimization problems - Babukarthik Raju Govindaraj
-30% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas 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 ... Pilns apraksts
Jums varētu patikt arī
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
Vairāk informācijas
| Autors | Babukarthik Raju Govindaraj |
|---|---|
| Izdevējs | LAP LAMBERT Academic Publishing |
| Izlaides gads | 2018 |
| Vāka tips | Mīkstais vāks |
| EAN | 9786202075701 |