{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:29:55Z","timestamp":1775032195607,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030430238","type":"print"},{"value":"9783030430245","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43024-5_14","type":"book-chapter","created":{"date-parts":[[2020,3,8]],"date-time":"2020-03-08T20:02:15Z","timestamp":1583697735000},"page":"225-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Freight Train Scheduling in Railway Systems"],"prefix":"10.1007","author":[{"given":"Rebecca","family":"Haehn","sequence":"first","affiliation":[]},{"given":"Erika","family":"\u00c1brah\u00e1m","sequence":"additional","affiliation":[]},{"given":"Nils","family":"Nie\u00dfen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"14_CR1","unstructured":"Bornd\u00f6rfer, R., F\u00fcgenschuh, A., Klug, T., Schang, T., Schlechte, T., Sch\u00fclldorf, H.: The freight train routing problem. Technical Report 13-36, ZIB (2013)"},{"issue":"8","key":"14_CR2","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.trb.2009.02.005","volume":"43","author":"R Burdett","year":"2009","unstructured":"Burdett, R., Kozan, E.: Techniques for inserting additional trains into existing timetables. Transp. Res. Part B Methodol. 43(8), 821\u2013836 (2009)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10288-007-0037-5","volume":"6","author":"V Cacchiani","year":"2008","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: A column generation approach to train timetabling on a corridor. 4OR 6(2), 125\u2013142 (2008). \nhttps:\/\/doi.org\/10.1007\/s10288-007-0037-5","journal-title":"4OR"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.trb.2009.07.007","volume":"44","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Scheduling extra freight trains on railway networks. Transp. Res. Part B Methodol. 44(2), 215\u2013231 (2010)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I Chabini","year":"1998","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time. Transp. Res. Rec. 1645(1), 170\u2013175 (1998)","journal-title":"Transp. Res. Rec."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/net.20013","volume":"44","author":"BC Dean","year":"2004","unstructured":"Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44, 41\u201346 (2004)","journal-title":"Networks"},{"key":"14_CR7","unstructured":"Deutsche Bahn, A.G.: Energy efficiency increased. \nhttps:\/\/ib.deutschebahn.com\/ib2016\/en\/group-management-report\/group-performance-environmental-dimension\/progress-in-climate-protection\/energy-efficiency-increased\/\n\n. Accessed 13 Nov 2019"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"17","key":"14_CR9","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.4236\/am.2014.517264","volume":"5","author":"N El-Sherbeny","year":"2014","unstructured":"El-Sherbeny, N.: The algorithm of the time-dependent shortest path problem with time windows. Appl. Math. 5(17), 2764\u20132770 (2014)","journal-title":"Appl. Math."},{"issue":"3","key":"14_CR10","first-page":"47","volume":"3","author":"N El-Sherbeny","year":"2015","unstructured":"El-Sherbeny, N.: The dynamic sortest path problems of minimum cost length time windows and time-varying costs. Int. J. Sci. Innov. Math. Res. 3(3), 47\u201355 (2015)","journal-title":"Int. J. Sci. Innov. Math. Res."},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/70.388776","volume":"11","author":"K Fujimura","year":"1995","unstructured":"Fujimura, K.: Time-minimum routes in time-dependent networks. IEEE Trans. Rob. Autom. 11(3), 343\u2013351 (1995)","journal-title":"IEEE Trans. Rob. Autom."},{"issue":"3","key":"14_CR12","first-page":"117","volume":"21","author":"J Halpern","year":"1977","unstructured":"Halpern, J.: Shortest route with time dependent length of edges and limited delay possibilities in nodes. Zeitschrift f\u00fcr Oper. Res. 21(3), 117\u2013124 (1977)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/net.3230040304","volume":"4","author":"J Halpern","year":"1974","unstructured":"Halpern, J., Priess, I.: Shortest path with time constraints on movement and parking. Networks 4(3), 241\u2013253 (1974)","journal-title":"Networks"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607\u2013625 (1990)","journal-title":"J. ACM"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks 21(3), 295\u2013319 (1991)","journal-title":"Networks"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/net.21511","volume":"62","author":"LDP Pugliese","year":"2013","unstructured":"Pugliese, L.D.P., Guerriero, F.: A survey of resource constrained shortest path problems: Exact solution approaches. Networks 62(3), 183\u2013200 (2013)","journal-title":"Networks"},{"key":"14_CR17","unstructured":"Statistisches Bundesamt: Bef\u00f6rderungsmenge und Bef\u00f6rderungsleistung nach Verkehrstr\u00e4gern (in German). \nhttps:\/\/www.destatis.de\/DE\/Themen\/Branchen-Unternehmen\/Transport-Verkehr\/Gueterverkehr\/Tabellen\/gueterbefoerderung-lr.html\n\n. Accessed 24 June 2019"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/net.21856","volume":"73","author":"BW Thomas","year":"2019","unstructured":"Thomas, B.W., Calogiuri, T., Hewitt, M.: An exact bidirectional A* approach for solving resource-constrained shortest path problems. Networks 73(2), 187\u2013205 (2019)","journal-title":"Networks"},{"key":"14_CR19","unstructured":"Union Internationale des Chemins de fer: UIC Code 406, Capacity (2004)"},{"key":"14_CR20","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-319-00795-3_69","volume-title":"Operations Research Proceedings 2012","author":"R Wei\u00df","year":"2014","unstructured":"Wei\u00df, R., Opitz, J., Nachtigall, K.: A novel approach to strategic planning of rail freight transport. In: Helber, S., et al. (eds.) Operations Research Proceedings 2012. ORP, pp. 463\u2013468. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-00795-3_69"}],"container-title":["Lecture Notes in Computer Science","Measurement, Modelling and Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43024-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,8]],"date-time":"2020-03-08T20:04:45Z","timestamp":1583697885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43024-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030430238","9783030430245"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43024-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Measurement, Modelling and Evaluation of Computing Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saarbr\u00fccken","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mmb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mmb2020.de\/","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":"32","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":"16","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":"50% - 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.375","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.27","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)"}}]}}