检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输与物流学院,四川成都610031
出 处:《铁道科学与工程学报》2015年第6期1507-1512,共6页Journal of Railway Science and Engineering
摘 要:以阶段内正点出发列车数最多为目标,构建考虑列车解体顺序和配流问题的广义动态配流问题模型;设计按照先到先服务的原则和贪婪思想为每一列车分配车流的启发式算法,并确定到解列车的解体顺序。在解体顺序的基础上,运用已编制好的编组站到解作业计划自动化编制系统确定到解列车到发线和调机运用。研究结果表明:构建的模型和编制的系统较好地实现编组站到解作业计划的自动编制,能为编组站实际工作中作业安排提供决策支持。Aiming at maximizing the number of punctual outbounding trains,the paper establishes the generalized dynamic wagon- flow allocation model considering the train disassembling sequence and wagon- flow allocation problems. The heuristic algorithm according to the principle of first come first service and greedy thought allocating wagon- flow for each train was designed,and the disassembling sequences of the disassembled trains was then determined. Finally,based on the disassembling sequences,the utilizing of up- and- down lines and locomotives are made with the application of automatic operation arrangement system for disassembled trains. The numerical experiments show that the models and system can well accomplish auto- scheduling of operation planning in a stage,and provide decision support for marshaling station in practical work assignments.
关 键 词:编组站 阶段计划 广义动态配流 启发式算法 到解作业
分 类 号:U291[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249