An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP) (Q905291)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP) |
scientific article; zbMATH DE number 6532768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP) |
scientific article; zbMATH DE number 6532768 |
Statements
An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP) (English)
0 references
19 January 2016
0 references
binary particle swarm optimization (BPSO)
0 references
multi-objective resource allocation problem (MORAP)
0 references
algorithm
0 references
Pareto optimal solutions
0 references
example simulation
0 references
0 references
0 references
0 references
0 references
0.8548939228057861
0 references
0.8284826278686523
0 references
0.8222318291664124
0 references
0.7906133532524109
0 references
0.7626044750213623
0 references
