基于最短路径的城市干道网规划的算法研究

Urban main road network planning algorithm on shortest-path

首先定义了要点、中观区、虚拟网等概念 ,而后以净效益最大化为目标 ,以假定驾驶员都选择最短路径为前提 ,研究了城市干道网的各干道的线路和规格的规划算法。

A quantitative planning method of urban main road network is studied. First, main site, middle scope area, virtual network are defined. Then, Under the premise of the shortest path and the maximization of net benefit, the planning algorithm about the line and the specification of main road are designed.