Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

PSO to solve combinatorial optimization problems - Babukarthik Raju Govindaraj

Anglų
2018-12-23
43,07 € 57,42 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 12-18 d.d.

30 dienų grąžinimo 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 ... Visas aprašymas

Jums taip pat gali patikti

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

Daugiau informacijos

Autorius Babukarthik Raju Govindaraj
Leidėjas LAP LAMBERT Academic Publishing
Išleidimo metai 2018
Viršelio tipas Minkšti viršeliai
EAN 9786202075701
Parašykite savo atsiliepimą
Jūs peržiūrėjote: PSO to solve combinatorial optimization problems
Jūsų įvertinimas:

Goodreads Atsiliepimai

43,07 € 57,42 €