PSO to solve combinatorial optimization problems - Babukarthik Raju Govindaraj
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
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 ... Full description
You May Also Like
Description
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
More Information
| Author | Babukarthik Raju Govindaraj |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2018 |
| Cover type | Softcover |
| EAN | 9786202075701 |