检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]铁道部经济规划研究院运输咨询部,北京100038 [2]北京交通大学交通运输学院,北京100044 [3]杭州杭港地铁有限公司运营支持室,浙江杭州310000
出 处:《铁道运输与经济》2014年第4期60-65,共6页Railway Transport and Economy
基 金:铁道部前期资助课题(J2013Z017)
摘 要:通过阐述高速铁路成网后对动车组运用计划的影响,分析成网条件下的动车组运用计划,分步骤构建时空网络,以路径费用最小为目标函数,综合考虑动车组运用计划和检修计划等相关约束,建立动车组运用计划优化模型,选用大规模邻域搜索算法进行模型求解。以京沪、沪宁高速铁路数据为例,验证该算法的可行性和有效性。比较大规模邻域搜索算法与模拟退火算法的优化结果,认为大规模邻域搜索算法能够较快地获取优化结果。This paper analyzes the influence on EMU utilization plan after high-speed railways network formed, describes the problems of EMU utilization plan under the condition that network formed, and puts forward establishing time-space network step by step. Through taking the minimum route fee as object function, the relative restrictions like EMU utilization plan and maintenance plan were considered comprehensively, the optimization model of EMU utilization plan was established and the model was solved by using large-scale neighborhood search algorithm. Taking Beijing-Shanghai and Shanghai-Nanjing high-speed railway data as examples, the feasibility and availability of the algorithm was validated. Through comparing the optimization results of large-scale neighborhood search algorithm and simulated annealing algorithm, the large neighborhood search algorithm was thought can achieve optimization result much faster.
关 键 词:高速铁路 成网 动车组运用计划 时空网络 大规模邻域搜索算法
分 类 号:U266[机械工程—车辆工程] U292.35[交通运输工程—载运工具运用工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.51.214