QQ客服 官方微博 反馈留言

	A scalable heuristic for evacuation planning in large road network
	Yin, Dafei
	2009
英文摘要	Evacuation planning is of critical importance for civil authorities to prepare for natural disasters, but efficient evacuation planning in large city is computationally challenging due to the large number of evacuees and the huge size of transportation networks. One recently proposed algorithm Capacity Constrained Route Planner (CCRP) can give sub-optimal solution with good accuracy in less time and use less memory compared to previous approaches. However, it still can not scale to large networks. In this paper, we analyze the overhead of CCRP and come to a new heuristic CCRP++ that scalable to large network. Our algorithm can reuse search results in previous iterations and avoid the repetitive global shortest path expansion in CCRP. We conducted extensive experiments with real world road networks and different evacuation parameter settings. The result shows it can gives great speed-up without loosing the optimality. Copyright 2009 ACM.; EI; 0
语种	英语
DOI标识	10.1145/1645373.1645377
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/327470]
专题	地球与空间科学学院
推荐引用方式 GB/T 7714	Yin, Dafei. A scalable heuristic for evacuation planning in large road network. 2009-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。