Abstract
The real-time Train Routing Selection Problem (rtTRSP) is the combinatorial optimization problem of selecting, for each train in a rail network, the best routing alternatives. Solving the rtTRSP aims to limit the search space of train rescheduling problems, highly affected by the number of routing variables. The rtTRSP is modelled as the minimum weight clique problem in an undirected k-partite graph. This problem is NP-hard and the problem size strongly affects the time required to compute optimal solutions. A sequential version of the Ant Colony Optimization (ACO) for the rtTRSP has been proposed in the literature. However, in large instances the algorithm struggles to find high-quality solutions. This paper proposes the performance evaluation of a parallel ACO for large rtTRSP instances. Specifically, we analyze the performance of the algorithm by standard parallel metrics. In addition, we test two parallel local search strategies, which consider different solution neighbourhoods. Computational experiments are performed on the practical case study of Lille Flandres station area in France. The results show a significant speed-up of the rtTRSP search space exploration and more promising diversification patterns. Both these improvements enhance the rtTRSP solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bettinelli, A., Santini, A., Vigo, D.: A real-time conflict solution algorithm for the train rescheduling problem. Transp. Res. Part B 106, 237–265 (2017)
Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1–74. Springer, Boston (1999). https://doi.org/10.1007/978-1-4757-3023-4_1
Cacchiani, V., et al.: An overview of recovery models and algorithms for real-time railway rescheduling. Transp. Res. Part B 63, 15–37 (2014)
Cai, S., Lin, J.: Fast solving maximum weight clique problem in massive graphs. In: IJCAI, pp. 568–574 (2016)
Caimi, G., Chudak, F., Fuchsberger, M., Laumanns, M., Zenklusen, R.: A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transp. Sci. 45(2), 212–227 (2011)
Chapman, B., Jost, G., Van Der Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming, vol. 10. MIT Press, Cambridge (2008)
Corman, F., D’Ariano, A., Pacciarelli, D., Pranzo, M.: Evaluation of green wave policy in real-time railway traffic management. Transp. Res. Part C 17(6), 607–616 (2009)
Corman, F., D’Ariano, A., Pacciarelli, D., Pranzo, M.: A tabu search algorithm for rerouting trains during rail operations. Transp. Res. Part B 44(1), 175–192 (2010)
D’Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183(2), 643–657 (2007)
Dang, D.C., Moukrim, A.: Subgraph extraction and metaheuristics for the maximum clique problem. J. Heuristics 18(5), 767–794 (2012). https://doi.org/10.1007/s10732-012-9207-5
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Fischetti, M., Monaci, M.: Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling. Eur. J. Oper. Res. 263(1), 258–264 (2017)
Gimadi, E.K., Kel’manov, A.V., Pyatkin, A.V., Khachai, M.Y.: Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph. Proc. Steklov Inst. Math. 289(1), 88–101 (2015). https://doi.org/10.1134/S0081543815050089
He, G., Liu, J., Zhao, C.: Approximation algorithms for some graph partitioning problems. In: Graph Algorithms and Applications, vol. 2, pp. 21–31 (2004)
Hosseinian, S., Fontes, D.B.M.M., Butenko, S., Nardelli, M.B., Fornari, M., Curtarolo, S.: The maximum edge weight clique problem: formulations and solution approaches. In: Butenko, S., Pardalos, P.M., Shylo, V. (eds.) Optimization Methods and Applications. SOIA, vol. 130, pp. 217–237. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68640-0_10
Hudry, O.: Application of the descent with mutations metaheuristic to a clique partitioning problem. RAIRO-Oper. Res. 53(3), 1083–1095 (2019)
Karp, A.H., Flatt, H.P.: Measuring parallel processor performance. Commun. ACM 33(5), 539–543 (1990)
Kroon, L.G., Romeijn, H.E., Zwaneveld, P.J.: Routing trains through railway stations: complexity issues. Eur. J. Oper. Res. 98(3), 485–498 (1997)
Kumlander, D.: A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. In Proceedings of 5th International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 202–208 (2004)
Mascis, A., Pacciarelli, D.: Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3), 498–517 (2002)
Pascariu, B., Samà, M., Pellegrini, P., D’Ariano, A., Pacciarelli, D., Rodriguez, J.: Train routing selection problem: ant colony optimization versus integer linear programming. IFAC-PapersOnLine 54(2), 167–172 (2021)
Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft Comput. 11(8), 5181–5197 (2011)
Pellegrini, P., Marlière, G., Rodriguez, J.: Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transp. Res. Part B 59(1), 58–80 (2014)
Pullan, W.: Approximating the maximum vertex/edge weighted clique using local search. J. Heuristics 14(2), 117–134 (2008). https://doi.org/10.1007/s10732-007-9026-2
Pellegrini, P., Presenti, R., Rodriguez, J.: Efficient train re-routing and rescheduling: valid inequalities and reformulation of RECIFE-MILP. Transp. Res. Part B 120(1), 33–48 (2019)
Samà, M., Pellegrini, P., D’Ariano, A., Rodriguez, J., Pacciarelli, D.: Ant colony optimization for the real-time train routing selection problem. Transp. Res. Part B 85(1), 89–108 (2016)
Samà, M., D’Ariano, A., Corman, F., Pacciarelli, D.: A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations. Comput. Oper. Res. 78, 480–499 (2017)
Solano, G., Blin, G., Raffinot, M., Clemente, J.B., Caro, J.: On the approximability of the minimum weight t-partite clique problem. J. Graph Algorithms Appl. 24(3), 171–190 (2020)
Solnon, C., Bridge, D.: An ant colony optimization meta-heuristic for subset selection problems. In: System Engineering Using Particle Swarm Optimization, pp. 7–29. Nova Science Publisher (2006)
Sørensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Eur. J. Oper. Res. 154(1), 57–70 (2004)
Stützle, T., Hoos, H.H.: MAX-MIN ant system. Future Gener. Comput. Syst. 16(8), 889–914 (2000)
Wu, Q., Spiryagin, M., Cole, C., McSweeney, T.: Parallel computing in railway research. Int. J. Rail Transp. 8(2), 111–134 (2020)
Acknowledgements
This work was supported by the “SPECIES Scholarships” with a three-month mobility grant for Ph.D. candidates.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Pascariu, B., Samà, M., Pellegrini, P., D’Ariano, A., Rodriguez, J., Pacciarelli, D. (2022). Performance Evaluation of a Parallel Ant Colony Optimization for the Real-Time Train Routing Selection Problem in Large Instances. In: Pérez Cáceres, L., Verel, S. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2022. Lecture Notes in Computer Science, vol 13222. Springer, Cham. https://doi.org/10.1007/978-3-031-04148-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-04148-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-04147-1
Online ISBN: 978-3-031-04148-8
eBook Packages: Computer ScienceComputer Science (R0)