A column generation approach to train timetabling on a corridor

From MaRDI portal
Revision as of 17:55, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:941001

DOI10.1007/S10288-007-0037-5zbMath1151.90323OpenAlexW1977010611MaRDI QIDQ941001

Valentina Cacchiani, Alberto Caprara, Paolo Toth

Publication date: 4 September 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0037-5




Related Items (26)

Branch-and-bound-based local search heuristics for train timetabling on single-track railway networkAn efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systemsModels and algorithms of conflict detection and scheduling optimization for high-speed train operations based on MPCFreight railway operator timetabling and engine schedulingAn iterative heuristic for passenger-centric train timetabling with integrated adaption timesA decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problemA Benders decomposition algorithm for demand-driven metro schedulingNominal and robust train timetabling problemsOn the general problem statement of cargo carriages scheduling and ways to solve itOn the algorithm of cargoes transportation scheduling in the transport networkDynamic graph generation for the shortest path problem in time expanded networksOptimising a coal rail network under capacity constraintsRailway track allocation: Models and methodsOptimizing the simplon railway corridorSolving Railway Track Allocation ProblemsA column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routingMulti-train trajectory optimization for energy-efficient timetablingA new constraint programming approach for optimising a coal rail systemAdjusting a railway timetable in case of partial or complete blockadesExact formulations and algorithm for the train timetabling problem with dynamic demandNon-cyclic train timetabling and comparability graphsMinimizing the waiting time for a one-way shuttle serviceModels and algorithms for combinatorial optimization problems arising in railway applicationsIntegrated rolling stock deadhead routing and timetabling in urban rail transit linesMultiple train repositioning operations in a railyard networkAccelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays


Uses Software



Cites Work




This page was built for publication: A column generation approach to train timetabling on a corridor