PSO to solve combinatorial optimization problems

ISBN-13: 9786202075701 / Angielski / Miękka / 2018 / 52 str.

Babukarthik Raju Govindaraj

Opis

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

O autorze

Raju Govindaraj, Babukarthik
R.G.BABU KARTIK as completed MCA, M.Tech (NIE) in Pondicherry University Pondicherry, India.Doctorate in the area cloud computing and optimization algorithm. His area of research Particle Optimization Algorithm, cloud computing, Machine learning, web service.