检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:应沛然 曾小清[1] 沈拓 袁腾飞 宋海峰 王奕曾 YING Pei-ran;ZENG Xiao-qing;SHEN Tuo;YUAN Teng-fei;SONG Hai-feng;WANG Yi-zeng(Key Laboratory of Road and Traffic Engineering,Ministry of Education,Tongji University,Shanghai 201804,China;School of Optical-Electrical and Computer Engineering,University of Shanghai for Science and Technology,Shanghai 200093,China;Shanghai Key Laboratory of Rail Infrastructure Durability and System Safety,Shanghai 201804,China;SHU-UTS SILC Business School,Shanghai University,Shanghai 201800,China;Shanghai Engineering Research Center of Urban Infrastructure Renewal,Shanghai 200032,China;School of Electronic Information Engineering,Beihang University,Beijing 100191,China;Department of Computer Science,City University of Hong Kong,Hongkong 999077,China)
机构地区:[1]同济大学道路与交通工程教育部重点实验室,上海201804 [2]上海理工大学光电与计算机工程学院,上海200093 [3]上海市轨道交通结构耐久与系统安全重点实验室,上海201804 [4]上海大学悉尼工商学院,上海201800 [5]上海城市基础设施更新工程技术研究中心,上海200032 [6]北京航空航天大学电子信息工程学院,北京100191 [7]香港城市大学计算机科学系,中国香港999077
出 处:《吉林大学学报(工学版)》2023年第12期3404-3414,共11页Journal of Jilin University:Engineering and Technology Edition
基 金:国家自然科学基金项目(61903021);国家留学基金项目(202106260137);上海市科委项目(20dz1202903-0.1,19DZ1204202,19DZ1201803,20DZ2251900);上海市住建委项目(JS-KY18R022-7);北京市自然科学基金项目(L211021)。
摘 要:针对任意类型坡道组合和限速环境下高速列车节能驾驶优化问题,依据极大值原理推导得到最优解必要性条件,提出了包括冗余工序及其切换点区间的冗余工序编码概念和生成规则,设计了冗余工序编码分别与粒子群算法和有限变异遗传算法相结合的PMP-PSO算法和PMP-LMGA算法,用以归并部分冗余工况并优化切换点位置。实验结果表明:在满足各项运行规则前提下,运用冗余工序编码可以显著加快复杂场景下的求解速度,稳定且有效降低总能耗,同时,应用多智能体并行计算可进一步提升求解效率。Two redundant operation code-based methods were proposed to solve the energy-efficient driving problem of a high-speed train with steep gradients and speed limits.Based on the necessary conditions for the optimal solution derived from the Pontryagin's maximum principle,the concept of redundant operation code,including redundant operation sequence and switching area,and the generation rules were proposed.Applying the new concept,PMP-LMGA and PMP-PSO algorithms were developed to merge redundant operations and find optimal switching points.The experimental results indicate that the redundant operation code can significantly speed up the calculation in complex scenarios.Total energy consumption can be effectively and stably reduced while meeting various operation rules.Multi-agent parallel computing can further improve solution efficiency.
关 键 词:铁路运输 冗余工序编码 有限变异遗传算法 粒子群算法
分 类 号:U238[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38