Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances
DOI10.1007/978-3-031-04148-8_4zbMath1499.90047OpenAlexW4226333897MaRDI QIDQ2163779
Paola Pellegrini, B. Pascariu, Dario Pacciarelli, Joaquin Rodriguez, Andrea D'Ariano, Marcella Samà
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-04148-8_4
parallel computingant colony optimizationrail transportationscheduling and optimization of transportation systems
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- Approximating the maximum vertex/edge weighted clique using local search
- Routing trains through railway stations: Complexity issues
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
- Job-shop scheduling with blocking and no-wait constraints
- Subgraph extraction and metaheuristics for the maximum clique problem
- A branch and bound algorithm for scheduling trains in a railway network
- On the Approximability of the Minimum Weight $t$-partite Clique Problem
- Application of the “descent with mutations” metaheuristic to a clique partitioning problem
This page was built for publication: Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances
