检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐晶 李季涛[1] XU Jing;LI Jitao(School of Traffic and Transportation Engineering,Dalian Jiaotong University,Dalian 116028,China)
机构地区:[1]大连交通大学交通运输工程学院,辽宁大连116028
出 处:《大连交通大学学报》2020年第5期20-28,共9页Journal of Dalian Jiaotong University
基 金:辽宁省教育厅科学研究计划资助项目(JDL2017037)。
摘 要:通过对影响铁路客运站到发线因素的分析建立了整数规划模型,研究并提出了求解该模型的启发式排序规则和禁忌搜索算法相结合的优化算法,该算法首先运用启发式排序规则给出模型的初始解,然后运用禁忌搜索算法采用分时间段求解的形式来优化到发线运用的初始方案,再对优化方案进行局部调整得到最终优化方案.最后,以某客运站为例验证了模型和算法的有效性.与传统车站人员编制的到发线运用计划相比,此优化算法编制的运用计划在考虑旅客服务质量的情况下线路均衡使用率提高,避免了人为的扰动因素,提高了到发线运用计划生成的灵活性和精确度.An integer programming model is established by analyzing the factors that affect the arrival and departure tracks of railway passenger stations,and an optimization algorithm is studied and proposed that combines heuristic schedule rules and Tabu search to solve the model.The algorithm firstly uses heuristic schedule rules to give the initial solution of the model,then uses Tabu search to optimize the initial plan for the arrival-departure of railway passenger stations in time periods,and finally adjusts the optimization plan locally to obtain the final optimization plan.The effectiveness of the model and algorithm is verified based on the study of an example.Compared with the traditional application scheme of arrival and departure tracks compiled by station personnel,the optimization scheme compiled by this optimization algorithm can avoid human disturbance factors and improves the generation flexibility of arrival and departure tracks with higher accuracy.
分 类 号:U292[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15