A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (Q1038386)
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 tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars |
scientific article; zbMATH DE number 5634745
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars |
scientific article; zbMATH DE number 5634745 |
Statements
A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars (English)
0 references
17 November 2009
0 references
vehicle routing
0 references
distribution calendar
0 references
production calendar
0 references
inventory
0 references
internal fleet
0 references
common carrier
0 references
split delivery
0 references
tabu
0 references
0 references
0 references
0 references
0.9313621
0 references
0.91658694
0 references
0.9147576
0 references
0.89562523
0 references
0.89241767
0 references
0.88986546
0 references
0.88904893
0 references
0.88864815
0 references
