Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling

DOI10.1016/j.ejor.2021.01.006zbMath1487.90315OpenAlexW3044825031MaRDI QIDQ2030368

Julian Reisch, Daniel Pöhle, Natalia Kliewer, Peter Großmann

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://refubium.fu-berlin.de/handle/fub188/27849

zbMATH Keywords

heuristicstimetablingrailways

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A novel mixed integer programming model for freight train travel time estimation

Uses Software

• OEIS
• BHOSLIB

Cites Work

• Optimization by Simulated Annealing
• Fast local search for the maximum independent set problem
• Non-cyclic train timetabling and comparability graphs
• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Modelling and Solving a Train Path Assignment Model
• Models for Railway Track Allocation
• Modeling and Solving the Train Timetabling Problem
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Formal-Language-Constrained Path Problems

This page was built for publication: Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling