Autorenfreundlich Bücher kaufen?!
Beschreibung
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
Details
| Verlag | LAP LAMBERT Academic Publishing |
| Ersterscheinung | 23. Dezember 2018 |
| Maße | 22 cm x 15 cm x 0.4 cm |
| Gewicht | 96 Gramm |
| Format | Softcover |
| ISBN-13 | 9786202075701 |
| Seiten | 52 |
Schlagwörter
Bekannt durch
