检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李静[1] 帅斌[1] 许旻昊 朱伟波 LI Jing;SHUAI Bin;XU Min-hao;ZHUWei-bo(School of Transportation & Logistics, Southwest Jiaotong University, Chengdu 610031, China)
机构地区:[1]西南交通大学交通运输与物流学院
出 处:《交通运输系统工程与信息》2019年第3期88-95,共8页Journal of Transportation Systems Engineering and Information Technology
摘 要:货车集结是不可避免且耗时较长的技术作业环节,编成辆数与车辆集结延误时间密切相关.针对编成辆数问题,建立描述车辆在调车场集结过程的批到达批服务排队模型,分析车辆集结队长及延误时间等指标,并从经济角度求得最优最小编成辆数.结果表明,最优最小编成辆数受车组到达规律、车流到达强度和列车发车时间间隔影响.到达车组大小满足指数分布时,采用最优最小编成辆数策略节省经济效益优于几何分布和负二项分布;车流到达强度较小时,节省经济效益更显著;列车出发时间间隔分布满足几何分布时,效益优于负二项分布和均匀分布.The accumulation is an inevitable and time-consuming railway technical operation, and the number of cars is closely related. A batch-arrival and batch-service queuing model for arrival-assembly-departure of cars was carried on using the method of queuing theory. Performance measures such as queue length and accumulation delays were discussed and then the optimal minimum number of cars considering economic efficiency was obtained. The numerical results show that the optimal minimum number of cars is related to car arriving pattern, arriving intensity and distributions of train departure schedules:(1) from the perspective of economic efficiency when adopting the optimal minimum number strategy, the case of arriving batch size satisfying exponential distribution is better than cases of geometric and negative binomial distributions;(2) when the arriving intensity is smaller, the economic efficiency is more remarkable;(3) the case of train departure schedules satisfying geometric distribution is better than cases of negative binomial and uniform distributions.
关 键 词:铁路运输 集结延误 排队系统 批到达 批服务 最小编成辆数
分 类 号:U292.3[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3