重载运输战略装车域运输组织优化研究
|
摘要
重载运输装车端作为重载线路货源的主要产生地,其运输组织方法对于保证重载运输的顺利进行,提高重载线路运输能力有着重要影响。现状运输组织方式,随意性较大,一定程度上制约了重载线路运输能力的提高。本文以重载线路装车端战略装车域为研究范围,优化其运输组织方案及组合站组合方案,以求获得符合我国重载运输特征的战略装车域组织作业方法,使得重载运输作业方案更加高效、准确,主要研究内容包括以下几个方面：
(1)回顾了国内外重载运输发展历程,归纳了关于重载运输及战略装车区的研究进展；将装车区域范围内的装车站点按照其货源供给状况及运输组织方式划分为重载线路战略装车点、战略装车区及战略装车域三个层次,并对重载运输组织的软硬件基础进行阐述。
(2)对重载运输专线作业过程进行分析,归纳出我国重载运输集疏运系统车流组织特征。提出单组合站条件下重载运输战略装车域车流总体组合方案优化问题(RCSH),并建立双目标线性规划模型；根据案例的实际背景设计启发式规则简化模型,并通过构建隶属度函数的方法获得多目标规划的模糊最优解。结果显示：通过模型优化后战略装车域范围内车流可在减少时间消耗的同时,增大系统运输能力。
(3)阐述重载运输组合站组合特征,分析影响组合站组合作业的主要因素,定义重载运输组合站组合方案优化问题(SCCHP).在此基础上建立“静态条件下”重载运输组合站组合方案规划模型。对模型求解的难点进行分析,并通过随机算例验证分析结论,尝试m-GA、p-GA等不同算法进行求解,最后设计MMAS算法对问题进行求解。实验证实：MMAS算法在求解SCCHP问题时具有较好的时效性,其平均最优隔小于5%。
(4)提出重载运输组合站组合作业的“动态有利性假设”,并定义基于动态调整的重载运输组合站组合方案优化问题(DCCHP),并以战略装车域范围内时间消耗尽可能小及发车满意度最大为目标,建立双目标非线性规划模型。最后通过实例验证了假设的正确性,并获得“动态条件下组合站组合方案的优化效果并不十分明显”的结论；其次通过阐述典型组合站到发线布置形式及组合作业过程,归纳出组合站重车到发线运用特征,定义了基于到发线运用的重载运输组合站组合方案优化问题(SCCTP),并对模型性质进行分析,得出不同组合方案的有利性定理。推论结果显示：以加速单元重载列车出站为目标,去向相同的组合列车、去向不同的组合列车、单元2万吨列车、单元1万吨列车,其优越性依次降低。
(5)在综合前述章节的研究内容的基础上,建立重载运输战略装车域车流组合方案综合优化问题(CCCH)的双层规划模型,提出上下层规划问的调整规则,并根据下层规划模型特征及前述分析的模型性质,提出“表格法”进行编程求解。最后通过实例验证了模型及算法的可行性。
上述研究不仅对于重载运输战略装车域车流组织优化具有实际指导意义,同时对于丰富重载运输理论体系具有积极的作用。
The loading area is often regarded as original cargo source area, its transport organization method is very important for ensuring heavy line to run smoothly. And now, the status quo of heavy haul transporation organization is not accurated enough, which restricted the transport capacity. Therefore, this thesis regards the stragetic loading domain as the research scope, optimizes its transport organization scheme and combination scheme of combination station, in order to acquire reasonable organization methods for Chinese heavy haul lines. The main research contents are as followed:
(1) This paper reviews the development of heavy haul transportation in the world, summarizes the research progress of heavy haul transportation and stratic loading area. Then, dividesthe loading points within the loading domain into three levels, stratic loading points, stratic loading areas and stratic loading domain in accordance with its sources of supply conditions and transport organization methods,at last elaborates the softwares and hardwares of heavy haul transport organization.
(2) This paper analyzes the operating process of heavy haul transportation, proposes the characteristics of the collection and distribution system. Based on above, the overall combination scheme optimization problem of stratic loading domain for heavy haul transportation is proposed under the conditon of single combined station, and a bi-objective linear programming model is established.Heuristic rules based on the actual background of the case are also proposed to simplify the model, and membership function method is adopted to solve the model and acquire multi-objective planning fuzzy optimal solution.The results show that:after the optimization, the time consumption of car flow within the scope of the strategic loading domain decreases while transport capacity enhances at the same time.
(3) The paper elaborates the combination characteristics of combination station and analyzes the main factors affecting the combined operations of the combined station, then defines combination scheme optimization problem of combination station for heavy haul transportation (SCCHP). And based on these, the single objective nonlinear mathematical programming model is establised under the static condition. For the above model, the difficulty of analysis is being carried out at first, random examples are generated to verify the above analysis, then different algorithms like m-GA, p-GA are designed for attempting to slpve the model. Finally, MMAS algorithm is designed to solve the problem successfully.The experiments confirmed that:the MMAS algorithm in solving SCCHP has better performance on time consumption, and the average optimal separation is less than5%.
(4) Firstly, The paper proposes dynamic favorable assumptions for combination station of heavy haul transportation and defines combination scheme optimization for combination station of heavy haul transportation under dynamic condition (DCCHP).A bi-objective nonlinear programming mode is established which takes the time consuming as small as possible within the scope of stratic loading domain and and departure satisfaction degrees maximum as the goal, and finally a case is proposed to verify the correctness of the assumptions. However, the optimization effect is not very obvious under dynamic conditions. Secondly, the paper elaborates the classicalstation styles and working progresses of combinations stations, and based on this utilization characteristics of heavy tracks are acquired and combination scheme optimization problem for combination station of heavy haul transportation based on track utilization(SCCTP) is defined, and the model natures are analyzed, gets some favorable theorems of different combination schemes. The corollary shows that:if taking heavy haul train speeding up to departure as objective, those trains, trains with same directions, trains with different directions, unit trains with the weight of20thousand tons and unit trains with the weight of10thousand tons. Their superiorities are in order of decreasing.
(5) Based on the foregoing research results, a bi-level programming model is established for carflow comprehensive optimization of heavy haul transportation within stratic loading domain, and adjustment rules between the upper and lower are proposed, then, according to the characteristics of lower level programming model and the aforementioned analysis modelnatures, the paper puts forward the form method to solve the problem. Finally, an example is proposed to verfy the feasibility of the model and algorithm.
The research is not only a practical guide for car flow organization optimization of strategy loading domain of heavy haul transportation, but also has a positive effect for rich theoretical system of heavy hual transportation.
(1)回顾了国内外重载运输发展历程,归纳了关于重载运输及战略装车区的研究进展；将装车区域范围内的装车站点按照其货源供给状况及运输组织方式划分为重载线路战略装车点、战略装车区及战略装车域三个层次,并对重载运输组织的软硬件基础进行阐述。
(2)对重载运输专线作业过程进行分析,归纳出我国重载运输集疏运系统车流组织特征。提出单组合站条件下重载运输战略装车域车流总体组合方案优化问题(RCSH),并建立双目标线性规划模型；根据案例的实际背景设计启发式规则简化模型,并通过构建隶属度函数的方法获得多目标规划的模糊最优解。结果显示：通过模型优化后战略装车域范围内车流可在减少时间消耗的同时,增大系统运输能力。
(3)阐述重载运输组合站组合特征,分析影响组合站组合作业的主要因素,定义重载运输组合站组合方案优化问题(SCCHP).在此基础上建立“静态条件下”重载运输组合站组合方案规划模型。对模型求解的难点进行分析,并通过随机算例验证分析结论,尝试m-GA、p-GA等不同算法进行求解,最后设计MMAS算法对问题进行求解。实验证实：MMAS算法在求解SCCHP问题时具有较好的时效性,其平均最优隔小于5%。
(4)提出重载运输组合站组合作业的“动态有利性假设”,并定义基于动态调整的重载运输组合站组合方案优化问题(DCCHP),并以战略装车域范围内时间消耗尽可能小及发车满意度最大为目标,建立双目标非线性规划模型。最后通过实例验证了假设的正确性,并获得“动态条件下组合站组合方案的优化效果并不十分明显”的结论；其次通过阐述典型组合站到发线布置形式及组合作业过程,归纳出组合站重车到发线运用特征,定义了基于到发线运用的重载运输组合站组合方案优化问题(SCCTP),并对模型性质进行分析,得出不同组合方案的有利性定理。推论结果显示：以加速单元重载列车出站为目标,去向相同的组合列车、去向不同的组合列车、单元2万吨列车、单元1万吨列车,其优越性依次降低。
(5)在综合前述章节的研究内容的基础上,建立重载运输战略装车域车流组合方案综合优化问题(CCCH)的双层规划模型,提出上下层规划问的调整规则,并根据下层规划模型特征及前述分析的模型性质,提出“表格法”进行编程求解。最后通过实例验证了模型及算法的可行性。
上述研究不仅对于重载运输战略装车域车流组织优化具有实际指导意义,同时对于丰富重载运输理论体系具有积极的作用。
The loading area is often regarded as original cargo source area, its transport organization method is very important for ensuring heavy line to run smoothly. And now, the status quo of heavy haul transporation organization is not accurated enough, which restricted the transport capacity. Therefore, this thesis regards the stragetic loading domain as the research scope, optimizes its transport organization scheme and combination scheme of combination station, in order to acquire reasonable organization methods for Chinese heavy haul lines. The main research contents are as followed:
(1) This paper reviews the development of heavy haul transportation in the world, summarizes the research progress of heavy haul transportation and stratic loading area. Then, dividesthe loading points within the loading domain into three levels, stratic loading points, stratic loading areas and stratic loading domain in accordance with its sources of supply conditions and transport organization methods,at last elaborates the softwares and hardwares of heavy haul transport organization.
(2) This paper analyzes the operating process of heavy haul transportation, proposes the characteristics of the collection and distribution system. Based on above, the overall combination scheme optimization problem of stratic loading domain for heavy haul transportation is proposed under the conditon of single combined station, and a bi-objective linear programming model is established.Heuristic rules based on the actual background of the case are also proposed to simplify the model, and membership function method is adopted to solve the model and acquire multi-objective planning fuzzy optimal solution.The results show that:after the optimization, the time consumption of car flow within the scope of the strategic loading domain decreases while transport capacity enhances at the same time.
(3) The paper elaborates the combination characteristics of combination station and analyzes the main factors affecting the combined operations of the combined station, then defines combination scheme optimization problem of combination station for heavy haul transportation (SCCHP). And based on these, the single objective nonlinear mathematical programming model is establised under the static condition. For the above model, the difficulty of analysis is being carried out at first, random examples are generated to verify the above analysis, then different algorithms like m-GA, p-GA are designed for attempting to slpve the model. Finally, MMAS algorithm is designed to solve the problem successfully.The experiments confirmed that:the MMAS algorithm in solving SCCHP has better performance on time consumption, and the average optimal separation is less than5%.
(4) Firstly, The paper proposes dynamic favorable assumptions for combination station of heavy haul transportation and defines combination scheme optimization for combination station of heavy haul transportation under dynamic condition (DCCHP).A bi-objective nonlinear programming mode is established which takes the time consuming as small as possible within the scope of stratic loading domain and and departure satisfaction degrees maximum as the goal, and finally a case is proposed to verify the correctness of the assumptions. However, the optimization effect is not very obvious under dynamic conditions. Secondly, the paper elaborates the classicalstation styles and working progresses of combinations stations, and based on this utilization characteristics of heavy tracks are acquired and combination scheme optimization problem for combination station of heavy haul transportation based on track utilization(SCCTP) is defined, and the model natures are analyzed, gets some favorable theorems of different combination schemes. The corollary shows that:if taking heavy haul train speeding up to departure as objective, those trains, trains with same directions, trains with different directions, unit trains with the weight of20thousand tons and unit trains with the weight of10thousand tons. Their superiorities are in order of decreasing.
(5) Based on the foregoing research results, a bi-level programming model is established for carflow comprehensive optimization of heavy haul transportation within stratic loading domain, and adjustment rules between the upper and lower are proposed, then, according to the characteristics of lower level programming model and the aforementioned analysis modelnatures, the paper puts forward the form method to solve the problem. Finally, an example is proposed to verfy the feasibility of the model and algorithm.
The research is not only a practical guide for car flow organization optimization of strategy loading domain of heavy haul transportation, but also has a positive effect for rich theoretical system of heavy hual transportation.
引文
[1]钱立新.世界重载铁路运输技术的最新进展[J].机车电传动,2010,(001)：3-7.
[2]李宏.国外重载铁路综述[J].铁道工程学报,2000,(4)：32-34.
[3]安路生.中国铁路运输新实践[M].中国铁道出版社,2009.
[4]杨浩.铁路重载运输[M].北京：北京交通大学出版社,2010.
[5]Richter F,邹士杰.美国铁路重载运输[J].国外铁道车辆,2006,(05)：1-5+26.
[6]白宗孝,傅国民.德国的货运中心[J].综合运输,1998,(11)：34-35.
[7]杨军民.我国铁路重载运输的发展[J].发展,2011,(01)：118-119.
[8]李喜荣.我国铁路发展重载运输的历程及建议[J].铁道运营技术,2011,(02)：46-48.
[9]李杰.我国铁路重载运输发展研究[J].铁道运输与经济,201 1,(01)：42-46.
[10]刘向东.浅析我国铁路的重载运输[J].科技创新导报,2010,(18)：237+239.
[11]刘杰伦.对我国铁路重载运输发展的探讨[J].铁道运输与经济,2006,(12)：23-25.
[12]铁道第三勘察设计院集团有限公司.大秦线4亿吨配套站场扩能改造工程(可行性研究)[R].天津,2006.
[13]牛会想.大秦铁路4亿t运输组织模式研究[J]RAILWAY STANDARD DESIGN,2006.
[14]阚凤瑛,孙洪涛,戴新鎏,等.对我国铁路重载运输发展的建议[J].铁道标准设计,2006,1.
[15]陈宜吉.铁路货运组织[M].中国铁道出版社,2006.
[16]杨浩,夏胜利.大秦线实现年运量4亿吨的运输组织问题研究[J].扩大铁路对外开放,确保重点物资运输——中国科协2005年学术年会铁道分会场暨中国铁道学会学术年会和粤海通道运营管理学术研讨会论文集,2005.
[17]O. H. A two-stage queue model for a marshalling yard[J]. Rail International,1972,3: 249-259.
[18]Kleinrock L. Queueing systems, volume I:theory[J].1975.
[19]Daganzo C F, Dowling R G, Hall R W. Railroad classification yard throughput:The case of multistage triangular sorting[J]. Transportation Research Part A:General,1983, 17(2):95-106.
[20]Dirnberger J R. Development and application of lean railroading to improve classification terminal performance. University of Illinois,2006.
[21]Winter T. Online and real-time dispatching problems[M]. Citeseer,2000.
[22]Liibbecke M E, Zimmermann U T. Shunting minimal rail car allocation[J]. Computational Optimization and Applications,2005,31(3):295-308.
[23]Chou M, Xia X. Optimal cruise control of heavy-haul trains equipped with electronically controlled pneumatic brake systems[J]. Control engineering practice, 2007,15(5):511-519.
[24]Chou M, Xia X, Kayser C. Modelling and model validation of heavy-haul trains equipped with electronically controlled pneumatic brake systems[J]. Control engineering practice,2007,15(4):501-509.
[25]Zhuan X, Xia X. Speed regulation with measured output feedback in the control of heavy haul trains[J]. Automatica,2008,44(1):242-247.
[26]Yue Y, Zhou L, Yue Q, et al. Multi-route railroad blocking problem by improved model and ant colony algorithm in real world[J]. Computers & Industrial Engineering,2011, 60(1):34-42.
[27]Gertsbakh I, Stern H I. Minimal resources for fixed and variable job schedules[J]. Operations Research,1978,26(1):68-85.
[28]Arkin E M, Silverberg E B. Scheduling jobs with fixed start and end times[J]. Discrete Applied Mathematics,1987,18(1):1-8.
[29]Fischetti M, Martello S, Toth P. Approximation algorithms for fixed job schedule problems[J]. Operations Research,1992,40(1-Supplement-1):S96-S108.
[30]Reddy Dondeti V, Emmons H. Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times[J]. European Journal of Operational Research,1993,70(3):316-326.
[31]Kayaligil M S. Unit sized transfer batch scheduling with setup times[J]. Computers & Industrial Engineering,1992,22(2):177-183.
[32]HALIM A H, Ohta H. Batch-scheduling problems through the flowshop with both receiving and delivery just in time[J]. The International Journal Of Production Research,1993,31(8):1943-1955.
[33]Kim J, Kang S H, Lee S M. Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage[J]. Omega,1997,25(5):547-555.
[34]Dobson G, Arai Yano C. Cyclic scheduling to minimize inventory in a batch flow line[J]. European Journal of Operational Research,1994,75(2):441-461.
[35]SUNG C S U P, SANG H U M Y. Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed[J]. Engineering Optimization+A35,1997,28(3):231-243.
[36]Kempf K G, Uzsoy R, Wang C S. Scheduling a single batch processing machine with secondary resource constraints[J]. Journal of Manufacturing Systems,1998,17(1): 37-51.
[37]Raaymakers W, Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing[J]. European Journal of Operational Research,2000,126(1):131-151.
[38]Su L H. A hybrid two-stage flowshop with limited waiting time constraints [J]. Computers & Industrial Engineering,2003,44(3):409-424.
[39]Koh S G, Koo P H, Kim D C, et al. Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families[J]. International Journal of Production Economics,2005,98(1):81-96.
[40]Damodaran P, Kumar Manjeshwar P, Srihari K. Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms[J]. International Journal of Production Economics,2006,103(2):882-891.
[41]Liao C J, Liao L M. Improved MILP models for two-machine flowshop with batch processing machines[J]. Mathematical and Computer Modelling,2008,48(7): 1254-1264.
[42]Kashan A H, Karimi B. An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines[J]. The International Journal of Advanced Manufacturing Technology,2009,40(5): 582-594.
[43][苏]帕里斯特.切列帕申涅茨.超重超长列车运行[M].北京：中国铁道出版社,1985.
[44]张星平,姚养心.货运业务集中化[J].铁道科技动态,1985,(07)：4-6.
[45]郝玉藏.浅谈我国铁路货运集中化问题[J].北方交通大学学报,1995,(S1)：92-97.
[46]刘凯.我国铁路货运集中化有关问题探讨[J].铁道学报,1995,(04)：108-115.
[47]谢海红.铁路货运集中化车站综合评价指标和方法的确定[J].北方交通大学学报,1995,(S1)：98-102.
[48]李松.当前实施货运集中化的难点与对策[J].综合运输,1997,(05)：24-27.
[49]谢海红.铁路货运集中化需要注意的问题和建议[J].综合运输,1997,(12)：12-14.
[50]翟威,刘凯.浅谈货运集中化实施中的若干问题[J].北方交通大学学报,1997,(06)：102-105.
[51]关于全路建设战略装车点的指导性意见[J].铁道货运,2006,(12)：44-46.
[52]郭涛平,张云芳,郭建民.洛阳车务段战略装车点建设规划[J].铁道运输与经济,2007,(01)：21-23.
[53]武常山,韩义峰.关于建立铁路战略装车点的启示[J].铁道货运,2006,(11)：32-34.
[54]李乐明.大石桥站战略装车点货运组织探讨[J].铁道货运,2008,No.181(12)：33-35.
[55]朱文浩,黄由衡,邓煜阳.战略装车点对铁路货运的影响分析[J].铁道运营技术,2008,No.53(01)：19-21.
[56]邓煜阳,雷定猷,黄溢,等.基于战略装车点的铁路货运业务流程再造研究[J].中国铁路,2007,No.542(08)：44-46.
[57]李振家.完善铁路战略装车点运输组织方式的思考[J].铁道运输与经济,2009,v.31；No.349(05)：40-42.
[58]牛好振.战略装车点接轨方案的研究[J].铁道货运,2009,No.193(12)：16-17+20.
[59]江波,谢海红,徐岚,等.铁路战略装车点发展策略[J].综合运输,2010,No.346(06)：36-38.
[60]李维平.培育战略装车点提高铁路运输能力[J].铁道运输与经济,2006,(11)：10-11.
[61]李德军.战略装车点在铁路多经企业可持续发展的途径分析[J].中国铁路,2008,No.553(07)：42-44.
[62]李源.发展战略装车点建立现代煤炭物流体系[J].河北煤炭,2008,(03)：48-49.
[63]武汛.推进战略装车点建设的探索与实践[J].中国铁路,2008,No.554(08)：3-7+2.
[64]张培俊,应四明.挖掘车站货运资源加速战略装车点的建设[J].铁道货运,2008,No.181(12)：29-30.
[65]陈冠儒,马驷,刘界佚.推进战略装车点建设的初步探索与实践[J].中国铁路,2009,No.(08)：38-39+43.
[66]樊亚军.对南太焦线战略装车点建设的思考[J].科学之友(B版),2009,No.420(12)：8-10.
[67]韩旭辉,郭鹏.推进战略装车点建设的实践与思考[J].铁道货运,2009,No.185(04)：23-25.
[68]刘超.关于建设徐州西站粮食战略装车点的探讨[J].上海铁道科技,2009,(04)：35-36.
[69]柴岳,匡敏.浅析铁路多经战略装车点的定位及发展对策[J].综合运输,2010,No.348(08)：50-52.
[70]许培英.加强战略装车点建设与运营管理工作的实践[J].铁道货运,2010,v.28；No.198(05)：13-15.
[71]郭玉华,宗岩,徐利民.实施战略装车点建设及路企直通运输战略的思考[J].铁道运输与经济,2009,v.31；No.v.31(07)：6-8.
[72]纪丽君,林柏梁.战略装车点选址模型研究[J].铁道学报,2008,No.145(05)：8.11.
[73]纪丽君,林柏梁,乔国会,等.战略装车点多点选址模型及算法[J].北京交通大学学报,2009,v.33；No.148(06)：31-35.
[74]毛根旺,马文钰.基于AHP的战略装车点选址群决策分析[J].交通科技与经济,2008,No.50(06)：85-87+90.
[75]周博拓,郑宇.基于模糊机会约束的战略装车点选址模型研究[J].铁道货运,2009,No.183(02)：8-11+14.
[76]白春辉.广深铁路战略装车点规划方案研究[D].北京：北京交通大学,2008.
[77]赵虎.义马煤业集团公司战略装车点规划方案研究[D].北京：北京交通大学,2009.
[78]王宇.铁路货运战略装车点选址优化研究[D].成都：西南交通大学,2010.
[79]帅铁城.基于战略装车点规划的昆明铁路局装卸资源整合[D].长沙：中南大学,2008：3.
[80]靳雄焕.铁路战略装车点布局规划研究[D].北京：北京交通大学,2009.
[81]刘珩.基于战略装车点的东北地区粮食现代物流网络规划研究[D].吉林：吉林大学,2010.
[82]苏勇.探讨重载铁路的运输组织及线路加强模式[J].铁道工程学报,2006,(007)：21-23.
[83]安路生,郭玉华,郭竹学.大秦线运输组织调研报告[J].铁道运输与经济,2007,29(010)：1-3.
[84]范振平,魏玉光,林柏梁.重载运输扩能的效益分析[J].物流技术,2007,26(4)：47-49.
[85]刘瑜.优化运输组织实现神华铁路重载运输[J].中国铁路,2008,(7)：9-12.
[86]颜月霞,张天伟,王俊奇.大秦线开行重载快运列车存在的问题及对策[J].铁道运营技术,2009,15(004)：20-22.
[87]武汛.大秦线运输组织系统研究[J].中国铁路,2009,(006)：11-15.
[88]张国权.大新站开行万吨列车的实践与创新[J].铁道经济研究,2009,(005)：35-38.
[89]肖睿.大秦线集疏运体系优化研究[J].铁道运输与经济,2011,(01)：47-51.
[90]马晓珂.铁路重载运输组织方式及相关问题的研究.西南交通大学,2006.
[91]何冯斌.重载运输装车区车流组织及相关问题的研究.西南交通大学,2007.
[92]张进川.半封闭式重载铁路运输组织关键技术研究[D].北京交通大学,2008.
[93]张进川,杨浩,魏玉光.重载铁路卸车端空车回送模型研究[J].交通运输系统工程与信息,2008,(02)：96-102.
[94]张进川,杨浩,魏玉光.重载铁路装车端空车配送模型[J].中国铁道科学,2009,(04)：113-117.
[95]范振平.重载铁路通道车流吸引区域及始发直达重载化研究.北京交通大学,2008.
[96]王军.大秦线重载列车编组方式的实践与研究[J].科技情报开发与经济,2010,(020)：185-188.
[97]唐保刚.重载运输装车区车流组织的研究与探讨.北京交通大学,2009.
[98]王慈光.目标规划在铁路重载运输组织中的应用[J].西南交通大学学报,2009,44(003)：392-395.
[99]赵鹏,张进川,唐宝刚.基于组合列车的重载铁路装车区车流组织优化模型研究[J].中国铁道科学,2010,31(6)：116-121.
[100]王文宪.重载运输装车地直达车流组织优化研究.2012.
[101]杨宇栋,贾传峻,胡思继.中国重载线路列车牵引质量与速度和密度关系研究[J]. 北京交通大学学报,2006,30(3)：1-4.
[102]郭锴.重载运输的通过能力研究.中南大学,2007.
[103]耿志修,李学峰,张波.大秦线重载列车运行仿真计算研究[J].中国铁道科学,2008,29(2)：88-93.
[104]何润珠.大秦线重载运输组织及相关问题研究.北京交通大学,2009.
[105]冯芬玲,陈治亚,雷志鹏.铁路重载运输集疏运一体化的协同学动因及实践[J].铁道运输与经济,2010,32(008)：25-29.
[106]蓝丹.基于协同论的铁路重载运输集疏运一体化研究.中南大学,2012.
[107]刘文丰.重载运输条件下既有线路运力资源优化配置及评价研究.2012.
[108]柯为.我国铁路重载运输的发展[J].铁道工程学报,1994,(04)：49.
[109]杜寅堂.铁路等级的重新划分[J].铁道标准设计,2005,12.
[110]李仲才.对铁路重载轨道类型划分原则及标准的建议[J].铁道科技动态,1984,(11)：12-18.
[111]姚虎.基于供应链的铁路货运业务流程再造研究[硕士].中南大学,2010.
[112]邓煜阳,雷定猷,黄溢,等.基于战略装车点的铁路货运业务流程再造研究[J].中国铁路,2007,(08)：44-46.
[113]铁道部第四勘察设计院.铁路工程设计技术手册：站场及枢纽[M].武汉：北京中国铁道出版社,2004.
[114]中华人民共和国建设部及中华人民共和国国家质量监督检验检疫总局.铁路车站及枢纽设计规范GB50091-2006[S]：工程建设标准全文信息系统.
[115]中华人民共和国建设部国.铁路线路设计规范GB 50090-99[S]：工程建设标准全文信息系统.
[116]王顺利,王淑伟,孙景冬.铁路站场及枢纽[J].中国校外教育,2008,(011).
[117]王建立.重载铁路到发线有效长的确定[J].山西建筑,2003,29(011)：122-123.
[118]岳建国.到发线有效长与货物列车编组合理匹配问题的探讨[J].铁道运输与经济,2008,30(012)：28-29.
[119]黄成铭.货车发展与货车每延米重量[J].中国铁道科学,1991,12(001)：1-11.
[120]铁道部.铁路技术管理规程[J].[S]北京：中国铁道出版社,2006,10.
[121]彭其渊,王慈光.铁路行车组织[M].成都：中国铁道出版社,2007.
[122]谢季坚,刘承平.模糊数学方法及其应用[M].华中科技大学出版社,2000.
[123]顾基发,魏权龄.多目标决策问题[J].应用数学与计算数学,1980,1.
[124]Salman A, Ahmad I, Al-Madani S. Particle swarm optimization for task assignment problem[J]. Microprocessors and Microsystems,2002,26(8):363-371.
[125]Shmoys D B, Tardos E. An approximation algorithm for the generalized assignment problem[J]. Mathematical Programming,1993,62(1):461-474.
[126]Ronn E. NP-complete stable matching problems[J]. Journal of Algorithms,1990, 11(2):285-304.
[127]Cormen T H. Introduction to algorithms[M]. The MIT press,2001.
[128]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.
[129]Altiparmak F, Gen M, Lin L, et al. A steady-state genetic algorithm for multi-product supply chain network design[J]. Computers & Industrial Engineering,2009,56(2): 521-537.
[130]Kuan S, Ong H, Ng K. Solving the feeder bus network design problem by genetic algorithms and ant colony optimization[J]. Advances in Engineering Software,2006, 37(6):351-359.
[131]Gen M, Altiparmak F, Lin L. A genetic algorithm for two-stage transportation problem using priority-based encoding[J]. OR Spectrum,2006,28(3):337-354.
[132]Gen M, Cheng R. Genetic algorithms and engineering optimization[M]. Wiley-interscience,2000.
[133]Zecchin A C, Maier H R, Simpson A R, et al. Max-min ant system applied to water distribution system optimization[J]. Proc Int Congr Modeling Simulation (MODSIM, 2003,2:795-800.
[134]Stutzlea T, Hoosb H H. MAX-MIN ant system[J]. Future Generation Computer Systems,2000,16:889-914.
[135]Stutzle T, Hoos H. Improving the Ant System:A detailed report on the MAX-MIN Ant System[J].1996.
[136]侯文静.混合蚁群算法及其应用研究.西北师范大学,2011.
[137]多里戈,施蒂茨勒,张军.蚁群优化[M].清华大学出版社,2007.
[138]张建勇,郭耀煌,李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报,2003,25(2)：15-17.
[139]谢金星,薛毅.优化建模与LINDO/LINGO软件[M].清华大学出版社,2005.
[140]青学江.遗传算法在区段站到发线的应用研究[J].西南交通大学学报,1998,33(004)：387-393.
[141]吕红霞,纪洪业.技术站调度决策支持系统的研究——到发线的合理使用[J].西南交通大学学报,2000,35(3)：255-258.
[142]李文权,王炜,程世辉.铁路编组站到发线运用的排序模型和算法[J].系统工程理论与实践,2000,20(6)：75-78.
[143]徐杰,杜文,常军乾,等.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学,2003,24(002)：109-114.
[144]雷定傲,王栋,刘明翔.客运站股道运用优化模型及算法[J].交通运输工程学报,2007,7(5).
[145]吕红霞,何大可,陈韬.基于蚁群算法的客运站到发线运用计划编制方法[J].西南交通大学学报,2008,43(002)：153-158.
[146]贾文峥,毛保华,何天键,等.基于Petri网的车站股道分配方案瓶颈识别[J].交通运输系统工程与信息,2009,9(6).
[147]史峰,陈彦,秦进,等.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学,2009,30(006)：108-113.
[148]Caprara A, Galli L, Toth P. Solution of the train platforming problem[J]. Transportation Science,2011,45(2):246.
[149]Brewer P J, Plott C R. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks[J]. International Journal of Industrial Organization,1996,14(6):857-886.
[150]Zwaneveld P J, Kroon L G, Romeijn H E, et al. Routing trains through railway stations:Model formulation and algorithms [J]. Transportation Science,1996,30(3): 181-194.
[151]Kroon L G, Edwin Romeijn H, Zwaneveld P J. Routing trains through railway stations:complexity issues[J]. European Journal of Operational Research,1997, 98(3):485-498.
[152]Zwaneveld P J, Kroon L G, Van Hoesel S P M. Routing trains through a railway station based on a node packing model[J]. European Journal of Operational Research, 2001,128(1):14-33.
[153]BORND R, SCHLECHTE T. Models for Railway Track Allocation[J].2007.
[154]Bohlin M, Flier H, Maue J, et al. Track allocation in freight-train classification with mixed tracks[J].2011.
[155]Borndorfer R, Schlechte T, Weider S. Railway track allocation by rapid branching[J]. 2012.
[156]Wardono B, Fathi Y. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities[J]. European Journal of Operational Research, 2004,155(2):380-401.
[157]Lin B M T, Cheng T. Batch scheduling in the no-wait two-machine flowshop to minimize the makespan[J]. Computers & Operations Research,2001,28(7):613-624.
[158]Moursli O, Pochet Y. A branch-and-bound algorithm for the hybrid flowshop[J]. International Journal of Production Economics,2000,64(1-3):113-125.
[159]周韬,邵敏华.与轨道线平行的常规公交线路优化方法研究[J].公路工程,2011,36(5)：122-124.
[160]张苗.基于双层规划的多目标校车路径优化研究.I～tJ'1:西南交通大学,2008.
[161]滕春贤,系统工程,李智慧,等.二层规划的理论与应用[M].科学出版社,2002.
[162]任华玲,高自友.动态公交网络设计的双层规划模型及算法研究[J].系统工程理论与实践,2007,27(5)：82-89.
[163]叶建枝王.湖东站开行2万吨组合列车的实践与发展[J].中国铁路,2009,(6)：3.
[164]郭林泉.大秦重载铁路集中修进度图编制的探讨[J].铁道建筑,2009,(11)：92-95.
[2]李宏.国外重载铁路综述[J].铁道工程学报,2000,(4)：32-34.
[3]安路生.中国铁路运输新实践[M].中国铁道出版社,2009.
[4]杨浩.铁路重载运输[M].北京：北京交通大学出版社,2010.
[5]Richter F,邹士杰.美国铁路重载运输[J].国外铁道车辆,2006,(05)：1-5+26.
[6]白宗孝,傅国民.德国的货运中心[J].综合运输,1998,(11)：34-35.
[7]杨军民.我国铁路重载运输的发展[J].发展,2011,(01)：118-119.
[8]李喜荣.我国铁路发展重载运输的历程及建议[J].铁道运营技术,2011,(02)：46-48.
[9]李杰.我国铁路重载运输发展研究[J].铁道运输与经济,201 1,(01)：42-46.
[10]刘向东.浅析我国铁路的重载运输[J].科技创新导报,2010,(18)：237+239.
[11]刘杰伦.对我国铁路重载运输发展的探讨[J].铁道运输与经济,2006,(12)：23-25.
[12]铁道第三勘察设计院集团有限公司.大秦线4亿吨配套站场扩能改造工程(可行性研究)[R].天津,2006.
[13]牛会想.大秦铁路4亿t运输组织模式研究[J]RAILWAY STANDARD DESIGN,2006.
[14]阚凤瑛,孙洪涛,戴新鎏,等.对我国铁路重载运输发展的建议[J].铁道标准设计,2006,1.
[15]陈宜吉.铁路货运组织[M].中国铁道出版社,2006.
[16]杨浩,夏胜利.大秦线实现年运量4亿吨的运输组织问题研究[J].扩大铁路对外开放,确保重点物资运输——中国科协2005年学术年会铁道分会场暨中国铁道学会学术年会和粤海通道运营管理学术研讨会论文集,2005.
[17]O. H. A two-stage queue model for a marshalling yard[J]. Rail International,1972,3: 249-259.
[18]Kleinrock L. Queueing systems, volume I:theory[J].1975.
[19]Daganzo C F, Dowling R G, Hall R W. Railroad classification yard throughput:The case of multistage triangular sorting[J]. Transportation Research Part A:General,1983, 17(2):95-106.
[20]Dirnberger J R. Development and application of lean railroading to improve classification terminal performance. University of Illinois,2006.
[21]Winter T. Online and real-time dispatching problems[M]. Citeseer,2000.
[22]Liibbecke M E, Zimmermann U T. Shunting minimal rail car allocation[J]. Computational Optimization and Applications,2005,31(3):295-308.
[23]Chou M, Xia X. Optimal cruise control of heavy-haul trains equipped with electronically controlled pneumatic brake systems[J]. Control engineering practice, 2007,15(5):511-519.
[24]Chou M, Xia X, Kayser C. Modelling and model validation of heavy-haul trains equipped with electronically controlled pneumatic brake systems[J]. Control engineering practice,2007,15(4):501-509.
[25]Zhuan X, Xia X. Speed regulation with measured output feedback in the control of heavy haul trains[J]. Automatica,2008,44(1):242-247.
[26]Yue Y, Zhou L, Yue Q, et al. Multi-route railroad blocking problem by improved model and ant colony algorithm in real world[J]. Computers & Industrial Engineering,2011, 60(1):34-42.
[27]Gertsbakh I, Stern H I. Minimal resources for fixed and variable job schedules[J]. Operations Research,1978,26(1):68-85.
[28]Arkin E M, Silverberg E B. Scheduling jobs with fixed start and end times[J]. Discrete Applied Mathematics,1987,18(1):1-8.
[29]Fischetti M, Martello S, Toth P. Approximation algorithms for fixed job schedule problems[J]. Operations Research,1992,40(1-Supplement-1):S96-S108.
[30]Reddy Dondeti V, Emmons H. Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times[J]. European Journal of Operational Research,1993,70(3):316-326.
[31]Kayaligil M S. Unit sized transfer batch scheduling with setup times[J]. Computers & Industrial Engineering,1992,22(2):177-183.
[32]HALIM A H, Ohta H. Batch-scheduling problems through the flowshop with both receiving and delivery just in time[J]. The International Journal Of Production Research,1993,31(8):1943-1955.
[33]Kim J, Kang S H, Lee S M. Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage[J]. Omega,1997,25(5):547-555.
[34]Dobson G, Arai Yano C. Cyclic scheduling to minimize inventory in a batch flow line[J]. European Journal of Operational Research,1994,75(2):441-461.
[35]SUNG C S U P, SANG H U M Y. Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed[J]. Engineering Optimization+A35,1997,28(3):231-243.
[36]Kempf K G, Uzsoy R, Wang C S. Scheduling a single batch processing machine with secondary resource constraints[J]. Journal of Manufacturing Systems,1998,17(1): 37-51.
[37]Raaymakers W, Hoogeveen J. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing[J]. European Journal of Operational Research,2000,126(1):131-151.
[38]Su L H. A hybrid two-stage flowshop with limited waiting time constraints [J]. Computers & Industrial Engineering,2003,44(3):409-424.
[39]Koh S G, Koo P H, Kim D C, et al. Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families[J]. International Journal of Production Economics,2005,98(1):81-96.
[40]Damodaran P, Kumar Manjeshwar P, Srihari K. Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms[J]. International Journal of Production Economics,2006,103(2):882-891.
[41]Liao C J, Liao L M. Improved MILP models for two-machine flowshop with batch processing machines[J]. Mathematical and Computer Modelling,2008,48(7): 1254-1264.
[42]Kashan A H, Karimi B. An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines[J]. The International Journal of Advanced Manufacturing Technology,2009,40(5): 582-594.
[43][苏]帕里斯特.切列帕申涅茨.超重超长列车运行[M].北京：中国铁道出版社,1985.
[44]张星平,姚养心.货运业务集中化[J].铁道科技动态,1985,(07)：4-6.
[45]郝玉藏.浅谈我国铁路货运集中化问题[J].北方交通大学学报,1995,(S1)：92-97.
[46]刘凯.我国铁路货运集中化有关问题探讨[J].铁道学报,1995,(04)：108-115.
[47]谢海红.铁路货运集中化车站综合评价指标和方法的确定[J].北方交通大学学报,1995,(S1)：98-102.
[48]李松.当前实施货运集中化的难点与对策[J].综合运输,1997,(05)：24-27.
[49]谢海红.铁路货运集中化需要注意的问题和建议[J].综合运输,1997,(12)：12-14.
[50]翟威,刘凯.浅谈货运集中化实施中的若干问题[J].北方交通大学学报,1997,(06)：102-105.
[51]关于全路建设战略装车点的指导性意见[J].铁道货运,2006,(12)：44-46.
[52]郭涛平,张云芳,郭建民.洛阳车务段战略装车点建设规划[J].铁道运输与经济,2007,(01)：21-23.
[53]武常山,韩义峰.关于建立铁路战略装车点的启示[J].铁道货运,2006,(11)：32-34.
[54]李乐明.大石桥站战略装车点货运组织探讨[J].铁道货运,2008,No.181(12)：33-35.
[55]朱文浩,黄由衡,邓煜阳.战略装车点对铁路货运的影响分析[J].铁道运营技术,2008,No.53(01)：19-21.
[56]邓煜阳,雷定猷,黄溢,等.基于战略装车点的铁路货运业务流程再造研究[J].中国铁路,2007,No.542(08)：44-46.
[57]李振家.完善铁路战略装车点运输组织方式的思考[J].铁道运输与经济,2009,v.31；No.349(05)：40-42.
[58]牛好振.战略装车点接轨方案的研究[J].铁道货运,2009,No.193(12)：16-17+20.
[59]江波,谢海红,徐岚,等.铁路战略装车点发展策略[J].综合运输,2010,No.346(06)：36-38.
[60]李维平.培育战略装车点提高铁路运输能力[J].铁道运输与经济,2006,(11)：10-11.
[61]李德军.战略装车点在铁路多经企业可持续发展的途径分析[J].中国铁路,2008,No.553(07)：42-44.
[62]李源.发展战略装车点建立现代煤炭物流体系[J].河北煤炭,2008,(03)：48-49.
[63]武汛.推进战略装车点建设的探索与实践[J].中国铁路,2008,No.554(08)：3-7+2.
[64]张培俊,应四明.挖掘车站货运资源加速战略装车点的建设[J].铁道货运,2008,No.181(12)：29-30.
[65]陈冠儒,马驷,刘界佚.推进战略装车点建设的初步探索与实践[J].中国铁路,2009,No.(08)：38-39+43.
[66]樊亚军.对南太焦线战略装车点建设的思考[J].科学之友(B版),2009,No.420(12)：8-10.
[67]韩旭辉,郭鹏.推进战略装车点建设的实践与思考[J].铁道货运,2009,No.185(04)：23-25.
[68]刘超.关于建设徐州西站粮食战略装车点的探讨[J].上海铁道科技,2009,(04)：35-36.
[69]柴岳,匡敏.浅析铁路多经战略装车点的定位及发展对策[J].综合运输,2010,No.348(08)：50-52.
[70]许培英.加强战略装车点建设与运营管理工作的实践[J].铁道货运,2010,v.28；No.198(05)：13-15.
[71]郭玉华,宗岩,徐利民.实施战略装车点建设及路企直通运输战略的思考[J].铁道运输与经济,2009,v.31；No.v.31(07)：6-8.
[72]纪丽君,林柏梁.战略装车点选址模型研究[J].铁道学报,2008,No.145(05)：8.11.
[73]纪丽君,林柏梁,乔国会,等.战略装车点多点选址模型及算法[J].北京交通大学学报,2009,v.33；No.148(06)：31-35.
[74]毛根旺,马文钰.基于AHP的战略装车点选址群决策分析[J].交通科技与经济,2008,No.50(06)：85-87+90.
[75]周博拓,郑宇.基于模糊机会约束的战略装车点选址模型研究[J].铁道货运,2009,No.183(02)：8-11+14.
[76]白春辉.广深铁路战略装车点规划方案研究[D].北京：北京交通大学,2008.
[77]赵虎.义马煤业集团公司战略装车点规划方案研究[D].北京：北京交通大学,2009.
[78]王宇.铁路货运战略装车点选址优化研究[D].成都：西南交通大学,2010.
[79]帅铁城.基于战略装车点规划的昆明铁路局装卸资源整合[D].长沙：中南大学,2008：3.
[80]靳雄焕.铁路战略装车点布局规划研究[D].北京：北京交通大学,2009.
[81]刘珩.基于战略装车点的东北地区粮食现代物流网络规划研究[D].吉林：吉林大学,2010.
[82]苏勇.探讨重载铁路的运输组织及线路加强模式[J].铁道工程学报,2006,(007)：21-23.
[83]安路生,郭玉华,郭竹学.大秦线运输组织调研报告[J].铁道运输与经济,2007,29(010)：1-3.
[84]范振平,魏玉光,林柏梁.重载运输扩能的效益分析[J].物流技术,2007,26(4)：47-49.
[85]刘瑜.优化运输组织实现神华铁路重载运输[J].中国铁路,2008,(7)：9-12.
[86]颜月霞,张天伟,王俊奇.大秦线开行重载快运列车存在的问题及对策[J].铁道运营技术,2009,15(004)：20-22.
[87]武汛.大秦线运输组织系统研究[J].中国铁路,2009,(006)：11-15.
[88]张国权.大新站开行万吨列车的实践与创新[J].铁道经济研究,2009,(005)：35-38.
[89]肖睿.大秦线集疏运体系优化研究[J].铁道运输与经济,2011,(01)：47-51.
[90]马晓珂.铁路重载运输组织方式及相关问题的研究.西南交通大学,2006.
[91]何冯斌.重载运输装车区车流组织及相关问题的研究.西南交通大学,2007.
[92]张进川.半封闭式重载铁路运输组织关键技术研究[D].北京交通大学,2008.
[93]张进川,杨浩,魏玉光.重载铁路卸车端空车回送模型研究[J].交通运输系统工程与信息,2008,(02)：96-102.
[94]张进川,杨浩,魏玉光.重载铁路装车端空车配送模型[J].中国铁道科学,2009,(04)：113-117.
[95]范振平.重载铁路通道车流吸引区域及始发直达重载化研究.北京交通大学,2008.
[96]王军.大秦线重载列车编组方式的实践与研究[J].科技情报开发与经济,2010,(020)：185-188.
[97]唐保刚.重载运输装车区车流组织的研究与探讨.北京交通大学,2009.
[98]王慈光.目标规划在铁路重载运输组织中的应用[J].西南交通大学学报,2009,44(003)：392-395.
[99]赵鹏,张进川,唐宝刚.基于组合列车的重载铁路装车区车流组织优化模型研究[J].中国铁道科学,2010,31(6)：116-121.
[100]王文宪.重载运输装车地直达车流组织优化研究.2012.
[101]杨宇栋,贾传峻,胡思继.中国重载线路列车牵引质量与速度和密度关系研究[J]. 北京交通大学学报,2006,30(3)：1-4.
[102]郭锴.重载运输的通过能力研究.中南大学,2007.
[103]耿志修,李学峰,张波.大秦线重载列车运行仿真计算研究[J].中国铁道科学,2008,29(2)：88-93.
[104]何润珠.大秦线重载运输组织及相关问题研究.北京交通大学,2009.
[105]冯芬玲,陈治亚,雷志鹏.铁路重载运输集疏运一体化的协同学动因及实践[J].铁道运输与经济,2010,32(008)：25-29.
[106]蓝丹.基于协同论的铁路重载运输集疏运一体化研究.中南大学,2012.
[107]刘文丰.重载运输条件下既有线路运力资源优化配置及评价研究.2012.
[108]柯为.我国铁路重载运输的发展[J].铁道工程学报,1994,(04)：49.
[109]杜寅堂.铁路等级的重新划分[J].铁道标准设计,2005,12.
[110]李仲才.对铁路重载轨道类型划分原则及标准的建议[J].铁道科技动态,1984,(11)：12-18.
[111]姚虎.基于供应链的铁路货运业务流程再造研究[硕士].中南大学,2010.
[112]邓煜阳,雷定猷,黄溢,等.基于战略装车点的铁路货运业务流程再造研究[J].中国铁路,2007,(08)：44-46.
[113]铁道部第四勘察设计院.铁路工程设计技术手册：站场及枢纽[M].武汉：北京中国铁道出版社,2004.
[114]中华人民共和国建设部及中华人民共和国国家质量监督检验检疫总局.铁路车站及枢纽设计规范GB50091-2006[S]：工程建设标准全文信息系统.
[115]中华人民共和国建设部国.铁路线路设计规范GB 50090-99[S]：工程建设标准全文信息系统.
[116]王顺利,王淑伟,孙景冬.铁路站场及枢纽[J].中国校外教育,2008,(011).
[117]王建立.重载铁路到发线有效长的确定[J].山西建筑,2003,29(011)：122-123.
[118]岳建国.到发线有效长与货物列车编组合理匹配问题的探讨[J].铁道运输与经济,2008,30(012)：28-29.
[119]黄成铭.货车发展与货车每延米重量[J].中国铁道科学,1991,12(001)：1-11.
[120]铁道部.铁路技术管理规程[J].[S]北京：中国铁道出版社,2006,10.
[121]彭其渊,王慈光.铁路行车组织[M].成都：中国铁道出版社,2007.
[122]谢季坚,刘承平.模糊数学方法及其应用[M].华中科技大学出版社,2000.
[123]顾基发,魏权龄.多目标决策问题[J].应用数学与计算数学,1980,1.
[124]Salman A, Ahmad I, Al-Madani S. Particle swarm optimization for task assignment problem[J]. Microprocessors and Microsystems,2002,26(8):363-371.
[125]Shmoys D B, Tardos E. An approximation algorithm for the generalized assignment problem[J]. Mathematical Programming,1993,62(1):461-474.
[126]Ronn E. NP-complete stable matching problems[J]. Journal of Algorithms,1990, 11(2):285-304.
[127]Cormen T H. Introduction to algorithms[M]. The MIT press,2001.
[128]段海滨.蚁群算法原理及其应用[M].科学出版社,2005.
[129]Altiparmak F, Gen M, Lin L, et al. A steady-state genetic algorithm for multi-product supply chain network design[J]. Computers & Industrial Engineering,2009,56(2): 521-537.
[130]Kuan S, Ong H, Ng K. Solving the feeder bus network design problem by genetic algorithms and ant colony optimization[J]. Advances in Engineering Software,2006, 37(6):351-359.
[131]Gen M, Altiparmak F, Lin L. A genetic algorithm for two-stage transportation problem using priority-based encoding[J]. OR Spectrum,2006,28(3):337-354.
[132]Gen M, Cheng R. Genetic algorithms and engineering optimization[M]. Wiley-interscience,2000.
[133]Zecchin A C, Maier H R, Simpson A R, et al. Max-min ant system applied to water distribution system optimization[J]. Proc Int Congr Modeling Simulation (MODSIM, 2003,2:795-800.
[134]Stutzlea T, Hoosb H H. MAX-MIN ant system[J]. Future Generation Computer Systems,2000,16:889-914.
[135]Stutzle T, Hoos H. Improving the Ant System:A detailed report on the MAX-MIN Ant System[J].1996.
[136]侯文静.混合蚁群算法及其应用研究.西北师范大学,2011.
[137]多里戈,施蒂茨勒,张军.蚁群优化[M].清华大学出版社,2007.
[138]张建勇,郭耀煌,李军.基于顾客满意度的多目标模糊车辆优化调度问题研究[J].铁道学报,2003,25(2)：15-17.
[139]谢金星,薛毅.优化建模与LINDO/LINGO软件[M].清华大学出版社,2005.
[140]青学江.遗传算法在区段站到发线的应用研究[J].西南交通大学学报,1998,33(004)：387-393.
[141]吕红霞,纪洪业.技术站调度决策支持系统的研究——到发线的合理使用[J].西南交通大学学报,2000,35(3)：255-258.
[142]李文权,王炜,程世辉.铁路编组站到发线运用的排序模型和算法[J].系统工程理论与实践,2000,20(6)：75-78.
[143]徐杰,杜文,常军乾,等.基于遗传算法的区段站到发线运用优化安排[J].中国铁道科学,2003,24(002)：109-114.
[144]雷定傲,王栋,刘明翔.客运站股道运用优化模型及算法[J].交通运输工程学报,2007,7(5).
[145]吕红霞,何大可,陈韬.基于蚁群算法的客运站到发线运用计划编制方法[J].西南交通大学学报,2008,43(002)：153-158.
[146]贾文峥,毛保华,何天键,等.基于Petri网的车站股道分配方案瓶颈识别[J].交通运输系统工程与信息,2009,9(6).
[147]史峰,陈彦,秦进,等.铁路客运站到发线运用和接发车进路排列方案综合优化[J].中国铁道科学,2009,30(006)：108-113.
[148]Caprara A, Galli L, Toth P. Solution of the train platforming problem[J]. Transportation Science,2011,45(2):246.
[149]Brewer P J, Plott C R. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks[J]. International Journal of Industrial Organization,1996,14(6):857-886.
[150]Zwaneveld P J, Kroon L G, Romeijn H E, et al. Routing trains through railway stations:Model formulation and algorithms [J]. Transportation Science,1996,30(3): 181-194.
[151]Kroon L G, Edwin Romeijn H, Zwaneveld P J. Routing trains through railway stations:complexity issues[J]. European Journal of Operational Research,1997, 98(3):485-498.
[152]Zwaneveld P J, Kroon L G, Van Hoesel S P M. Routing trains through a railway station based on a node packing model[J]. European Journal of Operational Research, 2001,128(1):14-33.
[153]BORND R, SCHLECHTE T. Models for Railway Track Allocation[J].2007.
[154]Bohlin M, Flier H, Maue J, et al. Track allocation in freight-train classification with mixed tracks[J].2011.
[155]Borndorfer R, Schlechte T, Weider S. Railway track allocation by rapid branching[J]. 2012.
[156]Wardono B, Fathi Y. A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities[J]. European Journal of Operational Research, 2004,155(2):380-401.
[157]Lin B M T, Cheng T. Batch scheduling in the no-wait two-machine flowshop to minimize the makespan[J]. Computers & Operations Research,2001,28(7):613-624.
[158]Moursli O, Pochet Y. A branch-and-bound algorithm for the hybrid flowshop[J]. International Journal of Production Economics,2000,64(1-3):113-125.
[159]周韬,邵敏华.与轨道线平行的常规公交线路优化方法研究[J].公路工程,2011,36(5)：122-124.
[160]张苗.基于双层规划的多目标校车路径优化研究.I～tJ'1:西南交通大学,2008.
[161]滕春贤,系统工程,李智慧,等.二层规划的理论与应用[M].科学出版社,2002.
[162]任华玲,高自友.动态公交网络设计的双层规划模型及算法研究[J].系统工程理论与实践,2007,27(5)：82-89.
[163]叶建枝王.湖东站开行2万吨组合列车的实践与发展[J].中国铁路,2009,(6)：3.
[164]郭林泉.大秦重载铁路集中修进度图编制的探讨[J].铁道建筑,2009,(11)：92-95.