A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240)
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 7538832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A two-phase tabu search based evolutionary algorithm for the maximum diversity problem |
scientific article; zbMATH DE number 7538832 |
Statements
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (English)
0 references
9 June 2022
0 references
maximum diversity problem
0 references
hybrid evolutionary algorithm
0 references
tabu search
0 references
dynamic candidate list
0 references
path relinking
0 references
recombination operator
0 references
0 references
0.9106707
0 references
0.89021224
0 references
0.88750666
0 references
0.8823729
0 references
0.85743237
0 references
0.85445064
0 references
0.8518584
0 references
