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, itpsilas 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.