动车组运用计划和乘务计划的优化方法研究
|
摘要
由于供需关系和资源配置结构的不断变化,我国客运专线动车组运用计划和乘务计划问题呈现出与既有研究不同的特点且问题特征动态变化,对优化方法的灵活性和适用性提出了较高的要求,既有研究难以适用。考虑到两个问题在本质上的相似性,将其与交通各领域的运载工具运用问题和乘务计划问题归结为一类活动资源优化问题。通过对活动资源优化问题共性特征的分析和抽象,研究其一般优化方法。在此基础上,结合我国客运专线运营背景下问题的具体特点,对动车组运用计划和乘务计划问题的优化方法进行研究。论文的主要研究工作包括:
1.对各领域活动资源优化问题的特点和内在联系进行了分析,总结出该类问题的共性特征是建立活动资源与运输任务在时间和空间上的映射关系,建立了刻画这类问题共性特征的关系函数,分析了问题的时空复杂性,并从时空关系的角度探讨了问题的分解现象。
2.针对问题的共性特征和区别,提出了一种利用时空统一网络描述活动资源优化问题时空关联关系的方法,给出了该问题从时间和空间角度降维求解的方法。在此基础上,基于可行运用方案建立了活动资源优化问题的一般模型,设计了基于列生成算法的基本算法,改进了求解价格问题的广义标号方法,并给出了使用一般优化方法的五项参数。
3.在对我国客运专线动车组运用计划问题的相关参数进行分析探讨、对问题的动态变化特征进行分析的基础上,界定了问题的边界。在一般优化方法的基础上,针对问题的具体特点,分别对“以车定线”阶段、“以车调线”阶段动车组交路计划和动车组检修计划问题的优化方法进行了研究,并经实例验证。
4.针对“以车调线”阶段动车组交路计划问题的时间窗特性,提出了利用接续网络描述时间窗对列车接续关系的影响、利用互斥弧的概念描述关联列车的时间窗关系、通过判断可行交路的时间窗有效性描述多列车时间窗关系的建模方法,设计了基于人工变量的求解算法,并经实例验证。
5.针对我国客运专线乘务计划问题乘务规则复杂多样、计划间耦合性强的特点,通过建立不含圈的接续网络,将问题转化为时空统一网络的时间维优化问题,基于联合优化建立了乘务交路计划的优化模型,设计了基于改进广义标号法的求解算法,并经实例验证。根据乘务值乘计划问题的特性,提出等价交路组合的概念,并基于等价交路组合设计了启发式求解方法。
Because of the relation between demand and supplyment and the structure of resource are changing continueously, the rolling stock planning problem and crew planning problem of passenger dedicated lines(PDLs) in our country display different characteristices from existed research and the characteristices change dynamically, which request the methodes to be more flexible and adaptable. Considering the similarity of these two problems, this paper classifies these problems with optimization problems of conveyance and crew planning problems in public transport as one type problem named optimization problem of movable transportation resource. By analysing and describing the commonness of this type problem, this paper proposes a general optimization method of this type problem. On the basis, this paper study on the optimization method of rolling stock planning problem and crew planning problem according to the operation characteristics of PDLs in our country,. The main work of this paper can be concluded as follows:
1. By analysing the characteristics and inherent relations of optimization problem of movable resource in each field, this paper concluds the commom characteristics of these problems are building mapping relation between movable resource and transportation task and builds a relation function to describe these common characteristics. From the aspect of relation of time and space of problems, this paper also discusses the descomposition of problem.
2. Aiming at the common characteristics and difference of this type problem, this paper builds time and space unifying network to describe the complex relation between time and space of problems, and hides different relation between time and space of concrete problem into specifical network structure. Using the time and space unifying network, this paper transforms the problems into time or space problems to decrease the dimension of problems. On this basis, this paper builds optimization model based feasible solution, designs algorithms framework based column generation, improves the generalized lable algorithm which is used to solve pricing problem, and concludes the using of the general oprtimization method as determination of five parameters.
3. Based on the analysis and discussion of related parameters of rolling stock planning problem in the background of PDLs in our country, this paper bounds this problem. On the basis of general optimization method, aiming at concrete feature of problems, this paper studies the optimization method of rolling stock circulation and maintenance routing of train units in the "line planned by rolling stock" stage and in the "line adjusted by rolling stock" stage, respectively.
4. Aiming at the characteristic of rolling stock circulation in "line adjusted by rolling stock" stage that its relation of time and space is complex, according to the speciality of time window of timetable, this paper describes the influence of time window to neighor trains by building connection network, describes the relation of time window among related trains by proposing the concept of mutually exclusive arc and proposes the method of judging feasible routing considering the relation of time window among trains in a routing of rolling stock. On this basis, this paper builds optimization model of problem and designs algorithm based artifitial variables.
5. Aiming at the characteristic of crew planning problem of PDLs in our country, which has comlex and various crew rules and strong coupling of plans, this paper projects crew scheduling problem on time dimension using the abstract of connection network. Using the improved generalized labeling algorithm's advantage in deal with complex constraints, considering the relation of crew scheduling and crew rostering, this paper builds optimization model and designs algorithm considering the characteristic of problem. According to the speciality of crew rostering problem, this paper proposed the concept of equal combination of crew pairing and based this concept proposes heuristic algorithm.
1.对各领域活动资源优化问题的特点和内在联系进行了分析,总结出该类问题的共性特征是建立活动资源与运输任务在时间和空间上的映射关系,建立了刻画这类问题共性特征的关系函数,分析了问题的时空复杂性,并从时空关系的角度探讨了问题的分解现象。
2.针对问题的共性特征和区别,提出了一种利用时空统一网络描述活动资源优化问题时空关联关系的方法,给出了该问题从时间和空间角度降维求解的方法。在此基础上,基于可行运用方案建立了活动资源优化问题的一般模型,设计了基于列生成算法的基本算法,改进了求解价格问题的广义标号方法,并给出了使用一般优化方法的五项参数。
3.在对我国客运专线动车组运用计划问题的相关参数进行分析探讨、对问题的动态变化特征进行分析的基础上,界定了问题的边界。在一般优化方法的基础上,针对问题的具体特点,分别对“以车定线”阶段、“以车调线”阶段动车组交路计划和动车组检修计划问题的优化方法进行了研究,并经实例验证。
4.针对“以车调线”阶段动车组交路计划问题的时间窗特性,提出了利用接续网络描述时间窗对列车接续关系的影响、利用互斥弧的概念描述关联列车的时间窗关系、通过判断可行交路的时间窗有效性描述多列车时间窗关系的建模方法,设计了基于人工变量的求解算法,并经实例验证。
5.针对我国客运专线乘务计划问题乘务规则复杂多样、计划间耦合性强的特点,通过建立不含圈的接续网络,将问题转化为时空统一网络的时间维优化问题,基于联合优化建立了乘务交路计划的优化模型,设计了基于改进广义标号法的求解算法,并经实例验证。根据乘务值乘计划问题的特性,提出等价交路组合的概念,并基于等价交路组合设计了启发式求解方法。
Because of the relation between demand and supplyment and the structure of resource are changing continueously, the rolling stock planning problem and crew planning problem of passenger dedicated lines(PDLs) in our country display different characteristices from existed research and the characteristices change dynamically, which request the methodes to be more flexible and adaptable. Considering the similarity of these two problems, this paper classifies these problems with optimization problems of conveyance and crew planning problems in public transport as one type problem named optimization problem of movable transportation resource. By analysing and describing the commonness of this type problem, this paper proposes a general optimization method of this type problem. On the basis, this paper study on the optimization method of rolling stock planning problem and crew planning problem according to the operation characteristics of PDLs in our country,. The main work of this paper can be concluded as follows:
1. By analysing the characteristics and inherent relations of optimization problem of movable resource in each field, this paper concluds the commom characteristics of these problems are building mapping relation between movable resource and transportation task and builds a relation function to describe these common characteristics. From the aspect of relation of time and space of problems, this paper also discusses the descomposition of problem.
2. Aiming at the common characteristics and difference of this type problem, this paper builds time and space unifying network to describe the complex relation between time and space of problems, and hides different relation between time and space of concrete problem into specifical network structure. Using the time and space unifying network, this paper transforms the problems into time or space problems to decrease the dimension of problems. On this basis, this paper builds optimization model based feasible solution, designs algorithms framework based column generation, improves the generalized lable algorithm which is used to solve pricing problem, and concludes the using of the general oprtimization method as determination of five parameters.
3. Based on the analysis and discussion of related parameters of rolling stock planning problem in the background of PDLs in our country, this paper bounds this problem. On the basis of general optimization method, aiming at concrete feature of problems, this paper studies the optimization method of rolling stock circulation and maintenance routing of train units in the "line planned by rolling stock" stage and in the "line adjusted by rolling stock" stage, respectively.
4. Aiming at the characteristic of rolling stock circulation in "line adjusted by rolling stock" stage that its relation of time and space is complex, according to the speciality of time window of timetable, this paper describes the influence of time window to neighor trains by building connection network, describes the relation of time window among related trains by proposing the concept of mutually exclusive arc and proposes the method of judging feasible routing considering the relation of time window among trains in a routing of rolling stock. On this basis, this paper builds optimization model of problem and designs algorithm based artifitial variables.
5. Aiming at the characteristic of crew planning problem of PDLs in our country, which has comlex and various crew rules and strong coupling of plans, this paper projects crew scheduling problem on time dimension using the abstract of connection network. Using the improved generalized labeling algorithm's advantage in deal with complex constraints, considering the relation of crew scheduling and crew rostering, this paper builds optimization model and designs algorithm considering the characteristic of problem. According to the speciality of crew rostering problem, this paper proposed the concept of equal combination of crew pairing and based this concept proposes heuristic algorithm.
引文
[1]Abbink E.,Berg B.V.D.,Kroon L., Salomon M..Allocation of Railway Rolling Stock for Passenger Trains[J]. Transportation Science, 2004, 38(1):33-41
[2]Ahuja R.K.,Liu J.,Orlin J.B.,Sharma D.,Shughar L.A..Solving Real-Life Locomotive- Scheduling Problems[J]. Transportation Science, 2005, 39(4):503-517
[3]Andrew J. Schaefer Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser. Airline crew scheduling under uncertainty[J]. Transportation Science,2005,39(3):340-348
[4]Arabeyre J., Feamley J., Steiger F., Teather W.. The airline crew scheduling problem: A survey[J]. Transportation Science,1969,3:140-163.
[5]Arianna A., Groot R., Leo Kroon, Schrihver A. Efficient Circulation of Railway Rolling Stock. Transportation Science, 200640(3):378-391
[6]Arunapuram S., Mathur K., Solow D. Vehicle routing and scheduling with full truckloads. Transportation Science,2003,37(2):170-182
[7]Assad, A. A.. Models for rail transportation[J]. Transportation Research A, 1980,14(3):205-220.
[8]Assad, A. A.. Modeling of rail networks: Toward a routing/make-up model[J]. Transportation Research B, 1980,14(1-2): 101-114.
[9]Assad A.A. Modeling and improvement issues in vehicle routing: method and studies, Management Science and Systems, North-Holland, Amsterdam, 1998(16):456-469
[10]Barnhart C., Johnson EL, Nemhauser G L. etal. Branch-an d-Price: column generation for solving huge integer programs[J]. Operations Research,1998,46(3):316-32
[11]Barnhart C., Belobaba P., Amedeo R. Odoni.Applications of operations research in the air transport industry[J]. Transportation Science, 2003,37(4):368—391
[12]Barnhart C.. Airline schedule planning[EB/OL]. http://www.core.org.cn/OcwWeb/Global/ all-courses.html
[13]Bartholomew-Biggs M.C., Parkhurst S.C., Wilson S.P. Global optimization approaches to an aircraft routing problem. European Journal of Operational Research,2003,146:417-431
[14]Boland N.,Dethridge J.,Dumitrescu I..Accelerated label setting algorithms for the elementary resource constrained shortest path problem[J]. Operations Research Letters, 2006,34:58-68
[15]Bussieck M.R., Winter T., Zimmermann U.T.. Discrete optimization in public rail transport[J]. Mathematical programming, 1997,79:415-444.
[16]Caprara A, Fischetti M, Toth P, Vigo D. Algorithms for Railway Crew Management[J].Mathematical Programming, 1997,79: 125-141
[17]Caprara A., Fischetti M, Toth P, Vigo D. Modeling and solving the crew rostering problem.Operations Research ,1998,46:820-830
[18]Caprara A, Monaci, M., Toth P. A global method for crew planning in railway application [A]. Computer-Aided Scheduling of Public Transport. Springer, 2001:17-36
[19]Christos Goumopoulos, Efthymios Housos. Efficient trip generation with a rule modeling system for crew scheduling problems The Journal of Systems and Software, 2004, 69: 43-56
[20]Cordeau, J.-F., Toth, P. and Vigo, D. . A survey of optimization models for train routing and scheduling[J]. Transportation Science, 1998,32(4): 380-404.
[21]Cordeau J.F.,Stojkovic G.,Soumis F.,Desrosiers J..Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling[J]. Transportation Science, 2001, 35(4):375-388
[22]Cordeau J.F., Soumis F., Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains. Operations Research,2001,49(4):531-548
[23]Cordeau J.F., Desaulniers G., Lingaya N., Soumis F., Desrosiers J. Simultaneous locomotive and car assignment at VIA Rail Canada. Transportaion Research Part B,2001,35:767-787
[24]Dawid H.,K(?)nig J.,Strauss C.An enhanced rostering model for airline crews[J].Computer& Operations Research,2001,28:671 -688
[25]Desrochers M., Soumis F..A column generation approach to the urban transit crew scheduling problem[J]. Transportation Science,1989,23(1):1-14
[26]Desrochers M, Lenstra J K, Savelsbergh M W P. A classification scheme for vehicle routing and scheduling problem[J]. European Journal of Operational Research, 1990,46: 322-332.
[27]Desrosiers, J., Dumas, Y., Soumis, F.. The multiple vehicle dial-a-ride problem. In: Computer-Aided Transit Scheduling Lecture Notes in Economics and Mathematical System.Springer, Berlin, 1988,308:15-27.
[28]Elizondo R., Parada V.. An evolutionary and constructive approach to a crew scheduling problem in underground transport [EB/OL]. http://www.lia.univ-avignon.fr/chercheurs/
[29]Emst A.T., Jiang H., Krishnamoorthy M., Sier D. Staff scheduling and rostering: A review of applications, methods and models[J]. European Journal of Operational Research,2004,153: 3-27
[30]Fabri A.,Recht P..On dynamic pickup and delivery vehicle routing with several time windows and waiting times[J]. Transportation Research Part B, 2006,40:335-350
[31]Fioole P.J, Leo Kroon, Ga'bor Maroti, Alexander Schrijver.A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research,2005
[32]Freling R., Wagelmans A.P.M., Paixao J.M.P. Models and Algorithms for Single-Depot Vehicle Scheduling. Transportation Science,2001,35(2):165-180
[33]Godwin T.,Gopalan R.,Narendran T.T..Tactical locomotive fleet sizing for freight train operatioins[J]. Transportation Research Part E, 2007
[34]Hadjar A. Marcotte O., Soumis F. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Operations Research,2006,54(1):130-149
[35]Hane, C. A., C. Barnhart, E. L. Johnson, R. E. Marsten, G. L.Nemhauser, G. Sigismondi. The fleet assignment problem: Solving a large-scale integer program. Math. Programming, 1995,70:211-232.
[36]Huisman D., Kroon L.G., Lentink R.M., Vromans M. J.CM..Operations research in passenger railway transportation[R].Econometric Institute Report EI,2005-16.
[37]Huisman D., Freling R., Wagelmans A. P. M.. Multiple-depot integrated vehicle and crew scheduling[J]. Transportation Science,2005,39(2):491-502
[38]Huisman D.. A column generation approach for the rail crew re-scheduling problem[J].European Journal of Operational Research,2006
[39]Hwang H.S. An improved model for vehicle routing problem with time constraint based on genetic algorithm. Computers & Industrial Engineering,2002(42):361-369
[40]Ioachim I.,Desrosiers J.,Soumis F.,Belanger N..Fleet Assignment and routing with schedule synchronization constraints [J]. European Journal of Operational Research, 1999, 119:75-90
[41]Klabjan D.. Topics in airline crew scheduling and large scale optimization[D].Georgia Institute of Technology, 1999
[42]Klabjan D., Johnson E.L., Nemhauser G.L., Gelman E., Ramaswamy S. Airline crew scheduling with time windows and plane-count constraints[J]. Transportation Science,2002,36(3):337-348
[43]Kohl N. Solving the world's largest crew scheduling problem[J]. ORbit,2003,8-12.
[44]Kohl N., Karisch S. E.. Airline crew rostering: problem types, modeling and optimization[J]. Annals of Operations Research,2004,127:223-257
[45]Lan S.,Clarke J.P.,Barnhart C..Planning for Robust Airline Operations:Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions[J]. Transportation Science,2006, 40(1): 15-28
[46]Lavoie S., Minoux M., Odier E..A new approach of crew pairing problems by column generation and application to air transport[J]. European Journal of Operational Research, 1988,35:45-58
[47]Lettocsky L.. Airline operations recovery: an optimization approach[D].Georgia Institute of Technology,1997
[48]Lindner T..Train schedule optimization in public rail transport[D].Technischen Universitt Braunschweig,2000
[49]Lingaya N.,Corduau J.F.,Desaulniers G.,Desrosiers J.,Soumis F..Operational car assignment at VIA Rail Canada[J].Transportation Research Part B,2002,36:755-778
[50]Lohatepanont M.,Barnhart C..Airline Schedule Planning:Integrated Models and Algorithms for Schedule Design and Fleet Assignment[J].Transportation Science,2004,38(1):19-32
[51]L(u|¨)bbecke M.E.,Desrcsiers J..Selected topics in column generation[J].Operations Research,2005,53(6):1007-1023
[52]Marc P.,Kroon L..Circulation of railway rolling stock a branch-and-price approach.Computers&Operational Research,2008,35:538-556
[53]Mar(o|¨)ti G.,Kroon L..Maintenance Routing for Train Units:The Transition Model[J].Transportation Science,2005,39(4):518-525
[54]Mar(o|¨)ti G..Operations research models for railway rolling stock planning[D].Technische Universiteit Eindhoven,2006
[55]Mar(o|¨)ti G.,Kroon L..Maintenance routing for train units:The interchange model.Computers & Operations Research,2007,34:1121-1140
[56]Medard C.P.,Sawhney N..Airline crew scheduling from planning to operations[J].Eur opean Journal of Operational Research,2007,183:1013-1027
[57]Michael Pinedo.调度:原理、算法和系统(第2版,影印版)[M].清华大学出版社,2005
[58]Ozdemir H.T.,Mohan C.K.GraGA:A Graph Based Genetic Algorithm for Airline Crew Scheduling.
[59]Pangborn G.M..A branch-and-cut-and-price implementation for airline crew scheduling[D].Cornell Uninversity,2002
[60]Rosenberger J.M..Topics in airline operations[D].Georgia Institute of Technology,2001
[61]Rosenberger J.M.,Johnson E.L.,Nemhauser G.L.Rerouting Aircraft for Airline Recovery[J].Transportation Science,2003,37(4):408-421
[62]Santos L.,Coutinho-Rodrigues J.,Current J.R..An improved solution algorithm for the constrained shortest path problem[J].Transportation Research Part B,2007,41:756-771
[63]Sarac A..Daily operational aircraft maintenance routing problem[D].State University of New York,2000
[64]Sarac,A.,Batta R.,Rump C.M.A branch-and-price approach for operational aircraft maintenance routing.European Journal of Operational Research,2006,175:1850-1869
[65]Schaefer A.J..Airline crew scheduling under uncertainty[D].Georgia Institute of Technology,2000
[66]Schrijver A.Minimum circulation of railway stock.CWI Quarterly 1993,6:205-221.
[67]Shebalov S.,Klabjan D.Robust Airline Crew Pairing:Move-up Crews.Transportation Science,2006,40(3):300-312
[68]Sherali H.D.,Bish E.K.,Zhu X.M.Airline fleet assignment concepts,models,and algorithms.European Journal of Operational Research,2006,172:1-30
[69]Smith B.C.,Johnson E..Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition[J].Transportation Science,2006,40(4):497-516
[70]Sodhi M.S.,Norris S..A Flexible,fast,and optimal modeling approach applied to crew fostering at London Underground[J].Annals of Operations Research,2004,127:259-281.
[71]Takeda S.,Ikkai Y.,Kataoka K.,Komoda K..Large-scale Crew Scheduling Method by Switching Allocation Knowledge.IEEE,1999:1347-1353
[72]Tallys H.Yunes,Arnaldo V.Moura,Cid C.de Souza.Hybrid column generation approaches for urban transit crew management problems[J].Transportation Science,2005,39(2):273-288
[73]Wang F.Z.,Wang H.X.,Shen J.S..Modeling and solving for railway crew scheduling problem[A].Proceedings of the 6th World Congress on Intelligent Control and Automation,2006.
[74]Wren A.,J.M.Rousseau.Bus Driver Scheduling - An Overview[R].The VIth International Workshop on Computer of Public Transport,Lisbon,Portugal,1993
[75]Wu C.L.,Caves R.E..Towards the optimization of the schedule reliability of aircraft rotations[J].Journal of Air Transport Management,2002,8:419-426
[76]Wu C.L.,Caves R.E..Modelling of aircraft rotation in a multiple airport environment[J].Transportation Research Part E,2002,38:265-277
[77]Wu P.,Hartman J.C.,Wilson G.R..An Intergrated Model and Solution Approach for Fleet Sizing with Heterogeneous Assets[J].Transportation Science,2005,39(1):87-103
[78]Yan S.Y.,Tseng C.H..A passenger demand model for airline flight scheduling and fleet routing[J].Computer & Operations Research,2002,29,:1559-1581
[79]Yen J.W..A stochastic programming formulation of the stochastic crew scheduling problem[D].University of Michigan,2001
[80]Zhu X.Y.,Wilhelm W.E..Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column gereration context[J].European Journal of Operational Research,2007,183:564-577
[81]蔡延光,钱积新,孙优贤.智能运输调度系统模型库构造与管理[J].系统工程理论与实践,2000,9:83-90
[82]蔡延光,师凯.带软时间窗的联盟运输调度问题研究[J].计算机集成制造系统,2006,12(11):1903-1908
[83]陈华群,唐协.基于匈牙利算法的高速动车组周转模型及算法的研究[J].西南民族大学学报-自然科学版,2005,31(5):779-782
[84]崔炳谋.机车周转图的计算机优化算法[J].铁路计算机应用,1999,2:18-24
[85]方剑,席裕庚.FMS中的工作调度[J].高技术通讯,1997,7:53-58
[86]方金城,张岐山.物流配送午辆路径问题(VRP)算法综述[J].沈阳工程学院学报(自然科学版),2006,2(4):357-360
[87]高振.钢铁原料采购物流优化问题与列生成算法研究[D].东北大学,2003
[88]耿敬春,肖国荣,倪少权,牛会想.客运专线动车组周期性运用计划编制的研究[J].铁道学报,2006,28(4):17-21
[89]何霆,刘飞,马玉林,杨海.车间生产调度问题研究[J].机械工程学报,2000,36(5):97-102
[90]侯梅英.中国铁路动车组运用的几点思考[J].平原大学学报,2007,24(5):122-124
[91]黄志彤,倪少权,陈翠利,张苏波.动车组运用及检修设施规模的研究[J].铁道运输与经济,2008,30(6):78-81
[92]贾永基.车辆调度问题优化算法研究[D].上海交通大学,2004
[93]郏宣耀,聂娅.求解航班时间表问题的混合遗传算法[J].淮海工学院学报(自然科学版),2005,14(3):40-43
[94]姜哲,金奕江,张敏等译.人工智能:一种现代方法[M].人民邮电出版社,2004
[95]李军,郭耀煌.物流配送车辆优化调度理论[M].北京:中国物资出版社,2001.
[96]李献忠,徐瑞华.基于乘务广义费用的城市轨道交通排班[J].同济大学学报,2007,35(6):750-754
[97]李献忠,徐瑞华.基于时间耗费的城市轨道交通乘务排班优化[J].铁道学报,2007,29(1):21-25
[98]李致中,孙焰.用电子计算机铺画最优机车周转图[J].铁道运输与经济,1988,(5):12-15
[99]梁栋,林柏梁,严贺祥,李俊卫.车种代用情况下的铁路空车调配研究[J].铁道学报,2005,27(4):1-5
[100]林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型[J].铁道学报,1998,20(5):9-14
[101]刘德刚.航空公司实时飞机和机组调配问题的研究[D].中国科学院,2002
[102]刘丽影,刘继刚,刘继.我国高速动车组检修制度[J].同济大学学报,2001,29(8):1000-1003
[103]聂磊,赵鹏,杨浩,胡安洲.高速铁路动车组运用的研究[J].铁道学报,2001,23(3):1-7
[104]李文权,杜文,周贤伟.优化空车调配问题[J].西南交通大学学报,1998,33(4):383-386.
[105]彭其渊.客运专线运输组织[M].北京:中国铁道出版社,2007
[106]钱颂迪主编,《运筹学》教材编写组编.运筹学(修订版)[M].北京:清华大学出版社,1990.
[107]沈睿.铁路行包服务网络设计[D].北京交通大学,2006.
[108]史峰,胡安洲.机车周转图的线性配置算法[J].铁道学报,1996,4:18-24
[109]施其洲,施勇.具有双向、空重车流的路网车流径路多目标线性规划模型及算例[J].铁道学报,1999,1:2-10
[110]史忠植译.人工智能-复杂问题求解的结构和策略[M].机械工业出版社,2004
[111]孙宏,杜文,徐杰.最小费用最大流模型在航班衔接问题中的应用[J].南京航空航天大学学报,2001,33(5):478-481
[112]孙宏.航空公司飞机排班问题:模型与算法研究[D].西南交通大学,2003
[113]唐恒永,赵传立.排序引论[M].科学出版社,2002
[114]万华,叶耀华.一种带路径约束的多商品流网络设计问题及其禁总算法[J].复旦学报(自然科学版),2004,44(2):220-223.
[115]王斌.集装箱空箱调运优化研究[D].上海海事大学,2005
[116]吴文泷.图论基础及应用[M].北京:中国铁道出版社,1984.
[117]夏阳.客运专线运输组织相关问题研究[D].西南交通大学,2005
[118]肖龙文.最优机车周转图的自动化铺划[J].长沙铁道学院学报,1999,1:54-59
[119]邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,1999.
[120]谢金星,邢文训.网络优化[M].北京:清华大学出版社,2000.
[121]谢政,李建平.网络算法与复杂性理论[M].长沙:国防科技大学出版社,1995.
[122]闫海峰,崔燚.编制机车周转图的优化模型[J].中国铁道科学,2006,27(4):123-128
[123]杨浩,何世伟.铁路运输组织学[M].北京:中国铁道出版社,2001.
[124]杨弋,顾幸生.物流配送车辆优化调度的综述[J].东南大学学报(自然科学版),2003,33Sup:105-111
[125]尹文君,刘民,吴澄.进化计算在生产线凋度研究中的现状与展望[J].计算机集成制造系统--CIMS,2001,7(12):1-6
[126]张唤林,穆建成.高速铁路动车组参数对调整计划编制影响的研究[J].交通与计算机,2004,22(6):113-115
[127]张磊.满载车辆调度问题研究[D].同济大学,2005
[128]张杰,陈韬,施福根.客运专线动车组运用计划的计算机编制[J].西南交通大学学报,2006,41(5):635-640
[129]张苏波,吕红霞,刘淑辉.列车乘务排班系统的设计与实现[J].铁道运输经济,2007,29(8):19-21
[130]赵鹏.高速铁路动车组和乘务运用的研究[D].北京:北方交通大学,1998
[131]赵鹏,胡安洲,杨浩.机车乘务计划的优化编制[J].铁道学报,1998,20(4):8-13
[132]赵鹏,富井规雄.基于概率局域搜索的动车组平日运用计划编制算法[J].系统工程理论与实践,2004,2:123-129
[133]赵鹏,富井规雄.基于路段交换的多基地动午组运用计划的编制算法[J].铁道学报,2004,26(1):7-11
[134]赵鹏,姚凤金,张洪亮.综合调度仿真系统中的机车乘务计划的编制[J].铁道运输与经济,2005,27(3):74-76
[135]赵鹏,杨浩.京沪高速铁路列车开行模式的研究[J].北京交通大学学报,2006,30(3):5-9
[136]中华人民共和国铁道部.铁路动车组运用维修规程[M].北京:中国铁道出版社,2007
[137]朱道立.大系统优化理论和应用[M].上海:上海交通大学出版社,1987
[2]Ahuja R.K.,Liu J.,Orlin J.B.,Sharma D.,Shughar L.A..Solving Real-Life Locomotive- Scheduling Problems[J]. Transportation Science, 2005, 39(4):503-517
[3]Andrew J. Schaefer Ellis L. Johnson, Anton J. Kleywegt, George L. Nemhauser. Airline crew scheduling under uncertainty[J]. Transportation Science,2005,39(3):340-348
[4]Arabeyre J., Feamley J., Steiger F., Teather W.. The airline crew scheduling problem: A survey[J]. Transportation Science,1969,3:140-163.
[5]Arianna A., Groot R., Leo Kroon, Schrihver A. Efficient Circulation of Railway Rolling Stock. Transportation Science, 200640(3):378-391
[6]Arunapuram S., Mathur K., Solow D. Vehicle routing and scheduling with full truckloads. Transportation Science,2003,37(2):170-182
[7]Assad, A. A.. Models for rail transportation[J]. Transportation Research A, 1980,14(3):205-220.
[8]Assad, A. A.. Modeling of rail networks: Toward a routing/make-up model[J]. Transportation Research B, 1980,14(1-2): 101-114.
[9]Assad A.A. Modeling and improvement issues in vehicle routing: method and studies, Management Science and Systems, North-Holland, Amsterdam, 1998(16):456-469
[10]Barnhart C., Johnson EL, Nemhauser G L. etal. Branch-an d-Price: column generation for solving huge integer programs[J]. Operations Research,1998,46(3):316-32
[11]Barnhart C., Belobaba P., Amedeo R. Odoni.Applications of operations research in the air transport industry[J]. Transportation Science, 2003,37(4):368—391
[12]Barnhart C.. Airline schedule planning[EB/OL]. http://www.core.org.cn/OcwWeb/Global/ all-courses.html
[13]Bartholomew-Biggs M.C., Parkhurst S.C., Wilson S.P. Global optimization approaches to an aircraft routing problem. European Journal of Operational Research,2003,146:417-431
[14]Boland N.,Dethridge J.,Dumitrescu I..Accelerated label setting algorithms for the elementary resource constrained shortest path problem[J]. Operations Research Letters, 2006,34:58-68
[15]Bussieck M.R., Winter T., Zimmermann U.T.. Discrete optimization in public rail transport[J]. Mathematical programming, 1997,79:415-444.
[16]Caprara A, Fischetti M, Toth P, Vigo D. Algorithms for Railway Crew Management[J].Mathematical Programming, 1997,79: 125-141
[17]Caprara A., Fischetti M, Toth P, Vigo D. Modeling and solving the crew rostering problem.Operations Research ,1998,46:820-830
[18]Caprara A, Monaci, M., Toth P. A global method for crew planning in railway application [A]. Computer-Aided Scheduling of Public Transport. Springer, 2001:17-36
[19]Christos Goumopoulos, Efthymios Housos. Efficient trip generation with a rule modeling system for crew scheduling problems The Journal of Systems and Software, 2004, 69: 43-56
[20]Cordeau, J.-F., Toth, P. and Vigo, D. . A survey of optimization models for train routing and scheduling[J]. Transportation Science, 1998,32(4): 380-404.
[21]Cordeau J.F.,Stojkovic G.,Soumis F.,Desrosiers J..Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling[J]. Transportation Science, 2001, 35(4):375-388
[22]Cordeau J.F., Soumis F., Desrosiers J. Simultaneous assignment of locomotives and cars to passenger trains. Operations Research,2001,49(4):531-548
[23]Cordeau J.F., Desaulniers G., Lingaya N., Soumis F., Desrosiers J. Simultaneous locomotive and car assignment at VIA Rail Canada. Transportaion Research Part B,2001,35:767-787
[24]Dawid H.,K(?)nig J.,Strauss C.An enhanced rostering model for airline crews[J].Computer& Operations Research,2001,28:671 -688
[25]Desrochers M., Soumis F..A column generation approach to the urban transit crew scheduling problem[J]. Transportation Science,1989,23(1):1-14
[26]Desrochers M, Lenstra J K, Savelsbergh M W P. A classification scheme for vehicle routing and scheduling problem[J]. European Journal of Operational Research, 1990,46: 322-332.
[27]Desrosiers, J., Dumas, Y., Soumis, F.. The multiple vehicle dial-a-ride problem. In: Computer-Aided Transit Scheduling Lecture Notes in Economics and Mathematical System.Springer, Berlin, 1988,308:15-27.
[28]Elizondo R., Parada V.. An evolutionary and constructive approach to a crew scheduling problem in underground transport [EB/OL]. http://www.lia.univ-avignon.fr/chercheurs/
[29]Emst A.T., Jiang H., Krishnamoorthy M., Sier D. Staff scheduling and rostering: A review of applications, methods and models[J]. European Journal of Operational Research,2004,153: 3-27
[30]Fabri A.,Recht P..On dynamic pickup and delivery vehicle routing with several time windows and waiting times[J]. Transportation Research Part B, 2006,40:335-350
[31]Fioole P.J, Leo Kroon, Ga'bor Maroti, Alexander Schrijver.A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operational Research,2005
[32]Freling R., Wagelmans A.P.M., Paixao J.M.P. Models and Algorithms for Single-Depot Vehicle Scheduling. Transportation Science,2001,35(2):165-180
[33]Godwin T.,Gopalan R.,Narendran T.T..Tactical locomotive fleet sizing for freight train operatioins[J]. Transportation Research Part E, 2007
[34]Hadjar A. Marcotte O., Soumis F. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Operations Research,2006,54(1):130-149
[35]Hane, C. A., C. Barnhart, E. L. Johnson, R. E. Marsten, G. L.Nemhauser, G. Sigismondi. The fleet assignment problem: Solving a large-scale integer program. Math. Programming, 1995,70:211-232.
[36]Huisman D., Kroon L.G., Lentink R.M., Vromans M. J.CM..Operations research in passenger railway transportation[R].Econometric Institute Report EI,2005-16.
[37]Huisman D., Freling R., Wagelmans A. P. M.. Multiple-depot integrated vehicle and crew scheduling[J]. Transportation Science,2005,39(2):491-502
[38]Huisman D.. A column generation approach for the rail crew re-scheduling problem[J].European Journal of Operational Research,2006
[39]Hwang H.S. An improved model for vehicle routing problem with time constraint based on genetic algorithm. Computers & Industrial Engineering,2002(42):361-369
[40]Ioachim I.,Desrosiers J.,Soumis F.,Belanger N..Fleet Assignment and routing with schedule synchronization constraints [J]. European Journal of Operational Research, 1999, 119:75-90
[41]Klabjan D.. Topics in airline crew scheduling and large scale optimization[D].Georgia Institute of Technology, 1999
[42]Klabjan D., Johnson E.L., Nemhauser G.L., Gelman E., Ramaswamy S. Airline crew scheduling with time windows and plane-count constraints[J]. Transportation Science,2002,36(3):337-348
[43]Kohl N. Solving the world's largest crew scheduling problem[J]. ORbit,2003,8-12.
[44]Kohl N., Karisch S. E.. Airline crew rostering: problem types, modeling and optimization[J]. Annals of Operations Research,2004,127:223-257
[45]Lan S.,Clarke J.P.,Barnhart C..Planning for Robust Airline Operations:Optimizing Aircraft Routings and Flight Departure Times to Minimize Passenger Disruptions[J]. Transportation Science,2006, 40(1): 15-28
[46]Lavoie S., Minoux M., Odier E..A new approach of crew pairing problems by column generation and application to air transport[J]. European Journal of Operational Research, 1988,35:45-58
[47]Lettocsky L.. Airline operations recovery: an optimization approach[D].Georgia Institute of Technology,1997
[48]Lindner T..Train schedule optimization in public rail transport[D].Technischen Universitt Braunschweig,2000
[49]Lingaya N.,Corduau J.F.,Desaulniers G.,Desrosiers J.,Soumis F..Operational car assignment at VIA Rail Canada[J].Transportation Research Part B,2002,36:755-778
[50]Lohatepanont M.,Barnhart C..Airline Schedule Planning:Integrated Models and Algorithms for Schedule Design and Fleet Assignment[J].Transportation Science,2004,38(1):19-32
[51]L(u|¨)bbecke M.E.,Desrcsiers J..Selected topics in column generation[J].Operations Research,2005,53(6):1007-1023
[52]Marc P.,Kroon L..Circulation of railway rolling stock a branch-and-price approach.Computers&Operational Research,2008,35:538-556
[53]Mar(o|¨)ti G.,Kroon L..Maintenance Routing for Train Units:The Transition Model[J].Transportation Science,2005,39(4):518-525
[54]Mar(o|¨)ti G..Operations research models for railway rolling stock planning[D].Technische Universiteit Eindhoven,2006
[55]Mar(o|¨)ti G.,Kroon L..Maintenance routing for train units:The interchange model.Computers & Operations Research,2007,34:1121-1140
[56]Medard C.P.,Sawhney N..Airline crew scheduling from planning to operations[J].Eur opean Journal of Operational Research,2007,183:1013-1027
[57]Michael Pinedo.调度:原理、算法和系统(第2版,影印版)[M].清华大学出版社,2005
[58]Ozdemir H.T.,Mohan C.K.GraGA:A Graph Based Genetic Algorithm for Airline Crew Scheduling.
[59]Pangborn G.M..A branch-and-cut-and-price implementation for airline crew scheduling[D].Cornell Uninversity,2002
[60]Rosenberger J.M..Topics in airline operations[D].Georgia Institute of Technology,2001
[61]Rosenberger J.M.,Johnson E.L.,Nemhauser G.L.Rerouting Aircraft for Airline Recovery[J].Transportation Science,2003,37(4):408-421
[62]Santos L.,Coutinho-Rodrigues J.,Current J.R..An improved solution algorithm for the constrained shortest path problem[J].Transportation Research Part B,2007,41:756-771
[63]Sarac A..Daily operational aircraft maintenance routing problem[D].State University of New York,2000
[64]Sarac,A.,Batta R.,Rump C.M.A branch-and-price approach for operational aircraft maintenance routing.European Journal of Operational Research,2006,175:1850-1869
[65]Schaefer A.J..Airline crew scheduling under uncertainty[D].Georgia Institute of Technology,2000
[66]Schrijver A.Minimum circulation of railway stock.CWI Quarterly 1993,6:205-221.
[67]Shebalov S.,Klabjan D.Robust Airline Crew Pairing:Move-up Crews.Transportation Science,2006,40(3):300-312
[68]Sherali H.D.,Bish E.K.,Zhu X.M.Airline fleet assignment concepts,models,and algorithms.European Journal of Operational Research,2006,172:1-30
[69]Smith B.C.,Johnson E..Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition[J].Transportation Science,2006,40(4):497-516
[70]Sodhi M.S.,Norris S..A Flexible,fast,and optimal modeling approach applied to crew fostering at London Underground[J].Annals of Operations Research,2004,127:259-281.
[71]Takeda S.,Ikkai Y.,Kataoka K.,Komoda K..Large-scale Crew Scheduling Method by Switching Allocation Knowledge.IEEE,1999:1347-1353
[72]Tallys H.Yunes,Arnaldo V.Moura,Cid C.de Souza.Hybrid column generation approaches for urban transit crew management problems[J].Transportation Science,2005,39(2):273-288
[73]Wang F.Z.,Wang H.X.,Shen J.S..Modeling and solving for railway crew scheduling problem[A].Proceedings of the 6th World Congress on Intelligent Control and Automation,2006.
[74]Wren A.,J.M.Rousseau.Bus Driver Scheduling - An Overview[R].The VIth International Workshop on Computer of Public Transport,Lisbon,Portugal,1993
[75]Wu C.L.,Caves R.E..Towards the optimization of the schedule reliability of aircraft rotations[J].Journal of Air Transport Management,2002,8:419-426
[76]Wu C.L.,Caves R.E..Modelling of aircraft rotation in a multiple airport environment[J].Transportation Research Part E,2002,38:265-277
[77]Wu P.,Hartman J.C.,Wilson G.R..An Intergrated Model and Solution Approach for Fleet Sizing with Heterogeneous Assets[J].Transportation Science,2005,39(1):87-103
[78]Yan S.Y.,Tseng C.H..A passenger demand model for airline flight scheduling and fleet routing[J].Computer & Operations Research,2002,29,:1559-1581
[79]Yen J.W..A stochastic programming formulation of the stochastic crew scheduling problem[D].University of Michigan,2001
[80]Zhu X.Y.,Wilhelm W.E..Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column gereration context[J].European Journal of Operational Research,2007,183:564-577
[81]蔡延光,钱积新,孙优贤.智能运输调度系统模型库构造与管理[J].系统工程理论与实践,2000,9:83-90
[82]蔡延光,师凯.带软时间窗的联盟运输调度问题研究[J].计算机集成制造系统,2006,12(11):1903-1908
[83]陈华群,唐协.基于匈牙利算法的高速动车组周转模型及算法的研究[J].西南民族大学学报-自然科学版,2005,31(5):779-782
[84]崔炳谋.机车周转图的计算机优化算法[J].铁路计算机应用,1999,2:18-24
[85]方剑,席裕庚.FMS中的工作调度[J].高技术通讯,1997,7:53-58
[86]方金城,张岐山.物流配送午辆路径问题(VRP)算法综述[J].沈阳工程学院学报(自然科学版),2006,2(4):357-360
[87]高振.钢铁原料采购物流优化问题与列生成算法研究[D].东北大学,2003
[88]耿敬春,肖国荣,倪少权,牛会想.客运专线动车组周期性运用计划编制的研究[J].铁道学报,2006,28(4):17-21
[89]何霆,刘飞,马玉林,杨海.车间生产调度问题研究[J].机械工程学报,2000,36(5):97-102
[90]侯梅英.中国铁路动车组运用的几点思考[J].平原大学学报,2007,24(5):122-124
[91]黄志彤,倪少权,陈翠利,张苏波.动车组运用及检修设施规模的研究[J].铁道运输与经济,2008,30(6):78-81
[92]贾永基.车辆调度问题优化算法研究[D].上海交通大学,2004
[93]郏宣耀,聂娅.求解航班时间表问题的混合遗传算法[J].淮海工学院学报(自然科学版),2005,14(3):40-43
[94]姜哲,金奕江,张敏等译.人工智能:一种现代方法[M].人民邮电出版社,2004
[95]李军,郭耀煌.物流配送车辆优化调度理论[M].北京:中国物资出版社,2001.
[96]李献忠,徐瑞华.基于乘务广义费用的城市轨道交通排班[J].同济大学学报,2007,35(6):750-754
[97]李献忠,徐瑞华.基于时间耗费的城市轨道交通乘务排班优化[J].铁道学报,2007,29(1):21-25
[98]李致中,孙焰.用电子计算机铺画最优机车周转图[J].铁道运输与经济,1988,(5):12-15
[99]梁栋,林柏梁,严贺祥,李俊卫.车种代用情况下的铁路空车调配研究[J].铁道学报,2005,27(4):1-5
[100]林柏梁,胡安洲.重空车流运行组织的协同优化理论及模型[J].铁道学报,1998,20(5):9-14
[101]刘德刚.航空公司实时飞机和机组调配问题的研究[D].中国科学院,2002
[102]刘丽影,刘继刚,刘继.我国高速动车组检修制度[J].同济大学学报,2001,29(8):1000-1003
[103]聂磊,赵鹏,杨浩,胡安洲.高速铁路动车组运用的研究[J].铁道学报,2001,23(3):1-7
[104]李文权,杜文,周贤伟.优化空车调配问题[J].西南交通大学学报,1998,33(4):383-386.
[105]彭其渊.客运专线运输组织[M].北京:中国铁道出版社,2007
[106]钱颂迪主编,《运筹学》教材编写组编.运筹学(修订版)[M].北京:清华大学出版社,1990.
[107]沈睿.铁路行包服务网络设计[D].北京交通大学,2006.
[108]史峰,胡安洲.机车周转图的线性配置算法[J].铁道学报,1996,4:18-24
[109]施其洲,施勇.具有双向、空重车流的路网车流径路多目标线性规划模型及算例[J].铁道学报,1999,1:2-10
[110]史忠植译.人工智能-复杂问题求解的结构和策略[M].机械工业出版社,2004
[111]孙宏,杜文,徐杰.最小费用最大流模型在航班衔接问题中的应用[J].南京航空航天大学学报,2001,33(5):478-481
[112]孙宏.航空公司飞机排班问题:模型与算法研究[D].西南交通大学,2003
[113]唐恒永,赵传立.排序引论[M].科学出版社,2002
[114]万华,叶耀华.一种带路径约束的多商品流网络设计问题及其禁总算法[J].复旦学报(自然科学版),2004,44(2):220-223.
[115]王斌.集装箱空箱调运优化研究[D].上海海事大学,2005
[116]吴文泷.图论基础及应用[M].北京:中国铁道出版社,1984.
[117]夏阳.客运专线运输组织相关问题研究[D].西南交通大学,2005
[118]肖龙文.最优机车周转图的自动化铺划[J].长沙铁道学院学报,1999,1:54-59
[119]邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,1999.
[120]谢金星,邢文训.网络优化[M].北京:清华大学出版社,2000.
[121]谢政,李建平.网络算法与复杂性理论[M].长沙:国防科技大学出版社,1995.
[122]闫海峰,崔燚.编制机车周转图的优化模型[J].中国铁道科学,2006,27(4):123-128
[123]杨浩,何世伟.铁路运输组织学[M].北京:中国铁道出版社,2001.
[124]杨弋,顾幸生.物流配送车辆优化调度的综述[J].东南大学学报(自然科学版),2003,33Sup:105-111
[125]尹文君,刘民,吴澄.进化计算在生产线凋度研究中的现状与展望[J].计算机集成制造系统--CIMS,2001,7(12):1-6
[126]张唤林,穆建成.高速铁路动车组参数对调整计划编制影响的研究[J].交通与计算机,2004,22(6):113-115
[127]张磊.满载车辆调度问题研究[D].同济大学,2005
[128]张杰,陈韬,施福根.客运专线动车组运用计划的计算机编制[J].西南交通大学学报,2006,41(5):635-640
[129]张苏波,吕红霞,刘淑辉.列车乘务排班系统的设计与实现[J].铁道运输经济,2007,29(8):19-21
[130]赵鹏.高速铁路动车组和乘务运用的研究[D].北京:北方交通大学,1998
[131]赵鹏,胡安洲,杨浩.机车乘务计划的优化编制[J].铁道学报,1998,20(4):8-13
[132]赵鹏,富井规雄.基于概率局域搜索的动车组平日运用计划编制算法[J].系统工程理论与实践,2004,2:123-129
[133]赵鹏,富井规雄.基于路段交换的多基地动午组运用计划的编制算法[J].铁道学报,2004,26(1):7-11
[134]赵鹏,姚凤金,张洪亮.综合调度仿真系统中的机车乘务计划的编制[J].铁道运输与经济,2005,27(3):74-76
[135]赵鹏,杨浩.京沪高速铁路列车开行模式的研究[J].北京交通大学学报,2006,30(3):5-9
[136]中华人民共和国铁道部.铁路动车组运用维修规程[M].北京:中国铁道出版社,2007
[137]朱道立.大系统优化理论和应用[M].上海:上海交通大学出版社,1987
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |