Comparison among three algorithms to solve unconstrained MLLS problems (Q3016792)
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 5926934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison among three algorithms to solve unconstrained MLLS problems |
scientific article; zbMATH DE number 5926934 |
Statements
19 July 2011
0 references
lot-sizing problem
0 references
particle swarm optimization
0 references
scatter search
0 references
genetic algorithm
0 references
repulsive operator
0 references
0.8137593865394592
0 references
0.7774181365966797
0 references
0.7592859268188477
0 references
0.7552971839904785
0 references
