Vehicle Routing Problem of Dispatching Emergency Materials in Large-scale Emergency Events

The paper studies a vehicle routing problem that n vehicles deliver emergency material from emergency service center,such as airport,railway station,etc.to m emergency demand points and finally return to the emergency service center.The model whose goal is to make the total time spent byn vehicles shortest and the time spent byeveryvehicle equal is established.The improved nearest search algorithmis giv-en.