A set covering approach for multi-depot train driver scheduling (Q2343986)
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 set covering approach for multi-depot train driver scheduling |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A set covering approach for multi-depot train driver scheduling |
scientific article |
Statements
A set covering approach for multi-depot train driver scheduling (English)
0 references
11 May 2015
0 references
set covering problem
0 references
LP-based neighborhoods
0 references
matheuristic
0 references
tabu search
0 references
design of experiment
0 references
train drive scheduling
0 references
Iranian railways
0 references
