Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm (Q2093908)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7608623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm |
scientific article; zbMATH DE number 7608623 |
Statements
Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm (English)
0 references
27 October 2022
0 references
binary genetic algorithm
0 references
Pareto-optimal solution set
0 references
0.8204718828201294
0 references
0.8023766279220581
0 references
0.7866325378417969
0 references
0.7864545583724976
0 references
