DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10732-010-9126-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977997977 / rank | |||
Normal rank | |||
Revision as of 23:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic |
scientific article |
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
