A unified tabu search heuristic for vehicle routing problems with time windows (Q4658480)
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 unified tabu search heuristic for vehicle routing problems with time windows |
scientific article; zbMATH DE number 2146744
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A unified tabu search heuristic for vehicle routing problems with time windows |
scientific article; zbMATH DE number 2146744 |
Statements
A unified tabu search heuristic for vehicle routing problems with time windows (English)
0 references
16 March 2005
0 references
vehicle routing problem
0 references
periodic vehicle routing problem
0 references
multi-depot vehicle routing problem
0 references
time windows
0 references
tabu search
0 references
0.96607065
0 references
0.9562302
0 references
0.9538813
0 references
0.94877386
0 references
0 references
0.9476009
0 references
0.94400495
0 references
0.94294506
0 references
0.93699545
0 references
