Two-phase heuristic for SNCF rolling stock problem

DOI10.1007/S10479-017-2550-ZMaRDI QIDQ1730598zbMATH OpenOpenAlexFDO

Authors Mirsad Buljubašić, Michel Vasquez, Haris Gavranović

Publication date 6 March 2019

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-017-2550-z

zbMATH Keywords

local searchinteger programmingschedulinggreedy heuristicrolling stock

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014
• Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge
• A search-based approach to railway rolling stock allocation problems
• A search-based approach to the railway rolling stock allocation problem
• Models and algorithms for the train unit assignment problem

Cites work

• Operations Research in passenger railway transportation

Cited in

(2)

• A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014
• Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge

This page was built for publication: Two-phase heuristic for SNCF rolling stock problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730598)