Evacuation Flow Assignment based on Improved MCMF Algorithm

摘要：

During special events in urban transport network,traffic flow supported by route network is obviously different to that in normal circumstance.In the process of special events evacuation,it’s not only hoped a mass flow can be evacuated to some shelters,but also wished the evacuation time minimum.Therefore it is a problem to find a MinCost-MaxFlow in transport network.In this paper,the traditional MCMF was modified to describe network traffic assignment problems.Further more,a static traffic assignment based on pipelining was proposed to solve the evacuation flow problem.The numerical experiment on hypothetic network indicated the proposed MCMF algorithm can deal with evacuation traffic assignment problem reasonably.

作者: YANG Fan YAN Xinping XU Kun

作者单位: ITS institute,Engineering Research Center of Transportation Safety,Ministry of Education,Wuhan University of Technology,Wuhan 430063,China

会议类型: 国际会议

会议名称: 第一届智能网络与智能系统国际会议(ICINIS 2008)(The First International Conference on Intelligent Networks and Intelligent Systems)

会议地点: 武汉

会议语种:英文

在线出版日期: 2008-11-01（万方平台首次上网日期，不代表论文的发表时间）