A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows (Q702761)
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 a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows |
scientific article; zbMATH DE number 2128897
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows |
scientific article; zbMATH DE number 2128897 |
Statements
A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows (English)
0 references
17 January 2005
0 references
Tabu search
0 references
heuristics
0 references
LP relaxation
0 references
distribution scheduling
0 references
0.95951927
0 references
0.9491231
0 references
0 references
0.9026891
0 references
0.90043455
0 references
0 references
0.89674205
0 references
0.8964363
0 references
