{"id":"https://openalex.org/W2014495810","doi":"https://doi.org/10.1145/1645373.1645377","title":"A scalable heuristic for evacuation planning in large road network","display_name":"A scalable heuristic for evacuation planning in large road network","publication_year":2009,"publication_date":"2009-11-03","ids":{"openalex":"https://openalex.org/W2014495810","doi":"https://doi.org/10.1145/1645373.1645377","mag":"2014495810"},"language":"en","primary_location":{"id":"doi:10.1145/1645373.1645377","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1645373.1645377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Second International Workshop on Computational Transportation Science","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/A5010759788","display_name":"Dafei Yin","orcid":null},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dafei Yin","raw_affiliation_strings":["Peking University, Beijing, China","Peking University, Beijing, China#TAB#"],"affiliations":[{"raw_affiliation_string":"Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]},{"raw_affiliation_string":"Peking University, Beijing, China#TAB#","institution_ids":["https://openalex.org/I20231570"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010759788"],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":2.7624,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.89575727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.9998000264167786,"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.9998000264167786,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11106","display_name":"Data Management and Algorithms","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7732014656066895},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7611548900604248},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.7246497869491577},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6585776805877686},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6482802629470825},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5640358924865723},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4319847822189331},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.42395055294036865},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41769635677337646},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4033735990524292},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.36823907494544983},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15049993991851807},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11736437678337097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0835694670677185}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7732014656066895},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7611548900604248},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.7246497869491577},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6585776805877686},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6482802629470825},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5640358924865723},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4319847822189331},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.42395055294036865},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41769635677337646},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4033735990524292},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.36823907494544983},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15049993991851807},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11736437678337097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0835694670677185},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1645373.1645377","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1645373.1645377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Second International Workshop on Computational Transportation Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Climate action","id":"https://metadata.un.org/sdg/13"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W336787341","https://openalex.org/W1600853624","https://openalex.org/W1982809790","https://openalex.org/W2013731263","https://openalex.org/W2066462591","https://openalex.org/W2104724137","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W1568779110","https://openalex.org/W804484174","https://openalex.org/W4244698559","https://openalex.org/W4246538999","https://openalex.org/W56933075","https://openalex.org/W4399598005","https://openalex.org/W2002361198","https://openalex.org/W2168364913","https://openalex.org/W1548568597","https://openalex.org/W2114709995"],"abstract_inverted_index":{"Evacuation":[0],"planning":[1,17],"is":[2,21],"of":[3,29,35,81],"critical":[4],"importance":[5],"for":[6,11],"civil":[7],"authorities":[8],"to":[9,25,62,71,85,92],"prepare":[10],"natural":[12],"disasters,":[13],"but":[14],"efficient":[15],"evacuation":[16,125],"in":[18,54,101,112],"large":[19,27,72,93],"city":[20],"computationally":[22],"challenging":[23],"due":[24],"the":[26,32,79,106,138],"number":[28],"evacuees":[30],"and":[31,57,83,104,123],"huge":[33],"size":[34],"transportation":[36],"networks.":[37,73],"One":[38],"recently":[39],"proposed":[40],"algorithm":[41,96],"Capacity":[42],"Constrained":[43],"Route":[44],"Planner":[45],"(CCRP)":[46],"can":[47,68,97,132],"give":[48],"sub-optimal":[49],"solution":[50],"with":[51,118],"good":[52],"accuracy":[53],"less":[55,59],"time":[56],"use":[58],"memory":[60],"compared":[61],"previous":[63,102],"approaches.":[64],"However,":[65],"it":[66,131],"still":[67],"not":[69],"scale":[70],"In":[74],"this":[75],"paper,":[76],"we":[77],"analyze":[78],"overhead":[80],"CCRP":[82],"come":[84],"a":[86],"new":[87],"heuristic":[88],"CCRP++":[89],"that":[90],"scalable":[91],"network.":[94],"Our":[95],"reuse":[98],"search":[99],"results":[100],"iterations":[103],"avoid":[105],"repetitive":[107],"global":[108],"shortest":[109],"path":[110],"expansion":[111],"CCRP.":[113],"We":[114],"conducted":[115],"extensive":[116],"experiments":[117],"real":[119],"world":[120],"road":[121],"networks":[122],"different":[124],"parameter":[126],"settings.":[127],"The":[128],"result":[129],"shows":[130],"gives":[133],"great":[134],"speed-up":[135],"without":[136],"loosing":[137],"optimality.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}