一种时间最短的交通网络路径求解方法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Method of Solving Traffic Network Path with Shortest Time
  • 作者:曹梦琦 ; 李德敏 ; 张光林 ; 郭畅
  • 英文作者:CAO Mengqi;LI Demin;ZHANG Guanglin;GUO Chang;College of Information Science & Technology, Donghua University;Engineering Research Center of Digitized Textile & Fashion Technology, Ministry of Education;
  • 关键词:行驶时间 ; 交通路网 ; 拉格朗日乘子法 ; 利他因子
  • 英文关键词:travel time;;traffic network;;Lagrange multiplier;;the level of altruism
  • 中文刊名:JSGG
  • 英文刊名:Computer Engineering and Applications
  • 机构:东华大学信息科学与技术学院;数字化纺织服装技术教育部工程研究中心;
  • 出版日期:2018-05-28 17:36
  • 出版单位:计算机工程与应用
  • 年:2019
  • 期:v.55;No.923
  • 基金:国家自然科学基金(No.71171045,No.61301118,No.61772130)
  • 语种:中文;
  • 页:JSGG201904035
  • 页数:6
  • CN:04
  • 分类号:238-242+259
摘要
随着科技的不断发展和人民生活水平的不断提高,汽车的保有量日益增加,交通堵塞问题愈加严重,造成了时间的浪费。为了防止城市交通拥堵,节约驾驶员出行的时间,将路网信息表示成矩阵的形式,建立了车辆行驶时间目标函数。运用拉格朗日乘子法求解目标函数,从而得到各车辆的行驶路径。最后,利用MATLAB实验仿真,在目标函数最小的情况下,能得到车辆的行驶路径,当有利他因子时,更节省出行时间。
        With the rapid development of technology and the improvement of people's living standard, the volume of the vehicles on the road is rising year by year. Especially, traffic congestion is becoming more and more serious and it causes a waste of time. To avoid traffic congestion and reduce travel time, firstly, the road network information is expressed in the form of matrix, and the objective function of vehicle travel time is established. Then, the objective function of travel time is computed by Lagrange multiplier to get the vehicle's driving path. Lastly, by using the simulation via MATLAB,the vehicular driving path is obtained in the case of minimizing the objective function and the more travel time can be reduced with taking the level of altruism into consideration.
引文
[1]乔永锋.让行业组织真正发挥作用[J].中国汽配市场,2016(6).
    [2]张利.基于交通仿真的多路口交通组织优化管理应用研究[D].长春:吉林大学,2011.
    [3]中华人民共和国国家统计局.中国统计年鉴-2016[M].北京:中国统计出版社,2016.
    [4]杨建勇.城市局部道路车流均衡方法方法[D].沈阳:沈阳工业大学,2010.
    [5]Liu Ruilin,Liu Hongzhang,Kwak D,et al.Balanced traffic routing:design,implemenation,and evaluation[J].Ad Hoc Networks,2016,37:14-28.
    [6]He Zongjian,Guo Jiannong,Li Tao,et al.MICE:a realtime traffic estimation based vehicular path planning solution using VANETS[C]//International Conference on Connected Vehicles and Expo,2013:172-178.
    [7]Jindal V,Dhankani H.MACO:modified ACO for reducing travel time in VANETS[C]//International Symposium on Women in Computing and Informatics,2015:97-102.
    [8]谢民,高立新.蚁群算法在最优路径规划中的应用[J].计算机工程与应用,2008,44(8):245-248.
    [9]van Den Bosch A,van Aren B.Reducing time delays on congested road networks using social navigation[J].Integrated&Sustainable Transportation System,2011:26-31.
    [10]Guo Hongliang,Cao Zhiguang,Seshdri M,et al.Routing multiple vehicles cooperatively:minimizing road network breakdown probality[J].IEEE Transactions on Emerging Topicsin Computational Intellgence,2017,1(2):112-124.
    [11]叶金平.车辆导航中多路径推荐算法研究[D].重庆:重庆大学,2011.
    [12]Skaberdonis A,Dowling R.Improved speed-flow relationships for planning applicatons[J].Transportation Research Record,1997(1):18-23.
    [13]李宝林,李勇建,刘勇,等.INS/GPS多传感器车载组合导航系统算法研究[J].压电与声光,2012,34(1):37-41.
    [14]李静林,刘志晗,杨放春.车联网体系结构及其关键技术[J].北京邮电大学,2014,37(6):95-100.
    [15]Boyd S,Vandenberghe L.凸优化[M].北京:清华大学出版社,2013:535-552.
    [16]胡良剑,孙晓君.MATLAB数学实验[M].北京:高等教育出版社,2013:249-261.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700