检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《铁道学报》2012年第2期1-7,共7页Journal of the China Railway Society
摘 要:定点集结是一种高效率的集结方式,有利于运输质量的提高,其解体顺序的确定是阶段计划的关键问题,优化解体顺序可以有效节约中时,组流上线。本文比较定点集结模式与定编集结模式的优缺点及适用性,进一步分析放宽条件定点集结模式对于解体顺序优化的影响,建立放宽条件定点集结模式下的解体顺序优化模型,模型利用编组站能力、作业时间标准、最小编成辆数等作为限定条件,以有调中时最短作为目标函数进行车流推算,并采用遗传算法得到满足条件的最优解体顺序。以丰台西编组站上行系统为例进行模型的实际应用,验证了模型的有效性。Time-fixed assembling is a highly efficient mode,which is propitious to improve transport quality.Determination of its sorting sequence is the key point of the stage plan.Optimization of the sorting sequence may save transfer time and ensure punctual departure of the train.In this paper the time-fixed assembly mode and the marshalling-fixed assembly mode were compared in respect of their advantages chisadvantage and applicability.The influence of the time-fixed assembly mode with softened terms on optimization of the marshalling station transport organization and the sorting sequence was analyzed.The sorting-sequence optimizing model was buiet in the stable point assembly mode under muctiple limiting conditions inclusive of the capability of the marshalling station,the operation time standard and the least marshalling number of cars.The least average detention time of cars in transit was taken as the objective function to estimate wagon flow.The genetic algorithm was employed to work out the required optimal sorting sequence.The model was verified by example of the Fengtai West Marshalling Station.
分 类 号:U292.16[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.118