{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:45:21Z","timestamp":1742942721940,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031041471"},{"type":"electronic","value":"9783031041488"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04148-8_4","type":"book-chapter","created":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:02:31Z","timestamp":1649008951000},"page":"46-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Performance Evaluation of\u00a0a\u00a0Parallel Ant Colony Optimization for\u00a0the\u00a0Real-Time Train Routing Selection Problem in\u00a0Large Instances"],"prefix":"10.1007","author":[{"given":"Bianca","family":"Pascariu","sequence":"first","affiliation":[]},{"given":"Marcella","family":"Sam\u00e0","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Pellegrini","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"D\u2019Ariano","sequence":"additional","affiliation":[]},{"given":"Joaquin","family":"Rodriguez","sequence":"additional","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.trb.2017.10.005","volume":"106","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Santini, A., Vigo, D.: A real-time conflict solution algorithm for the train rescheduling problem. Transp. Res. Part B 106, 237\u2013265 (2017)","journal-title":"Transp. Res. Part B"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"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\u201374. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_1"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.trb.2014.01.009","volume":"63","author":"V Cacchiani","year":"2014","unstructured":"Cacchiani, V., et al.: An overview of recovery models and algorithms for real-time railway rescheduling. Transp. Res. Part B 63, 15\u201337 (2014)","journal-title":"Transp. Res. Part B"},{"key":"4_CR4","unstructured":"Cai, S., Lin, J.: Fast solving maximum weight clique problem in massive graphs. In: IJCAI, pp. 568\u2013574 (2016)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.1100.0349","volume":"45","author":"G Caimi","year":"2011","unstructured":"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\u2013227 (2011)","journal-title":"Transp. Sci."},{"key":"4_CR6","volume-title":"Using OpenMP: Portable Shared Memory Parallel Programming","author":"B Chapman","year":"2008","unstructured":"Chapman, B., Jost, G., Van Der Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming, vol. 10. MIT Press, Cambridge (2008)"},{"issue":"6","key":"4_CR7","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.trc.2009.04.001","volume":"17","author":"F Corman","year":"2009","unstructured":"Corman, F., D\u2019Ariano, A., Pacciarelli, D., Pranzo, M.: Evaluation of green wave policy in real-time railway traffic management. Transp. Res. Part C 17(6), 607\u2013616 (2009)","journal-title":"Transp. Res. Part C"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.trb.2009.05.004","volume":"44","author":"F Corman","year":"2010","unstructured":"Corman, F., D\u2019Ariano, A., Pacciarelli, D., Pranzo, M.: A tabu search algorithm for rerouting trains during rail operations. Transp. Res. Part B 44(1), 175\u2013192 (2010)","journal-title":"Transp. Res. Part B"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.ejor.2006.10.034","volume":"183","author":"A D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183(2), 643\u2013657 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"4_CR10","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10732-012-9207-5","volume":"18","author":"DC Dang","year":"2012","unstructured":"Dang, D.C., Moukrim, A.: Subgraph extraction and metaheuristics for the maximum clique problem. J. Heuristics 18(5), 767\u2013794 (2012). https:\/\/doi.org\/10.1007\/s10732-012-9207-5","journal-title":"J. Heuristics"},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ejor.2017.04.057","volume":"263","author":"M Fischetti","year":"2017","unstructured":"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\u2013264 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1134\/S0081543815050089","volume":"289","author":"EK Gimadi","year":"2015","unstructured":"Gimadi, E.K., Kel\u2019manov, 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\u2013101 (2015). https:\/\/doi.org\/10.1134\/S0081543815050089","journal-title":"Proc. Steklov Inst. Math."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"He, G., Liu, J., Zhao, C.: Approximation algorithms for some graph partitioning problems. In: Graph Algorithms and Applications, vol. 2, pp. 21\u201331 (2004)","DOI":"10.1142\/9789812794741_0002"},{"key":"4_CR15","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-68640-0_10","volume-title":"Optimization Methods and Applications","author":"S Hosseinian","year":"2017","unstructured":"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\u2013237. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68640-0_10"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1051\/ro\/2018048","volume":"53","author":"O Hudry","year":"2019","unstructured":"Hudry, O.: Application of the descent with mutations metaheuristic to a clique partitioning problem. RAIRO-Oper. Res. 53(3), 1083\u20131095 (2019)","journal-title":"RAIRO-Oper. Res."},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1145\/78607.78614","volume":"33","author":"AH Karp","year":"1990","unstructured":"Karp, A.H., Flatt, H.P.: Measuring parallel processor performance. Commun. ACM 33(5), 539\u2013543 (1990)","journal-title":"Commun. ACM"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0377-2217(95)00342-8","volume":"98","author":"LG Kroon","year":"1997","unstructured":"Kroon, L.G., Romeijn, H.E., Zwaneveld, P.J.: Routing trains through railway stations: complexity issues. Eur. J. Oper. Res. 98(3), 485\u2013498 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR19","unstructured":"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\u2013208 (2004)"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., Pacciarelli, D.: Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3), 498\u2013517 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ifacol.2021.06.060","volume":"54","author":"B Pascariu","year":"2021","unstructured":"Pascariu, B., Sam\u00e0, M., Pellegrini, P., D\u2019Ariano, A., Pacciarelli, D., Rodriguez, J.: Train routing selection problem: ant colony optimization versus integer linear programming. IFAC-PapersOnLine 54(2), 167\u2013172 (2021)","journal-title":"IFAC-PapersOnLine"},{"issue":"8","key":"4_CR22","doi-asserted-by":"publisher","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Appl. Soft Comput. 11(8), 5181\u20135197 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.trb.2013.10.013","volume":"59","author":"P Pellegrini","year":"2014","unstructured":"Pellegrini, P., Marli\u00e8re, G., Rodriguez, J.: Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transp. Res. Part B 59(1), 58\u201380 (2014)","journal-title":"Transp. Res. Part B"},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W Pullan","year":"2008","unstructured":"Pullan, W.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heuristics 14(2), 117\u2013134 (2008). https:\/\/doi.org\/10.1007\/s10732-007-9026-2","journal-title":"J. Heuristics"},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.trb.2018.12.008","volume":"120","author":"P Pellegrini","year":"2019","unstructured":"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\u201348 (2019)","journal-title":"Transp. Res. Part B"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.trb.2016.01.005","volume":"85","author":"M Sam\u00e0","year":"2016","unstructured":"Sam\u00e0, M., Pellegrini, P., D\u2019Ariano, A., Rodriguez, J., Pacciarelli, D.: Ant colony optimization for the real-time train routing selection problem. Transp. Res. Part B 85(1), 89\u2013108 (2016)","journal-title":"Transp. Res. Part B"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.cor.2016.02.008","volume":"78","author":"M Sam\u00e0","year":"2017","unstructured":"Sam\u00e0, M., D\u2019Ariano, 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\u2013499 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"171","DOI":"10.7155\/jgaa.00525","volume":"24","author":"G Solano","year":"2020","unstructured":"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\u2013190 (2020)","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR29","unstructured":"Solnon, C., Bridge, D.: An ant colony optimization meta-heuristic for subset selection problems. In: System Engineering Using Particle Swarm Optimization, pp. 7\u201329. Nova Science Publisher (2006)"},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM S\u00f8rensen","year":"2004","unstructured":"S\u00f8rensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Eur. J. Oper. Res. 154(1), 57\u201370 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"4_CR31","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"4_CR32","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1080\/23248378.2018.1553115","volume":"8","author":"Q Wu","year":"2020","unstructured":"Wu, Q., Spiryagin, M., Cole, C., McSweeney, T.: Parallel computing in railway research. Int. J. Rail Transp. 8(2), 111\u2013134 (2020)","journal-title":"Int. J. Rail Transp."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04148-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:03:12Z","timestamp":1649008992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04148-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031041471","9783031041488"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04148-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}