Related papers: An approach to the timetabling problem in deregulated railway markets based on metaheuristic algorithms

Related papers

A Temporal Planning Framework for Disruption Aware Dynamic Route Optimization in Heterogeneous Railway Systems [0.0]
This study proposes a framework based on temporal planning for dynamic route optimization and disruption management.<n>It generates conflict-free timestamped operational plans specifying both optimized schedules and executable action sequences.
arXiv Detail & Related papers (2026-06-12T16:00:31Z)
Towards Autonomous Railway Operations: A Semi-Hierarchical Deep Reinforcement Learning Approach to the Vehicle Rescheduling Problem [1.0348904561315861]
Managing disruptions in railway traffic management is a major challenge.<n>Rising traffic density and infrastructure limits increase complexity.<n>Most dispatching still relies on human expertise due to the problem's exponential complexity.<n>This paper introduces a semi-hierarchical RL formulation tailored to operational constraints.
arXiv Detail & Related papers (2026-05-11T09:23:50Z)
SOPE: Stabilizing Off-Policy Evaluation for Online RL with Prior Data [49.370849653460716]
We propose SOPE, an algorithm that uses an actor-aligned Off-Policy Policy Evaluation signal as an automated early-stopping mechanism.<n> evaluated on 25 continuous control tasks from the Minari benchmark suite.<n>SOPE improves baseline performance by up to 45.6% while reducing the required TFLOPs by up to 22x.
arXiv Detail & Related papers (2026-05-07T08:32:09Z)
AutoOR: Scalably Post-training LLMs to Autoformalize Operations Research Problems [54.593031581486116]
We present AutoOR, a scalable synthetic data generation and reinforcement learning pipeline that trains LLMs to autoformalize optimization problems specified in natural language.<n>AutoOR generates verified training data from standard optimization forms and uses solver execution feedback as the reward signal for RL post-training.<n>We believe that methods such as AutoOR can significantly accelerate industrial decision-making with AI.
arXiv Detail & Related papers (2026-04-18T03:24:54Z)
Self-Organizing Railway Traffic Management [0.6157382820537719]
We design and implement a modular process to allow trains to self-organize.<n>We compare the results of self-organization with those of a state-of-the-art centralized approach.
arXiv Detail & Related papers (2026-01-15T14:48:13Z)
Efficient Split Federated Learning for Large Language Models over Communication Networks [45.02252893286613]
Fine-tuning pre-trained large language models (LLMs) in a distributed manner poses significant challenges on resource-constrained edge networks.<n>We propose SflLLM, a novel framework that integrates split federated learning with parameter-efficient fine-tuning techniques.<n>By leveraging model splitting and low-rank adaptation (LoRA), SflLLM reduces the computational burden on edge devices.
arXiv Detail & Related papers (2025-04-20T16:16:54Z)
Accelerating Vehicle Routing via AI-Initialized Genetic Algorithms [55.78505925402658]
Vehicle Routing Problems (VRP) are an extension of the Traveling Salesperson Problem and are a fundamental NP-hard challenge in Evolutionary optimization.<n>We introduce a novel optimization framework that uses a reinforcement learning agent - trained on prior instances - to quickly generate initial solutions, which are then further optimized by genetic algorithms.<n>For example, EARLI handles vehicle routing with 500 locations within 1s, 10x faster than current solvers for the same solution quality, enabling applications like real-time and interactive routing.
arXiv Detail & Related papers (2025-04-08T15:21:01Z)
Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach [51.76826149868971]
Policy evaluation via Monte Carlo simulation is at the core of many MC Reinforcement Learning (RL) algorithms. We propose as a quality index a surrogate of the mean squared error of a return estimator that uses trajectories of different lengths. We present an adaptive algorithm called Robust and Iterative Data collection strategy Optimization (RIDO)
arXiv Detail & Related papers (2024-10-17T11:47:56Z)
A Graph-based Adversarial Imitation Learning Framework for Reliable & Realtime Fleet Scheduling in Urban Air Mobility [5.19664437943693]
This paper presents a comprehensive optimization formulation of the fleet scheduling problem. It also identifies the need for alternate solution approaches. The new imitative approach achieves better mean performance and remarkable improvement in the case of unseen worst-case scenarios.
arXiv Detail & Related papers (2024-07-16T18:51:24Z)
A Data-driven Resilience Framework of Directionality Configuration based on Topological Credentials in Road Networks [0.5154704494242526]
This paper presents a novel roadway reconfiguration technique by integrating optimization based Brute Force search approach and decision support framework. The proposed framework incorporates a multi-criteria decision analysis approach, combining input from generated scenarios during the optimization process. To rank the roadway configurations, the framework employs machine learning algorithms, such as ridge regression, to determine the optimal weights for each criterion.
arXiv Detail & Related papers (2024-01-14T21:22:22Z)
Boosting Column Generation with Graph Neural Networks for Joint Rider Trip Planning and Crew Shift Scheduling [17.483751895564676]
This paper introduces the Joint Rider Trip Planning and Crew Shift Scheduling Problem (JRTPCSSP) and a novel solution method, called Attention and Gated GNN-Informed Column Generation (AGGNNI-CG)<n>AGGNNI-CG hybridizes column generation and machine learning to obtain near-optimal solutions to the JRTPCSSP with real-life constraints of the application.<n>AGGNNI-CG has been applied to a challenging, real-world dataset from the Paratransit system of Chatham County in Georgia.
arXiv Detail & Related papers (2024-01-08T06:46:39Z)
A Unifying Variational Framework for Gaussian Process Motion Planning [44.332875416815384]
We introduce a framework for robot motion planning based on variational Gaussian processes. Our framework provides a principled and flexible way to incorporate equality-based, inequality-based, and soft motion-planning constraints. Results show that our proposed approach yields a good balance between success rates and path quality.
arXiv Detail & Related papers (2023-09-02T07:51:29Z)
A Mobile Data-Driven Hierarchical Deep Reinforcement Learning Approach for Real-time Demand-Responsive Railway Rescheduling and Station Overcrowding Mitigation [11.10169568480794]
Real-time railway rescheduling is an important technique to enable operational recovery in response to unexpected and dynamic conditions. Disastrous situations such as flood in Zhengzhou, China in 2022 has created not only unprecedented effect on Zhengzhou railway station itself, but also other major hubs. In this study, we define a real-time demand-responsive (RTDR) railway rescheduling problem focusing two specific aspects, namely, volatility of demand, and management of station crowdedness.
arXiv Detail & Related papers (2023-08-23T00:55:39Z)
Network-Aided Intelligent Traffic Steering in 6G O-RAN: A Multi-Layer Optimization Framework [47.57576667752444]
We jointly optimize the flow-split distribution, congestion control and scheduling (JFCS) to enable an intelligent steering application in open RAN (O-RAN) Our main contributions are three-fold: i) we propose the novel JFCS framework to efficiently and adaptively direct traffic to appropriate radio units; ii) we develop low-complexity algorithms based on the reinforcement learning, inner approximation and bisection search methods to effectively solve the JFCS problem in different time scales; and iv) the rigorous theoretical performance results are analyzed to show that there exists a scaling factor to improve the tradeoff between delay and utility-optimization
arXiv Detail & Related papers (2023-02-06T11:37:06Z)
Approaching sales forecasting using recurrent neural networks and transformers [57.43518732385863]
We develop three alternatives to tackle the problem of forecasting the customer sales at day/store/item level using deep learning techniques. Our empirical results show how good performance can be achieved by using a simple sequence to sequence architecture with minimal data preprocessing effort. The proposed solution achieves a RMSLE of around 0.54, which is competitive with other more specific solutions to the problem proposed in the Kaggle competition.
arXiv Detail & Related papers (2022-04-16T12:03:52Z)
Railway Operation Rescheduling System via Dynamic Simulation and Reinforcement Learning [13.333957453318742]
The number of railway service disruptions has been increasing owing to intensification of natural disasters. abrupt changes in social situations such as the COVID-19 pandemic require railway companies to modify the traffic schedule frequently. The proposed system enables rapid generation of the traffic schedule of a whole line because the optimization process is conducted in advance as the training.
arXiv Detail & Related papers (2022-01-17T08:40:01Z)
Value Function is All You Need: A Unified Learning Framework for Ride Hailing Platforms [57.21078336887961]
Large ride-hailing platforms, such as DiDi, Uber and Lyft, connect tens of thousands of vehicles in a city to millions of ride demands throughout the day. We propose a unified value-based dynamic learning framework (V1D3) for tackling both tasks.
arXiv Detail & Related papers (2021-05-18T19:22:24Z)
Better than the Best: Gradient-based Improper Reinforcement Learning for Network Scheduling [60.48359567964899]
We consider the problem of scheduling in constrained queueing networks with a view to minimizing packet delay. We use a policy gradient based reinforcement learning algorithm that produces a scheduler that performs better than the available atomic policies.
arXiv Detail & Related papers (2021-05-01T10:18:34Z)
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World [49.80905654161763]
The Flatland competition aimed at finding novel approaches to solve the vehicle re-scheduling problem (VRSP) The VRSP is concerned with scheduling trips in traffic networks and the re-scheduling of vehicles when disruptions occur. The ever-growing complexity of modern railway networks makes dynamic real-time scheduling of traffic virtually impossible.
arXiv Detail & Related papers (2021-03-30T17:13:29Z)
Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines [0.4724825031148411]
We consider a practical railway dispatching problem: delay and conflict management on a single-track railway line. We introduce a quadratic unconstrained binary optimization (QUBO) model of the problem in question, compatible with the emerging quantum annealing technology. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers.
arXiv Detail & Related papers (2020-10-16T08:17:57Z)
Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
arXiv Detail & Related papers (2020-07-14T12:38:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.