Generating train plans with problem space search

MaRDI QIDQ3525420zbMATH OpenFDO

Authors P. J. Pudney, Alex W. Wardrop

Publication date 12 September 2008

zbMATH Keywords

heuristicmaintenancenetworkplanning train movementsprobabilistic search techniquetrain graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Rescheduling rail networks with maintenance disruptions using problem space search
• Optimising a coal rail network under capacity constraints
• An application of genetic and tabu searches to the freight railroad operating plan problem
• Train scheduling in a large and highly utilised railway network
• A Model, Algorithms and Strategy for Train Pathing

Cited in

(3)

• USE of railway analysis tools from an Australian perspective
• An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems
• Scheduling trains with cross entropy optimisation

This page was built for publication: Generating train plans with problem space search

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