检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《中国铁道科学》2008年第2期126-130,共5页China Railway Science
基 金:北京交通大学校基金资助项目(2004SZ004)
摘 要:在编组站货物列车定点集结模式下,车列集结结束、安排不同列车出发属于周期事件安排问题。根据周期事件安排问题(PESP)理论,充分考虑车站作业能力及区间能力约束,将各列车发车时间点及相互间的周期约束用周期约束图表示。根据实际生产需求,以有利于机车周转、尽可能均衡分配发车时间点为目标函数,建立货车定点发车时刻表模型。选择合适的周期约束图生成树,根据PESP有解的充分必要条件,设计求解该模型的遗传算法。以丰台西编组站京广方向车流为例,利用建立的模型和遗传算法进行求解。计算结果表明:选择合适的生成树构建基本圈组,有利于降低模型求解的复杂程度;通过加入有可行解的充分必要条件,能够有效减少模型的求解时间;可以得到货物列车定点出发时刻表、平均集结车小时和出发列车平均编成辆数。Under the mode of freight trains accumulation with fixed time in marshalling station, it is a periodic event scheduling problem to end car group accumulation and to schedule different trains. According to the theory of Periodic Event Scheduling Problem (PESP), fully considering station operation capability and line carrying capability constraints, departing time of each train and periodic constraints between them are illustrated by periodic constraint graph. Based on the actual working requirements, the model of fixedtime-departure timetable of freight trains is established with benefiting locomotive operating and distributing departing times as evenly as possible as the objective functions. The model genetic algorithm is designed and solved by selecting proper spanning tree of periodic constraint graph and according to the sufficient and necessary condition of PESP. Taking the car flow in Beijing-Guangzhou direction in Fengtai West Marshalling Station as an example, the solution is obtained by the designed genetic algorithm. Calculation result demonstrates that it is probable to get a fixed-time-departure timetable of trains by selecting proper spanning tree to construct fundamental circle basis to help reduce the complexity of solving the model. The sufficient and necessary condition is added to get the feasible solution, which can efficiently save the time of solving the model to get freight train departure timetable at fixed time, the average accumulation hour and the average formation number of departure trains.
关 键 词:周期时间窗 周期事件安排问题 货物列车 定点集结 周期时刻表 遗传算法
分 类 号:U292.21[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175