期刊文献+

城市轨道交通线网检测车路径优化 被引量:2

Track Inspection Vehicle Routing Problem under the Urban Rail Transit Network
在线阅读 下载PDF
导出
摘要 针对目前轨道检测车作业路径缺乏系统规划方法的弊端,以城市轨道交通线网为背景,构建成网条件下多约束地铁大型检测车辆路径优化模型(urban track inspection vehicle routing problem,UTIVRP)。针对地铁线网的特点,设计具有特殊编码方式的文化基因算法,并通过北京地铁实际算例予以验证。计算结果表明,在满足既定检测要求的情况下,优化方案不仅能够减少车辆48.88%的空走里程,而且能够将线网的检测间隔最大偏差率降低93.33%。 The subway engineering department regularly operates track inspection vehicles to detect the state of the tracks,which is crucial for residents’safe travel.The operational path of track inspection vehicles mainly relies on expert judgment,which is not only a time-consuming practice but is also ineffective.To address the shortcomings of the current lack of systematic planning for the operational paths of track inspection vehicles,this study,set against the backdrop of the urban rail transit network,constructs a large-scale subway inspection vehicle routing optimization model named Urban Track Inspection Vehicle Routing Problem(UTIVRP),under the conditions of a complex network.Considering the characteristics of subway networks,a cultural genetic algorithm with a special encoding method is designed and validated using practical examples from the Beijing subway.The computational results indicate that under the conditions of meeting the established inspection requirements,the optimization solution can not only reduce the idle mileage of vehicles by 48.88%,but also decrease the maximum deviation rate of the network’s inspection interval by 93.33%.
作者 胡政汉 HU Zhenghan(School of software,Huadong Jiaotong University,Nanchang 330013)
出处 《都市快轨交通》 北大核心 2024年第1期107-113,共7页 Urban Rapid Rail Transit
基金 中国国家铁路集团有限公司科技研究开发计划(N2022G028)。
关键词 城市轨道交通 检测车 轨道检测 路径优化 文化基因算法 urban rail transit inspection velaicle track inspection routing problem memetic algorithm
作者简介 胡政汉,男,本科,从事铁道工程研究,1980413594@qq.com。
  • 相关文献

参考文献5

二级参考文献53

  • 1邹彤,李宁,孙德宝,李菁.多车场车辆路径问题的遗传算法[J].计算机工程与应用,2004,40(21):82-83. 被引量:33
  • 2但正刚,蔡临宁,吕新福,郑力.CARP问题的小环路启发式求解方法[J].系统工程学报,2006,21(5):502-507. 被引量:11
  • 3王丽丽,罗可,杨光军.基于双层遗传算法的混合属性数据分类[J].计算机工程与应用,2006,42(30):155-156. 被引量:3
  • 4Assad A A,Golden B L.Arc routing methods and applications[C]// Balletal M O.Handbooks in OR and MS,Elsevier,Amsterdam, 1995 : 375-483.
  • 5Hirabayashi R,Saruwatari Y,Nishida N.Tour construction algorithm for the capacitated arc routing problem[J].Asia-Pacific Journal of Operational Research, 1992 : 155-175.
  • 6Hertz A,Laporte G,Mittaz M.A tabu search heuristic for the capacitated arc routing prohlem[J].Operations Research,2000,48 ( 1 ) : 129-135.
  • 7Beullens P,Muyldermans L,Cattrysse D,et al.A guided local search heuristic for the capacitated arc routing problem[J].European Journal of Operational Research,2003,147( 3 ) :629-643.
  • 8Lacomme P,Prins C,Ramdane-Cherif W.Competitive memetic algorithms for arc routing problems.Working Paper I,LOSI,Univ Tecnologie de Troyes, France,2001.
  • 9Lacomme P,Prins C.Ramdane-Cherif W.Fast algorithm for general arc routing problems[C]//IFORS 2002 Conference,Edinburgh,UK,2002.
  • 10Golden B L,Wong R T.Capacitated arc routing problems[J].Networks, 1981 : 305-315.

共引文献17

同被引文献3

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部