{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T05:09:57Z","timestamp":1746508197759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030857127"},{"type":"electronic","value":"9783030857134"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85713-4_23","type":"book-chapter","created":{"date-parts":[[2021,9,12]],"date-time":"2021-09-12T23:04:33Z","timestamp":1631487873000},"page":"237-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Train Route Planning as a Multi-agent Path Finding Problem"],"prefix":"10.1007","author":[{"given":"Mauricio","family":"Salerno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yolanda","family":"E-Mart\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raquel","family":"Fuentetaja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alba","family":"Gragera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Pozanco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Borrajo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Andreychuk, A., Yakovlev, K., Atzmon, D., Stern, R.: Multi-agent pathfinding with continuous time. In: Proceedings of IJCAI-19, pp. 39\u201345 (2019)","key":"23_CR1","DOI":"10.24963\/ijcai.2019\/6"},{"doi-asserted-by":"crossref","unstructured":"Atzmon, D., Diei, A., Rave, D.: Multi-train path finding. In: Proceedings of SOCS-19, pp. 125\u2013129 (2019)","key":"23_CR2","DOI":"10.1609\/socs.v10i1.18515"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.omega.2015.04.006","volume":"58","author":"V Cacchiani","year":"2015","unstructured":"Cacchiani, V., Furini, F., Kidd, M.: Approaches to a real-world train timetabling problem in a railway node. Omega 58, 97\u2013110 (2015)","journal-title":"Omega"},{"key":"23_CR4","first-page":"68","volume":"3","author":"T Dewilde","year":"2013","unstructured":"Dewilde, T., Sels, P., Cattrysse, D., Vansteenwegen, P.: Robust railway station planning: an interaction between routing, timetabling and platforming. J. Rail Transp. Plan. Manag. 3, 68\u201377 (2013)","journal-title":"J. Rail Transp. Plan. Manag."},{"doi-asserted-by":"crossref","unstructured":"Felner, A., et al.: Search-based optimal solvers for the multi-agent pathfinding problem: summary and challenges. In: Proceedings of SOCS-17, pp. 29\u201337 (2017)","key":"23_CR5","DOI":"10.1609\/socs.v8i1.18423"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ejor.2012.12.018","volume":"227","author":"J Fl\u00f3rez","year":"2013","unstructured":"Fl\u00f3rez, J., Torralba, A., Borrajo, D., Linares L\u00f3pez, C., Olaya, A., S\u00e1enz, J.: Combining linear programming and automated planning to solve intermodal transportation problems. Eur. J. Oper. Res. 227, 216\u2013226 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1009672832658","volume":"3","author":"A Higgins","year":"1997","unstructured":"Higgins, A., Kozan, E., Ferreira, L.: Heuristic techniques for single line train scheduling. J. Heuristics 3, 43\u201362 (1997)","journal-title":"J. Heuristics"},{"doi-asserted-by":"crossref","unstructured":"Li, J., Surynek, P., Felner, A., Ma, H., Kumar, T.S., Koeing, S.: Multi-agent path finding for large agents. In: Proceedings of AAAI-19, pp. 7627\u20137634 (2019)","key":"23_CR8","DOI":"10.1609\/aaai.v33i01.33017627"},{"doi-asserted-by":"crossref","unstructured":"Ma, H., Wagner, G., Felner, A., Li, J., Kumar, T., Koenig, S.: Multi-agent path finding with deadlines. In: Proceedings of IJCAI-18, pp. 417\u2013423 (2018)","key":"23_CR9","DOI":"10.24963\/ijcai.2018\/58"},{"unstructured":"Montigel, M.: Representation of track topologies with double vertex graphs. In: Computers in Railway, vol. 2 (1992)","key":"23_CR10"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.trc.2015.08.022","volume":"70","author":"P Murali","year":"2016","unstructured":"Murali, P., Ord\u00f3\u00f1ez, F., Dessouky, M.: Modeling strategies for effectively routing freight trains through complex networks. Transp. Res. Part C Emerg. Technol. 70, 197\u2013213 (2016)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.trc.2016.02.008","volume":"67","author":"H Pouryousef","year":"2016","unstructured":"Pouryousef, H., Lautala, P., Watkins, D.: Development of hybrid optimization of train schedules model for n-track rail corridors. Transp. Res. Part C Emerg. Technol. 67, 169\u2013192 (2016)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.trc.2016.05.020","volume":"69","author":"J Qi","year":"2016","unstructured":"Qi, J., Yang, L., Gao, Y., Li, S., Gao, Z.: Integrated multi-track station layout design and train scheduling models on railway corridors. Transp. Res. Part C Emerg. Technol. 69, 91\u2013119 (2016)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.trb.2006.02.006","volume":"41","author":"J Rodr\u00edguez","year":"2007","unstructured":"Rodr\u00edguez, J.: A constraint programming model for real-time train scheduling at junctions. Transp. Res. Part B Methodol. 41, 231\u2013245 (2007)","journal-title":"Transp. Res. Part B Methodol."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85713-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T01:24:13Z","timestamp":1673227453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85713-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030857127","9783030857134"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85713-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAEPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference of the Spanish Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"M\u00e1laga","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caepia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caepia2020.uma.es\/","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":"40","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":"25","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":"63% - 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":"3","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)"}},{"value":"The 2020 conference was cancelled due to COVID-19 and held together with CAEPIA 2021","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}