检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《交通运输系统工程与信息》2014年第4期120-125,共6页Journal of Transportation Systems Engineering and Information Technology
基 金:国家科技支撑计划(2009BAG12A10-7);铁道部科技司项目(2012X011-C);中央高校基本科研业务费专项资金资助(2013YJS046)
摘 要:本文从Job-Shop调度角度出发,以列车为待加工的'工件',将车站接车进路、到发线和发车进路看作'加工机器',列车在车站的走行与停站看做不同的'作业工序',把高速铁路车站作业问题抽象成Job-Shop车间调度优化,以设备能力、冲突进路、停站时间为空间和时间约束,以最小化到发线的占用时间为优化目标,建立高速铁路车站作业优化模型.采用拉格朗日方法松弛原模型的约束条件,建立车站技术作业问题的拉格朗日对偶松弛问题,设计了高速铁路车站作业优化模型算法.并以高速铁路的某一车站为实例进行验证,实例表明,该算法可以有效地化解车站作业进路冲突和实现到发线运用时间的最小化.This paper applies the Job-Shop scheduling theory to station operation optimization of highspeed railway. In this study, trains are regarded as workpieces, the arrival-departure tracks, inbound and outbound road are regarded as machines, trains' operations at a station are treated as different works. In this way, the station operation optimization problem can be transformed into a special kind of job-shop problem.The study takes the station equipment capacity, conflicts in inbound road and outbound road, station dwell time as the space and time constraints. The optimization goal is to minimize dwell time of trains., Then, the paper develops the high-speed railway station operation optimization model and the corresponding Lagrangian relaxation model of station operation. The optimization algorithm is also proposed for high-speed railway station technique operation. A real high-speed railway station case shows that the model and algorithm are able to generate the optimization plan for high-speed railway station operation and they can effectively eliminate the conflicts in inbound road and outbound road.
关 键 词:铁路运输 车站作业优化 JOB-SHOP 拉格朗日松弛 次梯度算法
分 类 号:U292.1[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.120