Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators

DOI10.1016/J.COR.2024.106580MaRDI QIDQ6561224zbMATH OpenFDO

Authors Y. R. de Weert, Konstantinos Gkiotsalitis, Eric C. van Berkum

Publication date 25 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106580

zbMATH Keywords

eventsmaintenance schedulingpassenger hindrancerailway

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Finding the K Shortest Loopless Paths in a Network
• Gomory cuts revisited
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Lift-and-project cuts for mixed integer convex programs
• Lift-and-project for mixed 0-1 programming: recent progress
• Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Mixing mixed-integer inequalities
• On the \(0/1\) knapsack polytope
• On the facial structure of set packing polyhedra
• On the separation of maximally violated mod-\(k\) cuts
• Optimization by simulated annealing
• Rescheduling rail networks with maintenance disruptions using problem space search
• Scheduling arc maintenance jobs in a network to maximize total flow over time
• Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
• Scheduling of railway track maintenance activities and crews
• Scheduling preventive railway maintenance activities
• Scheduling preventive railway maintenance activities with resource constraints
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Warm start of the primal-dual method applied in the cutting-plane scheme

Cited in

(1)

• A data-driven optimization approach for the integrated train scheduling and maintenance planning in high-speed railways

This page was built for publication: Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators

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