相关论文: An efficient memetic, permutation-based evolutiona…
The local reconstruction of a railway schedule following a small perturbation of the traffic, seeking minimization of the total accumulated delay, is a very difficult and tightly constrained combinatorial problem. Notoriously enough, the…
Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known technique designed for the specific problem in question while…
We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP). To this end, we pursue a hybrid approach that extends ASP with difference constraints to…
The train timetabling problem in liberalized railway markets represents a challenge to the coordination between infrastructure managers and railway undertakings. Efficient scheduling is critical to maximizing infrastructure capacity and…
This study introduces a novel methodology for managing train network disruptions across the entire rail network, leveraging digital tools and methodologies. The approach involves two stages, taking into account possible and practical…
In railway operations, a timetable is established to determine the departure and arrival times for the trains or other rolling stock at the different stations or relevant points inside the rail network or a subset of this network. The…
The railway timetables are designed in an optimal manner to maximize the capacity usage of the infrastructure concerning different objectives besides avoiding conflicts. The real-time railway traffic management problem occurs when the…
Periodic timetables are widely adopted in passenger railway operations due to their regular service patterns and well-coordinated train connections. However, fluctuations in passenger demand require varying train services across different…
Train timetable rescheduling (TTR) aims to promptly restore the original operation of trains after unexpected disturbances or disruptions. Currently, this work is still done manually by train dispatchers, which is challenging to maintain…
The design space of networked embedded systems is very large, posing challenges to the optimisation of such platforms when it comes to support applications with real-time guarantees. Recent research has shown that a number of inter-related…
Train scheduling is one of the significant issues in the railway industry in recent years since it has an important role in efficacy of railway infrastructure. In this paper, the timetabling problem of a multiple tracked railway network is…
This paper discusses various types of constraints, difficulties and solutions to overcome the challenges regarding university course allocation problem. A hybrid evolutionary algorithm has been defined combining Local Repair Algorithm and…
Line planning in public transport is the strategic problem of selecting lines and their operating frequencies. This problem is important as it defines the passenger service, based on available connections and expected travel times, and…
We address the applicability of a hybrid quantum-classical heuristics for practical railway rescheduling management problems. We build an integer linear programming model and solve it with D-Wave's quantum-classical hybrid solver (CQM) as…
This paper introduces a combined approach for the recovery of a timetable by rescheduling trips and vehicle circulations for a rail-based transportation system subject to disruptions. We propose a novel event-based integer programming (IP)…
The dispatch optimization of coal mine integrated energy system is challenging due to high dimensionality, strong coupling constraints, and multiobjective. Existing constrained multiobjective evolutionary algorithms struggle with locating…
Machine Reassignment is a challenging problem for constraint programming (CP) and mixed-integer linear programming (MILP) approaches, especially given the size of data centres. The multi-objective version of the Machine Reassignment Problem…
We investigate the stochastic transfer synchronization problem, which seeks to synchronize the timetables of different routes in a transit network to reduce transfer waiting times, delay times, and unnecessary in-vehicle times. We present a…
Optimization-based decision support systems have a significant potential to reduce delays, and thus improve efficiency on the railways, by automatically re-routing and re-scheduling trains after delays have occurred. The operations research…
In this study, the periodic train timetabling problem is formulated using a time-space graph formulation. Three solution methods are proposed and compared where solutions are built by what we define as a dive-and-cut-and-price procedure. An…