摘要
以压缩车辆在编组站停留时间为目标，建立编组站日班计划多商品网络流规划模型，考虑编组站装、卸、排空与列车出发计划综合协调问题，并通过网络分层分解方法，将一个多商品流问题分解为几个单商品流子问题，以寻得快速有效算法；并通过采用分枝定界策略，解决了编组站由于车流不足需停运出发列车运行线问题。从而，为日班计划的计算机自动编制提供一个优化决策基础。
Aiming at decreasing the station stop time of the vehicles ,the multicommoditynetwork flow model for the shift working plan of the railway marshalling station is set up forconsidering the coordination of loading,unloading,emptying and the trains,departure. Bymeans of the stratified decomposition of the network,a multicommodity network flow problem is decomposed into several single-commodity subproblems,thus a rapid and effective algorithm is found.By adopting the branch-bound strategy,the problem of the stoppage in departure because of lacking of the car flows is solved.An optimal decision base for automatically making the shift working plan of the marshalling station with computer is supplied.
出处
《铁道学报》
EI
CSCD
北大核心
1995年第4期8-15,共8页
Journal of the China Railway Society
关键词
日班计划
网络流模型
编组站
自动化
铁路
shift working plan
multicommodity network flow model
network decomposition
branch-bound strategy
marshalling station automation
