首页 | 本学科首页   官方微博 | 高级检索  
     检索      

树枝型专用线取送车的模型及算法研究
引用本文:黄向荣.树枝型专用线取送车的模型及算法研究[J].兰州铁道学院学报,2007,26(3):51-54.
作者姓名:黄向荣
作者单位:兰州交通大学,交通运输学院,甘肃,兰州,730070
摘    要:合理确定取送车作业顺序,有利于减少货车在站非生产时间,加速车辆周转,通过对取送车作业过程的分析,可以将其归纳为一个典型的旅行商问题.运用图论中的哈密尔顿图,可以将树枝型专用线取送车问题,转化为求哈密尔顿图中权值最小的哈密尔顿回路问题.

关 键 词:编组站  树枝型专用线  取送车作业  哈密尔顿图  最小生成树算法
文章编号:1001-4373(2007)03-0051-04
修稿时间:2006-10-27

Model of Wagons Placing-in and Taking-out on Brand-shaped Sidings and the Calculating Method
Huang Xiangrong.Model of Wagons Placing-in and Taking-out on Brand-shaped Sidings and the Calculating Method[J].Journal of Lanzhou Railway University,2007,26(3):51-54.
Authors:Huang Xiangrong
Institution:School of Traffic and Transportation Engineering, Lanzhou Jiaotong University, Lanzhou 730070,China
Abstract:Selecting a logical procedure of placing-in and taking-out operation,nonproductive detention time of wagon in the railway station can be reduced.Consequently,wagon turn-round can be accelerated.According to the analysis of placing-in and taking-out operation process,it is considered as a typical traveling salesman subject.By using Hamilton graph,the problem of wagons'placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.
Keywords:marshalling station  branch-shaped sidings  placing-in and taking-out operation  Hamilton graph  minimum spanning tree algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号