A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211)
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 randomized granular tabu search heuristic for the split delivery vehicle routing problem |
scientific article; zbMATH DE number 6389166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized granular tabu search heuristic for the split delivery vehicle routing problem |
scientific article; zbMATH DE number 6389166 |
Statements
A randomized granular tabu search heuristic for the split delivery vehicle routing problem (English)
0 references
22 January 2015
0 references
vehicle routing problem
0 references
split deliveries
0 references
tabu search
0 references
granular neighborhood
0 references
0 references
0 references
0 references
0 references
0.843948245048523
0 references
0.8324400186538696
0 references
0.8273840546607971
0 references
0.8249263763427734
0 references
