检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:薛锋[1,2] 甘易玄 孙宗胜 XUE Feng;GAN Yi-xuan;SUN Zong-sheng(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu Sichuan 611756,China;National Engineering Laboratory of Integrated Transportation Big Data Application Technology,Southwest Jiao tong University,Chengdu Sichuan 611756,China)
机构地区:[1]西南交通大学交通运输与物流学院,四川成都611756 [2]西南交通大学综合交通大数据应用技术国家工程实验室,四川成都611756
出 处:《计算机仿真》2021年第12期99-104,共6页Computer Simulation
基 金:国家自然科学基金项目(61203175);四川省科技计划项目(2019YJ0211);综合交通大数据应用技术国家工程实验室开放基金项目(CTBDAT201902,CTBDAT201911)。
摘 要:铁路货车集结的定编和定点模式各有优势,为提高货车在技术站间的转移效率,需在二者之间找到一个平衡点。根据定编和定点发车模式下的编组站车组集结过程,并结合后方技术站作业时间窗的约束,建立了半定编发车模式下技术站时间窗约束作业模型。以降低运输成本,实现效益最大化为目标,利用MATLAB仿真模拟找到两种发车模式下运输成本差值与最佳最小编成辆数,以及无效时间窗占比之间的关系,并分析了站间区间距离、时间窗长度对最佳最小编成辆数的影响。仿真结果表明,最佳最小编成辆数依不同的站间情况有所变化,时间窗长度对编成辆数的影响有显著差异性。In order to improve the transfer efficiency of freight cars between technical stations, it is necessary to find a balance between the two. According to the assembly process of marshalling station train sets under fixed marshalling and fixed-point departure mode, and combined with the constraints of operation time window of rear technical station, the time window constraint operation model of technical station under semi fixed marshalling departure mode was established. With the goal of reducing transportation costs and maximizing benefits, MATLAB simulation was used to find the relationship between the transportation cost difference and the optimal minimum number of cars in two modes, and the relationship between the cost difference and the proportion of invalid time window. And the effect of the distance between stations and the length of the time window on the optimal minimum number of cars was analyzed. The simulation results show that the optimal minimum number of cars varies with different station conditions, and the effect of the length of the time window on the number of cars is significantly different.
关 键 词:铁路运输 货车集结 时间窗 最佳最小编成辆数 仿真
分 类 号:N945.12[自然科学总论—系统科学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63