PSO to solve combinatorial optimization problems

About The Book

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
Piracy-free
Piracy-free
Assured Quality
Assured Quality
Secure Transactions
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
downArrow

Details


LOOKING TO PLACE A BULK ORDER?CLICK HERE