{"id":"https://openalex.org/W2024341728","doi":"https://doi.org/10.1145/1968613.1968730","title":"An evacuation planner algorithm in flat time graphs","display_name":"An evacuation planner algorithm in flat time graphs","publication_year":2011,"publication_date":"2011-02-21","ids":{"openalex":"https://openalex.org/W2024341728","doi":"https://doi.org/10.1145/1968613.1968730","mag":"2024341728"},"language":"en","primary_location":{"id":"doi:10.1145/1968613.1968730","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1968613.1968730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074533707","display_name":"Manki Min","orcid":"https://orcid.org/0000-0003-1895-9239"},"institutions":[{"id":"https://openalex.org/I177156846","display_name":"South Dakota State University","ror":"https://ror.org/015jmes13","country_code":"US","type":"education","lineage":["https://openalex.org/I177156846"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Manki Min","raw_affiliation_strings":["South Dakota State University, Brookings, SD"],"affiliations":[{"raw_affiliation_string":"South Dakota State University, Brookings, SD","institution_ids":["https://openalex.org/I177156846"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085750654","display_name":"Bipin C. Neupane","orcid":null},"institutions":[{"id":"https://openalex.org/I177156846","display_name":"South Dakota State University","ror":"https://ror.org/015jmes13","country_code":"US","type":"education","lineage":["https://openalex.org/I177156846"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bipin C. Neupane","raw_affiliation_strings":["South Dakota State University, Brookings, SD"],"affiliations":[{"raw_affiliation_string":"South Dakota State University, Brookings, SD","institution_ids":["https://openalex.org/I177156846"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074533707"],"corresponding_institution_ids":["https://openalex.org/I177156846"],"apc_list":null,"apc_paid":null,"fwci":1.9578,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86429358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7442857027053833},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7103093266487122},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6675516366958618},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.646420955657959},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4574422836303711},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43869948387145996},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.43016910552978516},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36004024744033813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35056817531585693},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21383565664291382},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19712111353874207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14941340684890747},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09620067477226257}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7442857027053833},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7103093266487122},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6675516366958618},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.646420955657959},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4574422836303711},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43869948387145996},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.43016910552978516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36004024744033813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35056817531585693},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21383565664291382},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19712111353874207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14941340684890747},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09620067477226257},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1968613.1968730","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1968613.1968730","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5099999904632568,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G4179691480","display_name":null,"funder_award_id":"CCF-0729182","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1589314644","https://openalex.org/W1600853624","https://openalex.org/W1775310636","https://openalex.org/W2014495810","https://openalex.org/W2050051795","https://openalex.org/W2066462591","https://openalex.org/W2068218328","https://openalex.org/W2110383761","https://openalex.org/W2128389668","https://openalex.org/W2133751107"],"related_works":["https://openalex.org/W2149224531","https://openalex.org/W4247716783","https://openalex.org/W2137646787","https://openalex.org/W2160885658","https://openalex.org/W2098791961","https://openalex.org/W2144164383","https://openalex.org/W2483530712","https://openalex.org/W4230539218","https://openalex.org/W2150731467","https://openalex.org/W2154215043"],"abstract_inverted_index":{"In":[0,49],"this":[1],"paper,":[2],"we":[3,58,79],"present":[4],"an":[5],"evacuation":[6,42,47,72,88,112,116],"planner":[7],"algorithm":[8,35,106],"that":[9,44,85,90,104],"does":[10],"not":[11],"use":[12,54],"the":[13,33,41,46,53,61,66,71,76,94,110],"time-expanded":[14,56],"graphs.":[15],"Given":[16],"a":[17,82],"transportation":[18],"network":[19],"with":[20,93],"nodes":[21,25],"and":[22,28,109],"edges,":[23],"where":[24],"have":[26,30,114],"capacity/occupancy":[27],"edges":[29],"capacity/travel":[31],"time,":[32],"proposed":[34],"can":[36,80],"be":[37],"used":[38],"to":[39,51,69],"plan":[40],"routing":[43,83],"minimizes":[45],"time.":[48,117],"order":[50],"avoid":[52],"of":[55,65,96,98],"graphs,":[57],"are":[59],"using":[60],"quickest":[62,77],"paths":[63,68],"instead":[64],"shortest":[67],"construct":[70],"routing.":[73],"By":[74],"combining":[75],"paths,":[78],"get":[81],"scheme":[84],"has":[86],"short":[87,115],"time":[89],"is":[91,107],"scalable":[92,108],"increase":[95],"number":[97],"evacuees.":[99],"The":[100],"simulation":[101],"results":[102],"show":[103],"our":[105],"found":[111],"routes":[113]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}