A Survey of Optimization Models for Train Routing and Scheduling

DOI10.1287/trsc.32.4.380zbMath0987.90507WikidataQ115213145 ScholiaQ115213145MaRDI QIDQ2783827

Paolo Toth, Jean-François Cordeau, Daniele Vigo

Publication date: 17 April 2002

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.32.4.380

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Related Items

On the line planning problems of the hub public-transportation networks, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, A general system theory approach to rail freight car fleet sizing, Railroad transportation of dangerous goods: population exposure to airborne toxins, ACS-TS: Train scheduling using ant colony system, Service network design with management and coordination of multiple fleets, Efficient scheduling of traffic on a railway line, Fuzzy dispatching model and genetic algorithms for railyards operations, Service network design in freight transportation, A simulation tool for combined rail/road transport in intermodal terminals, A multiple-crane-constrained scheduling problem in a container terminal, A branch and bound algorithm for scheduling trains in a railway network, Stability evaluation of a railway timetable at station level, Simultaneous disruption recovery of a train timetable and crew roster in real time, Cost optimal periodic train scheduling, Real time management of a metro rail terminus, Network hub location problems: The state of the art, Bicriteria train scheduling for high-speed passenger railroad planning applications, The single-node dynamic service scheduling and dispatching problem, CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN, FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC