Data-driven Policy on Feasibility Determination for the Train Shunting Problem
Parking, matching, scheduling, and routing are common problems in train maintenance. In particular, train units are commonly maintained and cleaned at dedicated shunting yards. The planning problem that results from such situations is referred to as the Train Unit Shunting Problem (TUSP). This problem involves matching arriving train units to service tasks and determining the schedule for departing trains. The TUSP is an important problem as it is used to determine the capacity of shunting yards and arises as a sub-problem of more general scheduling and planning problems. In this paper, we consider the case of the Dutch Railways (NS) TUSP. As the TUSP is complex, NS currently uses a local search (LS) heuristic to determine if an instance of the TUSP has a feasible solution. Given the number of shunting yards and the size of the planning problems, improving the evaluation speed of the LS brings significant computational gain. In this work, we use a machine learning approach that complements the LS and accelerates the search process. We use a Deep Graph Convolutional Neural Network (DGCNN) model to predict the feasibility of solutions obtained during the run of the LS heuristic. We use this model to decide whether to continue or abort the search process. In this way, the computation time is used more efficiently as it is spent on instances that are more likely to be feasible. Using simulations based on real-life instances of the TUSP, we show how our approach improves upon the previous method on prediction accuracy and leads to computational gains for the decision-making process.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi-Step Bayesian Optimization for One-Dimensional Feasibility Determination
Bayesian optimization methods allocate limited sampling budgets to maximize expensive-to-evaluate functions. One-step-lookahead policies are often used, but computing optimal multi-step-lookahead policies remains a chall…
Bayesian OptimizationPolicy-driven Conformal Prediction for Trustworthy QoT Estimation
We propose Conformal QoT, a policy-driven framework that combines statistically guaranteed QoT estimation with operational decision policies, enabling reliable lightpath-feasibility predictions under domain shift and imp…
ScenePilot: Controllable Boundary-Driven Critical Scenario Generation for Autonomous Driving
Safety-critical scenarios are central to evaluating autonomous driving systems, yet their rarity in naturalistic logs makes simulation-based stress testing indispensable. Most scenario generation methods treat surroundin…
Reinforcement LearningAutonomous DrivingThe Feasibility of Constrained Reinforcement Learning Algorithms: A Tutorial Study
Satisfying safety constraints is a priority concern when solving optimal control problems (OCPs). Due to the existence of infeasibility phenomenon, where a constraint-satisfying solution cannot be found, it is necessary …
Model Predictive Controlreinforcement-learningReinforcement Learning (RL)Mapping the Intersection of Research and Policy in Centers for Medicare National Coverage Decision Memos
Evidence is a crucial component of federal policy, but the interactions between the various stakeholders involved in funding, producing, and using the results of scientific research, an important class of evidence, for f…
Articles