城市应急路网疏散规划的模型与算法分析-model and algorithm analysis of evacuation planning for urban emergency road network.docx

城市应急路网疏散规划的模型与算法分析-model and algorithm analysis of evacuation planning for urban emergency road network.docx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
城市应急路网疏散规划的模型与算法分析-model and algorithm analysis of evacuation planning for urban emergency road network

华中科技大学博士学位论文 华 中 科 技 大 学 博 士 学 位 论 文 IV IV capacity, the attribute of the node is mainly comes from the model and analysis of the signalized intersection traffic capacity. To get the source node and the evacuee amount on which, the method to model the initial population distribution is studied. After established the network model, the solution of the evacuation route planning problem is researched. In the classic field of the network flow, the original problem should first be transformed to static network flow problem like minimum cost flow problem using the time-expand-graph, then it can be calculated by some polynomial time algorithms. But the time-expand-graph needs huge spending to extend the original network to the whole evacuation time times, and deterministic algorithms need too much cost when calculating the huge networks. For these reasons, a kind of heuristic algorithm is studied in this paper, which don’t ensure to get the optimal solution, but suboptimal solution, with advantage that the resource consumption and calculate time can be reduced significantly, so the solving of the practical large network becomes possible. Besides to carry out the algorithm and improved the pre-processing part, which can simplify the programming and reduce the task in each iteration, and this change doesn’t affect the result, then this paper improved the original algorithm from two different point. First, the iterative threshold value is devised to terminate iterations earlier for every departure time, in order to eliminate some long path form evacuation route plan. Second, we let the evacuees longer from the destinations start first, to reduce the arrival time of last one. Besides, the result of the algorithm is demonstrated on the GIS flat root, and the framework and flow for the application to the real time traffic control system is discussed. Keywords: City emergency network flow problem road net evacuation link capacity heuristic algorithm real time traffic control 独创性

您可能关注的文档

文档评论(0)

peili2018 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档