{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T03:28:42Z","timestamp":1773545322245,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642200083","type":"print"},{"value":"9783642200090","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_38","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"239-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Evacuation Solutions for Large-Scale Scenarios"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Dressler","sequence":"first","affiliation":[]},{"given":"Gunnar","family":"Fl\u00f6tter\u00f6d","sequence":"additional","affiliation":[]},{"given":"Gregor","family":"L\u00e4mmel","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Nagel","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"key":"38_CR1_38","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"Fleischer Lisa","year":"2007","unstructured":"Lisa Fleischer and Martin Skutella. Quickest flows over time. SIAM Journal on Computing, 36: 1600\u20131630, 2007.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR2_38","doi-asserted-by":"crossref","unstructured":"L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.","DOI":"10.1515\/9781400875184"},{"key":"38_CR3_38","unstructured":"H.W. Hamacher and S.A. Tjandra. Mathematical modelling of evacuation problems \u2013 a state of the art. In Pedestrian and Evacuation Dynamics, pages 227\u2013266, 2002."},{"key":"38_CR4_38","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"B. Hoppe and \u00c9. Tardos. The quickest transshipment problem. Mathematics of Operations Research, 25: 36\u201362, 2000.","journal-title":"Mathematics of Operations Research"},{"key":"38_CR5_38","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1287\/mnsc.28.1.106","volume":"28","author":"J. Jarvis","year":"1982","unstructured":"J. Jarvis and H. Ratliff. Some equivalent objectives for dynamic network flow problems. Management Science, 28: 106\u2013108, 1982.","journal-title":"Management Science"},{"key":"38_CR6_38","doi-asserted-by":"crossref","unstructured":"G. L\u00e4mmel and G. Fl\u00f6tter\u00f6d. Towards system optimum: finding optimal routing strategies in time dependent networks for large-scale evacuation problems. Volume 5803 of LNCS (LNAI), pages 532\u2013539, Berlin Heidelberg, 2009. Springer.","DOI":"10.1007\/978-3-642-04617-9_67"},{"key":"38_CR7_38","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.trc.2009.04.020","volume":"18","author":"G. L\u00e4mmel","year":"2010","unstructured":"G. L\u00e4mmel, D. Grether, and K. Nagel. The representation and implementation of time-dependent inundation in large-scale microscopic evacuation simulations. Transportation Research Part C: Emerging Technologies, 18: 84\u201398, February 2010.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"38_CR8_38","unstructured":"K. Nagel and G. Fl\u00f6tter\u00f6d. Agent-based traffic assignment: going from trips to behavioral travelers. In Proceedings of 12th International Conference on Travel Behaviour Research, Jaipur, India, December 2009. Invited resource paper."},{"key":"38_CR9_38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02031941","volume":"60","author":"S. Peeta","year":"1995","unstructured":"S. Peeta and H.S. Mahmassani. System optimal and user equilibrium time-dependent traffic assignment in congested networks. Annals of Operations Research, 60: 81\u2013113, 1995.","journal-title":"Annals of Operations Research"},{"key":"38_CR10_38","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1012827724856","volume":"1","author":"S. Peeta","year":"2001","unstructured":"S. Peeta and A.K. Ziliaskopoulos. Foundations of dynamic traffic assignment: The past, the present and the future. Networks and Spatial Economics, 1: 233\u2013265, 2001.","journal-title":"Networks and Spatial Economics"},{"key":"38_CR11_38","doi-asserted-by":"crossref","unstructured":"T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, May 2005.","DOI":"10.21236\/ADA637949"},{"key":"38_CR12_38","unstructured":"S.A. Tjandra. Earliest arrival flow with time dependent capacity approach to the evacuation problems. Technical report, TU Kaiserslautern, 2001."},{"key":"38_CR13_38","unstructured":"S.A. Tjandra. Dynamic Network Optimization with Application to the Evacuation Problem. PhD thesis, TU Kaiserslautern, 2003."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T13:26:01Z","timestamp":1706189161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_38","relation":{},"ISSN":["0721-5924"],"issn-type":[{"value":"0721-5924","type":"print"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"21 June 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}