• Anglický jazyk

PSO to solve combinatorial optimization problems

Autor: Babukarthik Raju Govindaraj

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,... Viac o knihe

Na objednávku

36.17 €

bežná cena: 41.10 €

O knihe

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

  • Vydavateľstvo: LAP LAMBERT Academic Publishing
  • Rok vydania: 2018
  • Formát: Paperback
  • Rozmer: 220 x 150 mm
  • Jazyk: Anglický jazyk
  • ISBN: 9786202075701

Generuje redakčný systém BUXUS CMS spoločnosti ui42.