重载运输战略装车域车流组合方案优化
doi: 10.3969/j.issn.0258-2724.2012.06.023
Optimization of Railcar Flow Combination Scheme for Strategic Loading Domain Based on Heavy Haul Transportation
-
摘要: 为研究铁路重载运输装车端车流组织优化问题,首先分析了基于重载运输的战略装车域车流组织过程,将其按货源供给水平及运输组织方式划分为战略装车点、装车区及装车域3个层次,根据装车域车流以单元式重载列车和组合式重载列车进行组织的特征,以组合列车总组合时间最小化为目标,考虑年目标运量、线路能力、装车点(区)装车能力等约束条件,引入组合映射关系式表示组合站的车流接续关系,构建了符合我国重载线路装车域车流组织特征的车流组合方案优化模型,并设计了启发式算法进行求解.算例结果表明:根据论文提出的优化方法,可获得3种等价的组合方案,其中算例优化方案2与现场车流组织方案相符,其余两种等价组织方案的组合内容不同,但总时间消耗相同.Abstract: In order to investigate the railcar flow operation optimization of heavy haul transportation loading side, the railcar organization process in the strategic loading domain of heavy haul transportation was analyzed. According to the supply level of goods resource and transportation operation mode, the stations in the strategic loading area were classified into three levels, including strategic loading point, strategic loading area, and strategic loading domain. Then, a railcar flow combination scheme optimization model was established, which is based on the characteristics that car flows are organized in the way of unit heavy haul train and combined heavy haul train. In this model, minimization of the total combined time of the combined heavy haul train was the objective, the yearly target traffic volume, line capacity, loading capacity of loading point (area), etc. were constraints, and combination mapping was adopted to deal with the railcar flow delivery relationship in the combination station. In addition, an effective heuristic method was designed to solve the model. The results of a case study show that three equivalent combination schemes can be obtained by the proposed optimization method. Among them, optimization scheme 2 is consistent with the real railcar flow organization scheme, and the other two equivalent schemes, although with different combination contents, have the same time consumption.
-
杨浩. 铁路重载运输[M]. 北京:北京交通大学出版社,2010: 1-2. 范振平, 乐逸祥, 范登科,等. 基于蚁群算法的装车地直达重载运输优化模型求解算法研究[J]. 物流技术, 2007, 26(8): 110-114. FAN Zhenping, LE Yixiang, FAN Dengke, et al. Study on solution of non-stop heavy load transport optimization model from departure[J]. Logistics Technology, 2007, 26(8): 110-114. 何冯斌. 重载运输装车区车流组织及相关问题的研究. 成都: 西南交通大学,2007. 张进川, 杨浩, 魏玉光. 重载铁路装车端空车配送模型[J]. 中国铁道科学, 2009, 30(4): 113-117. ZHANG Jinchuan, YANG Hao, WEI Yuguang. Model of empty car distribution in the loading end of heavy haul railway[J]. China Railway Science, 2009, 30(4): 113-117. 王慈光. 目标规划在铁路重载运输组织中的应用[J]. 西南交通大学学报,2009,44(3): 392-395. WANG Ciguang. Application of goal programming in railway heavy haul transportation[J]. Journal of Southwest Jiaotong University, 2009, 44(3): 392-395. 赵鹏, 张进川, 唐宝刚. 基于组合列车的重载铁路装车区车流组织优化模型研究[J]. 中国铁道科学,2010,31(6): 116-121. ZHAO Peng, ZHANG Jinchuan, TANG Baogang. Study on the optimization model of car flow organization in the loading area of heavy haul railway based on the combined trains[J]. China Railway Science, 2010, 31(6): 116-121. 韩雪松, 赵军, 彭其渊. 多组合站条件下重载运输战略装车域列流组合方案优化[J]. 铁道学报, 2012, 34(8): 1-6. HAN Xuesong, ZHAO Jun, PENG Qiyuan. Optimization of train flow combination scheme for strategic heavy haul loading domain at multi-combination stations[J]. Journal of China Railway Society, 2012, 34(8): 1-6. 武汛. 大秦线运输组织系统研究[J]. 中国铁路,2009(6): 11-15. WU Xun. Research on transport organization system of Datong-Qinhuangdao railway line[J]. Chinese Railway, 2009(6): 11-15. DANTZIG G B. Linear programming and extensions[M]. New York: Princeton University Press, 1998: 52-53. NASH S G, SOFER A. Linear and nonlinear programming[M]. New York: McGraw-Hill, 1996: 156. MURTY K G. Linear and combinatorial programming[M]. Melbouren: Robert E Krieger Publishing Company, 1985: 592. DORFMAN R, SAMUELSON P A, SOLOW R M. Linear programming and economic analysis[M]. New York: Dover PUBN Inc., 1987: 324-325. NELDER J A, MEAD R. A simplex method for function minimization[J]. The Computer Journal, 1965, 7(4): 308. ECKER J G, KUPFERSCHMID M. Introduction to operations research[M]. Melbourne: Krieger Publishing Company, 1991: 24. IGNIZIO J P, CAVALIER T M. Linear programming[M]. New Jersey: Prentice-Hall Inc., 1994: 206.
点击查看大图
计量
- 文章访问数: 1112
- HTML全文浏览量: 54
- PDF下载量: 468
- 被引次数: 0