中文核心期刊
CSCD来源期刊
中国科技核心期刊
RCCSE中国核心学术期刊

Journal of Chongqing Jiaotong University(Natural Science) ›› 2018, Vol. 37 ›› Issue (09): 87-92.DOI: 10.3969/j.issn.1674-0696.2018.09.14

• Traffic & Transportation Engineering • Previous Articles     Next Articles

Multi-objective Shortest Path Algorithm Based on Road Section Assignment Method

FENG Shumin1, WANG Xiankai1, SUN Xianglong2   

  1. (1. School of Transportation Science and Engineering, Harbin Institute of Technology, Harbin 150090, Heilongjiang, P. R. China; 2. School of Civil Engineering, Northeast Forestry University, Harbin 150040,Heilongjiang, P. R. China)
  • Received:2017-03-10 Revised:2017-10-16 Online:2018-09-10 Published:2018-09-10

基于路段赋值的多目标最短路算法研究

冯树民1,王宪凯1,孙祥龙2   

  1. (1. 哈尔滨工业大学 交通科学与工程学院,黑龙江 哈尔滨 150090; 2. 东北林业大学 土木工程学院,黑龙江 哈尔滨 150040)
  • 作者简介:冯树民(1973—),男,黑龙江哈尔滨人,教授,博士,主要从事交通运输规划与管理方面的研究。E-mail: zlyfsm2000@sina.com。
  • 基金资助:
    国家863高技术研究发展计划项目(2014AA110304)

Abstract: Considering the influence of the number and distance of each route between the origin and the destination on route selection, a calculation method of road section assignment was put forward. Based on the linear weighting method, a new evaluation function was constructed by using the assignment of road sections. It was proved that the optimal solution obtained by this method was the non-inferior solution of the multi-objective shortest path problem. Combined with the K-shortest path algorithm, the computational procedure of road section assignment method to solve the multi-objective shortest path problem was given out. Taking the transport network of Pingxiang City in Jiangxi Province as an example, the conventional linear weighting method, the geometric weighting method and the road assignment method were compared. The results show that the road section assignment method can obtain the local optimal solution, and it can estimate the importance of each target accurately when the weight changes.

Key words: traffic and transportation engineering, multi-objective shortest path, road section assignment method, urban traffic network, linear weighting method

摘要: 考虑起讫点间每条路线的路段数和距离对路线选择的影响,提出了路段赋值的计算方法。在线性加权法的基础上,利用路段赋值构造新的评价函数,并证明了该方法得到的最优解是多目标最短路问题的非劣解。结合K-最短路算法,给出了路段赋值法求解多目标最短路的计算步骤。以江西省萍乡市运输网络为例,对常规线性加权法、几何加权法与路段赋值法进行了比较。结果表明:路段赋值法能够得到局部最优解,而且当权重变化时,能够准确估计各目标的重要性。

关键词: 交通运输工程, 多目标最短路, 路段赋值法, 城市路网, 线性加权法

CLC Number: