Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247)
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: Solving a bus driver scheduling problem with randomized multistart heuristics |
scientific article; zbMATH DE number 6156974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a bus driver scheduling problem with randomized multistart heuristics |
scientific article; zbMATH DE number 6156974 |
Statements
Solving a bus driver scheduling problem with randomized multistart heuristics (English)
0 references
24 April 2013
0 references
Crew and Bus Driver Scheduling Problem
0 references
transportation
0 references
path-relinking
0 references
GRASP
0 references
variable neighborhood search
0 references
hybrid heuristics
0 references
0 references
0 references
0.8590369820594788
0 references
0.8062455654144287
0 references
0.7895280122756958
0 references
0.7870514988899231
0 references
0.781997799873352
0 references
