基于灰色关联算法的军事运输路径优化
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Optimization of the military transportation path based on grey association algorithm
  • 作者:阮博 ; 郭平 ; 雷晏 ; 张志峰
  • 英文作者:RUAN Bo;GUO Ping;LEI Yan;ZHANG Zhi-feng;Department of Military Logistics,Army Logistical University of PLA;Center of Logistical Security Testing,Army Logistical University of PLA;Center of Network Management,Army Logistical University of PLA;
  • 关键词:军事运输 ; 有效路径 ; 影响程度
  • 英文关键词:military transportation;;effective path;;influence degree
  • 中文刊名:CSJX
  • 英文刊名:Journal of Transport Science and Engineering
  • 机构:陆军勤务学院军事物流系;陆军勤务学院勤务保障实验中心;陆军勤务学院网管中心;
  • 出版日期:2018-12-30
  • 出版单位:交通科学与工程
  • 年:2018
  • 期:v.34;No.131
  • 基金:国家自然科学基金资助项目(71401172)
  • 语种:中文;
  • 页:CSJX201804014
  • 页数:8
  • CN:04
  • ISSN:43-1494/U
  • 分类号:86-92+106
摘要
为对平时条件下的军事运输路径进行优化,建立了基于灰色加权关联算法的优化分析模型。依据公路网的路段交通量分配,通过k次短路径算法,求解出有效路径并组建决策集。将基于灰色加权关联算法的模型应用于实例,求解最优运输路径并按优劣排序备选路径。研究结果表明:该模型能有效解决平时条件下的军事运输路径优化,并验证了平时条件下的路段交通管制对运输路径的优化效果并不明显。
        To solve the problem of military transportation path optimization in peacetime,an optimization analysis model was established.Starting from the allocation strategy of traffic volume in highway network,effective path was solved through the improved k-shortest path algorithm to construct a decision set.Then the model based on the grey weighted correlation algorithm was applied to specific examples of military transportation path optimization problem,the optimal path was obtained and the alternative paths were sorted according to the pros and cons.The example result shows that this model can effectively solve the problem of military transport path optimization and the optimization effect of the traffic control in peacetime is not obvious.
引文
[1] 王伟.城市公路交通网络关键节点和路段辨识方法研究[D].长春:吉林大学,2015.(WANG Wei.Study on identification methods of key nodes and sections of urban highway transportation network[D].Changchun:Jilin University,2015.(in Chinese))
    [2] 黄大荣,沈利兵,赵玲.基于复杂网络理论的城市路网脆弱性研究[J].重庆交通大学学报:自然科学版,2015,34(1):110-115.(HUANG Da-rong,SHEN Li-bing,ZHAO Ling.Study on vulnerability of urban road network based on complex network theory[J].Journal of Chongqing Jiaotong University:Natural Science,2015,34(1):110-115.(in Chinese))
    [3] 臧涛涛.基于模糊层次分析法(FAHP)的军事运输路径优化研究[D].长春:吉林大学,2013.(ZANG Taotao.Research on military transportation path optimization based on fuzzy analytic hierarchy process(FAHP)[D].Changchun:Jilin University,2013.(in Chinese))
    [4] 姜海洋,周宽久,林林,等.战时运输风险评估模型及其路径优化研究[J].计算机工程与应用.2016,52(17):235-242.(JIANG Hai-yang,ZHOU Kuanjiu,LIN Lin,et al.Research on wartime transportation risk assessment model and its path optimization[J].Computer Engineering and Applications,2016,52(17):235-242.(in Chinese))
    [5] 段宗涛,WANG Wei-xing,康军,等.面向城市交通网络的k最短路径集合算法[J].交通运输系统工程与信息,2014,14(3):194-200.(DUAN Zong-tao,WANG Wei-xing,KANG Jun,et al.The k-shortest path set algorithm for urban traffic network[J].Transportation Systems Engineering and Information,2014,14(3):194-200.(in Chinese))
    [6] 刘新.基于复杂网络理论的城市轨道交通网络抗毁性优化研究[D].成都:西南交通大学,2014.(LIU Xin.Research on the invulnerability optimization of urban rail transit network based on complex network theory[D].Chengdu:Southwest Jiaotong University,2014.(in Chinese))
    [7] 种鹏云,帅斌,尹惠.基于复杂网络的危险品运输网络抗毁性仿真[J].复杂系统与复杂性科学,2014,11(4):10-18.(ZHONG Peng-yun,SHUAI Bin,YIN Hui.Invulnerability simulation of dangerous goods transportation network based on complex network[J].Journal of Complex Systems and Complexity,2014,11(4):10-18.(in Chinese))
    [8] 种鹏云,帅斌,陈钢铁.恐怖袭击下危险品运输网络级联失效抗毁性建模与仿真[J].计算机应用研究,2013,30(1):107-110.(ZHONG Peng-yun,SHUAI Bin,CHEN Gang-tie.Modeling and simulation of failure prevention and destruction of dangerous goods transportation network under terrorist attacks[J].Application Research of Computers,2013,30(1):107-110.(in Chinese))
    [9] 李志纯,黄海军.随机交通分配中有效路径的确定方法[J].交通运输系统工程与信息,2003,3(1):28-32.(LI Zhi-chun,HUANG Hai-jun.Determination method of effective path in random traffic assignment[J].Transportation Systems Engineering and Information,2003,3(1):28-32.(in Chinese))
    [10] 郑贵省,王元,王鹏,等.基于改进k次短路径算法的有效路径搜索算法及实现[J].军事交通学院学报,2016,18(4):80-84.(ZHENG Gui-sheng,WANG Yuan,WANG Peng,et al.Efficient path search algorithm and implementation based on improved k-time short path algorithm[J].Journal of Military Transportation University,2016,18(4):80-84.(in Chinese))
    [11] 陈京荣,俞建宁,李引珍.交通网络k-短路径与最小支撑树问题[J].长安大学学报:自然科学版,2014,34(3):133-136.(CHEN Jing-rong,YU Jian-ning,LI Yin-zhen.The k-short path and minimum support tree problem of traffic network[J].Journal of Chang’an University:Natural Science Edition,2014,34(3):133-136.(in Chinese))
    [12] Dijkstra E W.A note on two problem in connexion with graphs[J].Numeric Mathematics,1959(1):269-271.
    [13] Yen J Y.Finding the k shortest loopless paths in a network[J].Management Science,1971(17):712-716.
    [14] 朱建全.基于路段交通流状态的车辆燃油消耗的测算与分析[D].合肥:合肥工业大学,2017.(ZHU Jian-quan.Measurement and analysis of vehicle fuel consumption based on traffic flow status of road section[D].Hefei:Hefei University of Technology,2017.(in Chinese))
    [15] 王甲生,吴晓平,陈永强.不同信息条件下加权复杂网络抗毁性仿真研究[J].中南大学学报:自然科学版,2013,44(5):1888-1894.(WANG Jia-sheng,WU Xiao-ping,CHEN Yong-qiang.Study on the invulnerability of weighted complex networks under different information conditions[J].Journal of Central South University:Science and Technology,2013,44(5):1888-1894.(in Chinese))

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

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

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