Tabu search embedded simulated annealing for the shortest route cut and fill problem (Q5318358)
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 2208172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tabu search embedded simulated annealing for the shortest route cut and fill problem |
scientific article; zbMATH DE number 2208172 |
Statements
Tabu search embedded simulated annealing for the shortest route cut and fill problem (English)
0 references
26 September 2005
0 references
cut and fill
0 references
tabu search
0 references
simulated annealing
0 references
0.8771414160728455
0 references
0.764673113822937
0 references
0.7388025522232056
0 references
0.7305557131767273
0 references
