检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:于婕 彭其渊[1,2] 邓永洁 YU Jie;PENG Qiyuan;DENG Yongjie(School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 611756,Sichuan,China;National United Engineering Laboratory of Integrated and Intelligent Transportation,Southwest Jiaotong University,Chengdu 611756,Sichuan,China)
机构地区:[1]西南交通大学交通运输与物流学院,四川成都611756 [2]西南交通大学综合交通运输智能化国家地方联合工程实验室,四川成都611756
出 处:《铁道运输与经济》2023年第9期1-8,共8页Railway Transport and Economy
基 金:国家自然科学基金-高铁联合基金项目(U1834209)。
摘 要:技术站配流作为货物运输的重要环节,影响着货物运输的时间和效率。为实现运到期限的兑现,以考虑运到期限的技术站动态配流为研究对象,将运到期限利用蒙特卡洛法分配到技术站转化为最大在站停留时间约束,引入优先级来评价货物的紧急程度,以优先级加权的货物总在站停留时间最小和发出总车辆数最多为双目标,为避免列车不合理停运,考虑不同满轴约束条件及摘挂、小运转列车可欠轴发出等车站实际,构建了混合整数规划模型,设计遗传模拟退火算法并采用软件求解。算例表明:与既有方法相比,研究的模型与算法能充分配流使得所有出发列车正点发出,优先处理优先级高的货物以减少其在站停留时间,且能保障所有货物不同运到期限的要求。Wagon-flow allocation in railway technical stations,as an important part of cargo transportation,affects the delivery time and efficiency of cargo transportation.To guarantee the transit period,this paper took the dynamic wagonflow allocation in railway technical stations considering the transit period as the subject.The Monte Carlo method was utilized to allocate the transit period to the railway technical station and the transit period was converted into the maximum retention time constraint.The priority was introduced to evaluate the urgency of cargo.The dual objectives were the minimum priority-weighted total retention time and the maximum total number of departure trains.To avoid the unreasonable halt of trains,the paper built a mixed integer programming model considering the different size limitations of departure trains and the actual situation of the station that pick-up goods train and district transfer train can be sent out under axle.A genetic simulated annealing algorithm was designed and solved by MATLAB.The result of numerical examples demonstrates that compared with the available methods,the proposed model and algorithm can fully allocate wagon flow to dispatch all departure trains on time,prioritize the high-priority cargo,reduce their retention time at the station,and guarantee transit period.
关 键 词:铁路货物运输 运到期限 技术站 动态配流 遗传模拟退火算法
分 类 号:U292.16[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49