A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5599876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of five heuristics for the multiple depot vehicle scheduling problem |
scientific article; zbMATH DE number 5599876 |
Statements
A comparison of five heuristics for the multiple depot vehicle scheduling problem (English)
0 references
28 August 2009
0 references
vehicle scheduling
0 references
multiple depot
0 references
heuristics
0 references
branch-and-cut
0 references
column generation
0 references
Lagrangian heuristic
0 references
tabu search
0 references
large neighborhood search
0 references
0.8693122863769531
0 references
0.8505183458328247
0 references
0.8442463874816895
0 references
0.8353999257087708
0 references
