高速综合检测列车检测区域划分方法研究

doi:10.16097/j.cnki.1009-6744.2025.01.030

交通运输系统工程与信息 ›› 2025, Vol. 25 ›› Issue (1): 319-330.DOI: 10.16097/j.cnki.1009-6744.2025.01.030

高速综合检测列车检测区域划分方法研究

许旻昊^*1，薛凯肇¹，帅斌²，王宇³，杨乔礼¹，左静¹，张雁鹏¹

1. 兰州交通大学，自动化与电气工程学院，兰州730070；2.西南交通大学，交通运输与物流学院，成都611756；3. 大连交通大学，交通运输工程学院，辽宁大连116028

收稿日期:2024-12-08 修回日期:2024-12-23 接受日期:2025-01-06 出版日期:2025-02-25 发布日期:2025-02-24
作者简介:许旻昊(1995—)，男，四川成都人，讲师，博士。
基金资助:
中国国家铁路集团有限公司科技研究开发计划重点课题(N2024G040)；甘肃省高校教师创新基金项目(2025B-063)；辽宁省自然科学基金面上项目(2023-MS-273)。

Network Districting Plan Optimization for Comprehensive Inspection Trains

XU Minhao^*1, XUE Kaizhao¹, SHUAI Bin², WANG Yu³,YANG Qiaoli¹,ZUO Jing¹, ZHANG Yanpeng¹

1. School of Automation and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China; 2. School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 611756, China; 3. School of Transportation Engineering, Dalian Jiaotong University, Dalian 116028, Liaoning, China

Received:2024-12-08 Revised:2024-12-23 Accepted:2025-01-06 Online:2025-02-25 Published:2025-02-24
Supported by:
China National Railway Group Corporation Science and Technology Research and Development Program Key Project (N2024G040)；Innovative Foundation for Universities Teachers of Gansu Province, China (2025B-063)；Natural Science Foundation of Liaoning Province, China (2023-MS-273)。

摘要/Abstract

摘要： 为解决传统人工经验模式划分高速综合检测列车(CIT)检测区域，难以保证合理性和公平性的不足，本文提出以任务均衡性和结构紧凑性为双目标的混合整数线性规划模型为核心的检测区域划分方法。该模型综合考虑覆盖完整性、达速检测、线-车特殊属性匹配及检测区域连通等关键约束；基于多商品流模型，构建适用于具有复杂异质性和向下兼容且非唯一匹配关系的连通性判定约束；以各目标单独求解对应最优解的倒数作为目标权重，将原模型转为与各目标总实现程度最大化的单目标混合整数线性规划模型；最后，设计不同场景的计算实验，得出影响分区方案质量的关键因素，并将所提方法运用于实际规模的线网进行测试。实验结果表明：CIT异质性对划分方案的质量与求解速度影响最为显著；本文提出的检测区域划分方法可有效解决人工编制模式无法兼顾均衡检测负荷与减少异地出差的局限；使用10列CIT时，划分方案与理想解总偏差仅为2.84%，显著优于人工方案。本文可为指导检测资源配置提供决策依据。

关键词: 铁路运输, 区域划分方案, 混合整数规划模型, 综合检测列车, 分区问题, 异质性

Abstract: To address the limitations of the traditional manual experience-based districting of Comprehensive Inspection Train (CIT) inspection areas, this paper proposes an optimization method for the districting plans based on a mixed-integer linear programming (MILP) model with the objectives of task balance and structural compactness. The method incorporates key constraints such as coverage integrity, inspections under up-to-speed conditions, line-vehicle attribute matching, and inspection area connectivity. The adjudication constraints are defined for connectivity with complex heterogeneity and downward compatible and non-unique matching relationship based on multi-flow model. Based on the ideal point method, the inverse of each objective's optimal solution is used as a weight, converting the original multi-objective model into a single-objective MILP to maximize the overall performance. Computational experiments are conducted across various scenarios to identify the key factors influencing the districting plan's quality. The proposed method is then applied to an actual large-scale network to provide decision support for inspection resource allocation. Experimental results indicate that CIT heterogeneity significantly affects both the quality of the districting plan and solution speed. The proposed districting method effectively mitigates the limitations of manual methods by balancing inspection loads and reducing off-site travel. With 10 CITs, the total deviation from the ideal solution is 2.84%, demonstrating a marked improvement over existing manual method.

Key words: railway transportation, districting plan, mixed-integer programming model, comprehensive inspection train, districting problem, heterogeneity

中图分类号:

U292.8

许旻昊, 薛凯肇, 帅斌, 王宇, 杨乔礼, 左静, 张雁鹏. 高速综合检测列车检测区域划分方法研究[J]. 交通运输系统工程与信息, 2025, 25(1): 319-330.

XU Minhao, XUE Kaizhao, SHUAI Bin, WANG Yu, YANG Qiaoli, ZUO Jing, ZHANG Yanpeng. Network Districting Plan Optimization for Comprehensive Inspection Trains[J]. Journal of Transportation Systems Engineering and Information Technology, 2025, 25(1): 319-330.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/10.16097/j.cnki.1009-6744.2025.01.030

http://www.tseit.org.cn/CN/Y2025/V25/I1/319

参考文献

[1]KALCSICS J, RIOS-MERCADO R Z. Districting problems[M]//Laporte G, Nickel S, Saldanha da Gama F. Location Science. Cham: Springer International Publishing, 2019.

[2]PERRIERr N, LANGEVIN A, CAMPBELL J F. The sector design and assignment problem for snow disposal operations[J]. European Journal of Operational Research, 2008, 189(2): 508-525.

[3]WANG D, ZHAO J, D'ARIANO A, et al. Simultaneous node and link districting in transportation networks: Model, algorithms and railway application[J]. European Journal of Operational Research, 2021, 292(1): 73-94.

[4]CHEN H, CHENG T, YE X. Designing efficient and balanced police patrol districts on an urban street network[J]. International Journal of Geographical Information Science, 2019, 33(2): 269-290.

[5]赵星,吉康,申珂.基于多旅行商问题的应急设施服务区划分模型[J]. 交通运输系统工程与信息,2020,20(5): 205-211. [ZHAO X, JI K, SHEN K. A service area division model for emergency facilities based on multiple traveling salesman problem[J]. Journal of Transportation Systems Engineering and Information Technology, 2020, 20(5): 205-211.]

[6]XIE S, OUYANG Y. Railroad caller districting with reliability, contiguity, balance, and compactness considerations[J]. Transportation Research Part C: Emerging Technologies, 2016, 73: 65-76.

[7]ASSIS L S D, FRANCA P M, USBERTI F L. A redistricting problem applied to meter reading in power distribution networks[J]. Computers & Operations Research, 2014, 41: 65-75.

[8]XU M, SHUAI B, WANG X, et al. A two-stage optimization approach for inspection plan formulation of comprehensive inspection train: The China case[J]. Computers & Industrial Engineering, 2021, 159: 107465.

[9]SHIRABE T. Districting modeling with exact contiguity constraints[J]. Environment and Planning B: Planning and Design, 2009, 36(6): 1053-1066.

[10] BUTSCH A, KALCSICS J, LAPORTE G. Districting for arc routing[J]. Informs Journal on Computing, 2014, 26 (4): 809-824.

[11] 张璞, 赵鹏, 乔珂,等.考虑旅客换乘的高速铁路列车运行调整研究[J]. 铁道学报,2022,44(2): 8-15.[ZHANG P, ZHAO P, QIAO K, et al. Research on high speed railway timetable rescheduling considering passenger transfer[J]. Journal of the China Railway Society, 2022, 44(2): 8-15.]

[12] MUNOZ-VILLAMIZAR A, MONTOYA-TORRES J R, FAULIN J. Impact of the use of electric vehicles in collaborative urban transport networks: A case study[J]. Transportation Research Part D: Transport and Environment, 2017, 50: 40-54.

[13] CHEN L, XU P, YAN X, et al. Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with Iitermediate facilities[J]. Computers & Operations Research, 2023, 150: 106052.

[1]	翁剑成, 周慧缘, 张梦媛, 于江波. 考虑城市与群体异质的新能源车激励策略有效性研究[J]. 交通运输系统工程与信息, 2025, 25(1): 2-14.
[2]	林俊亭, 李茂林, 邱晓辉. 延误场景下列车速度曲线与动态调度联合优化方法[J]. 交通运输系统工程与信息, 2025, 25(1): 173-187.
[3]	邬岚, 周佳雨, 李根. 技术标准更新视角下电动自行车事故严重程度影响因素演化分析[J]. 交通运输系统工程与信息, 2025, 25(1): 231-240.
[4]	吴刚, 杨锋, 江山, 郭茜. 基于霍特林模型的中欧班列最佳补贴值[J]. 交通运输系统工程与信息, 2025, 25(1): 289-297.
[5]	林译峰, 温惠英. 高速公路隧道不同车辆实时跟驰风险影响因素分析[J]. 交通运输系统工程与信息, 2025, 25(1): 298-310.
[6]	刘路, 车宇禄, 朱宇婷, 周小光, 光志瑞. 地铁站属性对共享单车出行影响的异质性研究[J]. 交通运输系统工程与信息, 2024, 24(6): 135-144.
[7]	高如虎, 王倩瑜, 牛惠民. 高铁快运夜间列车服务方案集成优化[J]. 交通运输系统工程与信息, 2024, 24(6): 254-264.
[8]	刘兰芬, 杨信丰, 杨珂, 王东梁. 线路运行中断下铁路旅客列车单向接运方案研究[J]. 交通运输系统工程与信息, 2024, 24(6): 265-274.
[9]	李海军, 张晓洋, 高如虎, 魏德华, 陈晓明. 融合麻雀搜索与长短时记忆的疆煤铁路外运量预测[J]. 交通运输系统工程与信息, 2024, 24(5): 14-23.
[10]	曹猛, 袁振洲, 杨洋, 聂英杰, 那艳玲, 孙云超, 陈进杰. 京雄城际铁路全生命周期能耗及碳排放研究[J]. 交通运输系统工程与信息, 2024, 24(5): 37-44.
[11]	周厚盛, 戚建国, 杨立兴, 石俊刚, 张慧敏. 虚拟编组条件下城轨列车单元灵活运用方法[J]. 交通运输系统工程与信息, 2024, 24(5): 140-147.
[12]	杜鹏, 张路瑶. 考虑运行图抽线调整的城际铁路动车周转计划编制[J]. 交通运输系统工程与信息, 2024, 24(5): 148-159.
[13]	许景, 邓连波, 刘华儒, 胡心磊. 高铁列车动态定价与预售时段划分综合优化方法[J]. 交通运输系统工程与信息, 2024, 24(5): 259-267.
[14]	刘峻麟, 张戎, 孟祥涛, 王玉光, 李子睿. 基于货运方式选择模型的铁路白货运输定价方法[J]. 交通运输系统工程与信息, 2024, 24(4): 23-30.
[15]	帅斌, 罗佳楠, 冯心妍, 黄文成. 虚拟编组下基于跟驰模型的列车群运行控制方法研究[J]. 交通运输系统工程与信息, 2024, 24(3): 1-11.

高速综合检测列车检测区域划分方法研究

Network Districting Plan Optimization for Comprehensive Inspection Trains

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics