{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:40:09Z","timestamp":1749508809629,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030779603"},{"type":"electronic","value":"9783030779610"}],"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-77961-0_15","type":"book-chapter","created":{"date-parts":[[2021,6,10]],"date-time":"2021-06-10T19:07:58Z","timestamp":1623352078000},"page":"168-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Hybrid Planning Framework for In-Station Train Dispatching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3788-9475","authenticated-orcid":false,"given":"Matteo","family":"Cardellini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9034-2527","authenticated-orcid":false,"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-3570","authenticated-orcid":false,"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Boleto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8445-395X","authenticated-orcid":false,"given":"Luca","family":"Oneto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abels, D., Jordi, J., Ostrowski, M., Schaub, T., Toletti, A., Wanko, P.: Train scheduling with hybrid answer set programming. In: Theory and Practice of Logic Programming, pp. 1\u201331 (2020)","DOI":"10.1017\/S1471068420000046"},{"key":"15_CR2","unstructured":"Bryan, J., Weisbrod, G.E., Martland, C.D.: Rail freight solutions to roadway congestion: final report and guidebook. Transp. Res. Board (2007)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cardellini, M., Maratea, M., Vallati, M., Boleto, G., Oneto, L.: In-station train dispatching: a PDDL+ planning approach. In: Proceedings of ICAPS (2021)","DOI":"10.1609\/icaps.v31i1.15991"},{"key":"15_CR4","unstructured":"Cushing, W., Kambhampati, S., Weld, D.S.: When is temporal planning really temporal? In: Proceedings of IJCAI, pp. 1852\u20131859 (2007)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1613\/jair.2044","volume":"27","author":"M Fox","year":"2006","unstructured":"Fox, M., Long, D.: Modelling mixed discrete-continuous domains for planning. J. Artif. Intell. Res. 27, 235\u2013297 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1613\/jair.3643","volume":"44","author":"M Fox","year":"2012","unstructured":"Fox, M., Long, D., Magazzeni, D.: Plan-based policies for efficient multiple battery load management. J. Artif. Intell. Res. 44, 335\u2013382 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR7","volume-title":"Automated Planning: Theory & Practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers, Burlington (2004)"},{"issue":"6","key":"15_CR8","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/inte.2018.0950","volume":"48","author":"R Kumar","year":"2018","unstructured":"Kumar, R., Sen, G., Kar, S., Tiwari, M.K.: Station dispatching problem for a large terminal: a constraint programming approach. Interfaces 48(6), 510\u2013528 (2018)","journal-title":"Interfaces"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/opre.2014.1327","volume":"63","author":"L Lamorgese","year":"2015","unstructured":"Lamorgese, L., Mannino, C.: An exact decomposition approach for the real-time train dispatching problem. Oper. Res. 63(1), 48\u201364 (2015)","journal-title":"Oper. Res."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-46767-X_28","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer set planning. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 373\u2013374. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46767-X_28"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1287\/opre.1080.0642","volume":"57","author":"C Mannino","year":"2009","unstructured":"Mannino, C., Mascis, A.: Optimal real-time traffic control in metro stations. Oper. Res. 57(4), 1026\u20131039 (2009)","journal-title":"Oper. Res."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"McCluskey, T.L., Vallati, M.: Embedding automated planning within urban traffic management operations. In: Proceedings of ICAPS, pp. 391\u2013399 (2017)","DOI":"10.1609\/icaps.v27i1.13842"},{"key":"15_CR13","unstructured":"Mcdermott, D., et al.: PDDL - The Planning Domain Definition Language. Technical report, Yale Center for Computational Vision and Control (1998)"},{"key":"15_CR14","unstructured":"Ram\u00edrez, M., et al.: Integrated hybrid planning and programmed control for real time UAV maneuvering. In: Proceedings of AAMAS, pp. 1318\u20131326 (2018)"},{"key":"15_CR15","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S., Ram\u00edrez, M.: Interval-based relaxation for general numeric planning. In: Proceedings of ECAI, pp. 655\u2013663 (2016)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1613\/jair.1.11875","volume":"68","author":"E Scala","year":"2020","unstructured":"Scala, E., Haslum, P., Thi\u00e9baux, S., Ram\u00edrez, M.: Subgoaling techniques for satisficing and optimal numeric planning. J. Artif. Intell. Res. 68, 691\u2013752 (2020)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77961-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:03:46Z","timestamp":1749506626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77961-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030779603","9783030779610"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77961-0_15","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":"9 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"16 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"156","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":"48","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":"14","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":"31% - 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":"2.8","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":"3.9","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212 full and 43 short papers were selected from 479 submissions to the workshops\/ thematic tracks. The conference was held virtually.","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)"}}]}}