DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947)
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: DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic |
scientific article; zbMATH DE number 5815648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic |
scientific article; zbMATH DE number 5815648 |
Statements
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (English)
0 references
12 November 2010
0 references
hyper-heuristics
0 references
dynamic vehicle routing problem
0 references
evolutionary algorithms
0 references
heuristic search
0 references
0 references
0 references
0 references
0 references
0 references
0.86590993
0 references
0.8580891
0 references
0.8547524
0 references
0.85302895
0 references
0.8471982
0 references
0 references
0 references
0.8446348
0 references
