An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes

Research output: Contribution to journal › Research article › Contributed › peer-review

Contributors

Details

Original languageEnglish
Pages (from-to)64-80
Number of pages17
JournalTransportation Research. Part B, Methodological
Issue numberSeptember 2020
Publication statusPublished - 2020
Peer-reviewedYes

External IDs

Scopus 85086635050
ORCID /0000-0003-0989-5528/work/142239590
ORCID /0000-0003-0753-0517/work/142255238

Keywords

Keywords

  • Locomotive assignment Mixed integer programming Heuristics Engine scheduling Real-world application