{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:04:33Z","timestamp":1743102273712,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_23","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"279-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation"],"prefix":"10.1007","author":[{"given":"Yi","family":"Hong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.psep.2015.07.005","volume":"98","author":"K Faisal","year":"2015","unstructured":"Faisal, K., Samith, R., Salim, A.: Methods and models in process safety and risk management: past, present and future. Process Saf. Environ. Prot. 98, 116\u2013147 (2015)","journal-title":"Process Saf. Environ. Prot."},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.tre.2011.11.003","volume":"48","author":"L \u00d6zdamar","year":"2012","unstructured":"\u00d6zdamar, L., Demir, O.: A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Transp. Res. Part E Logistics Transp. Rev. 48(3), 591\u2013602 (2012)","journal-title":"Transp. Res. Part E Logistics Transp. Rev."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Lahmar, M., Assavapokee, T., Ardekani, S.A.: A dynamic transportation planning support system for hurricane evacuation. In: Intelligent Transportation Systems Conference (ITSC 2006), pp. 612\u2013617 (2006)","DOI":"10.1109\/ITSC.2006.1706809"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jlp.2014.05.007","volume":"30","author":"L Wang","year":"2014","unstructured":"Wang, L., Wang, Y., Cao, Q., Li, X., Li, J., Wu, X.: A framework for human error risk analysis of coal mine emergency evacuation in China. J. Loss Prev. Process Ind. 30, 113\u2013123 (2014)","journal-title":"J. Loss Prev. Process Ind."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10489-014-0583-4","volume":"42","author":"J Radianti","year":"2015","unstructured":"Radianti, J., Granmo, O., Sarshar, P., Goodwin, M., Dugdale, J., Gonzalez, J.J.: A spatio-temporal probabilistic model of hazard- and crowd dynamics for evacuation planning in disasters. Appl. Intell. 42(1), 3\u201323 (2015)","journal-title":"Appl. Intell."},{"key":"23_CR6","first-page":"0677","volume":"20","author":"J Ji","year":"2010","unstructured":"Ji, J., Zhang, J., Chen, J., Wu, S.: Computer simulation of evacuation in underground coal mines. Min. Sci. Technol. 20, 0677\u20130681 (2010)","journal-title":"Min. Sci. Technol."},{"issue":"3","key":"23_CR7","first-page":"1","volume":"14","author":"V Adjiski","year":"2015","unstructured":"Adjiski, V., Mirakovski, D., Despodov, Z., Mijalkovski, S.: Simulation and optimization of evacuation routes in case of fire in underground mines. J. Sustain. Min. 14(3), 1\u201311 (2015)","journal-title":"J. Sustain. Min."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ssci.2011.09.007","volume":"50","author":"S Zhang","year":"2012","unstructured":"Zhang, S., Wu, Z., Zhang, R., Kang, J.: Dynamic numerical simulation of coal mine fire for escape capsule installation. Saf. Sci. 50, 600\u2013606 (2012)","journal-title":"Saf. Sci."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s10489-014-0538-9","volume":"42","author":"M Goodwin","year":"2015","unstructured":"Goodwin, M., Granmo, O., Radianti, J.: Escape planning in realistic fire scenarios with Ant Colony Optimisation. Appl. Intell. 42, 24\u201335 (2015)","journal-title":"Appl. Intell."},{"key":"23_CR10","volume-title":"Optimization Algorithms for Networks and Graphs","author":"J Evans","year":"1992","unstructured":"Evans, J., Minieka, E.: Optimization Algorithms for Networks and Graphs, 2nd edn. Marcel Dekker, New York (1992)","edition":"2"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73(2), 129\u2013174 (1996)","journal-title":"Math. Program."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1016\/j.ssci.2009.01.001","volume":"47","author":"SE Jalali","year":"2009","unstructured":"Jalali, S.E., Noroozi, M.: Determination of the optimal escape routes of underground mine networks in emergency cases. Saf. Sci. 47, 1077\u20131082 (2009)","journal-title":"Saf. Sci."},{"key":"23_CR13","unstructured":"Martins, E., Pascoal, M., Santos, J.: A new algorithm for ranking loopless paths. Technical report, Univ. de Coimbra (1997)"},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"2975","DOI":"10.1016\/j.cor.2013.07.005","volume":"40","author":"W Jin","year":"2013","unstructured":"Jin, W., Chen, S., Jiang, H.: Finding the K shortest paths in a time-schedule network with constraints on arcs. Comput. Oper. Res. 40, 2975\u20132982 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"2013","key":"23_CR16","doi-asserted-by":"publisher","first-page":"2852","DOI":"10.1016\/j.cor.2013.06.014","volume":"40","author":"D Sever","year":"2013","unstructured":"Sever, D., Dellaert, N., Woensel, T., Kok, T.: Dynamic shortest path problems: hybrid routing policies considering network disruptions. Comput. Oper. Res. 40(2013), 2852\u20132863 (2013)","journal-title":"Comput. Oper. Res."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Strong NP-completeness results: motivation, examples, and implications. J. ACM 25, 499\u2013508 (1978)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:06:47Z","timestamp":1709820407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}