A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225)
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: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows |
scientific article; zbMATH DE number 6650750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows |
scientific article; zbMATH DE number 6650750 |
Statements
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (English)
0 references
10 November 2016
0 references
variable neighborhood search
0 references
tabu search
0 references
vehicle routing problem
0 references
multiple time windows
0 references
0 references
0 references
0 references
0.8790744543075562
0 references
0.865119993686676
0 references
0.8399937748908997
0 references
0.8349188566207886
0 references
