旅客出行服务设计与可靠性评价方法研究
|
摘要
我国铁路客运网络的扩展、网络售票的推广和旅客出行需求的不断增长,为旅客出行服务的发展提供了良好的契机。旅客出行服务问题的研究旨在为出行者提供全程的个性化出行方案,对提升出行服务运营企业和中介企业的服务品质有着重要的意义。本文提出了一般化的旅客出行服务设计和评价问题,并结合我国铁路客运的特点,针对铁路旅程规划和出行方案可靠性评价进行了研究。论文主要研究工作包括：
1.从旅客出行的时空活动出发,将旅客出行全过程抽象为由出行服务构成的出行方案。以规划全程出行方案为目标,从时空结合的角度提出了旅客出行服务设计问题,给出了通用模型和一般求解过程,突破了原有研究将出行规划时空问题分割的缺陷。
2.以出行方案的可靠性为评价对象提出了旅客出行服务评价问题,并对不同领域出行服务评价问题的基本特征和共性进行了分析,从理论上提出了出行方案的时间可靠性和服务能力可靠性评价的一般方法。
3.针对我国铁路旅程规划问题,以铁路客运服务为描述对象建立了铁路换乘服务网络,给出了铁路旅客出行方案的定义,建立了不同优化目标下,可实现不限中转地点和同城换乘的旅程规划问题模型。
4.针对铁路旅程规划模型,提出了换乘节点匹配法和高等级节点优先法对模型进行快速求解。前者采用先求可行解后优化的两阶段求解思路,可快速求解一定换乘次数以内的最优出行方案；后者采用优先寻找较高等级节点作为中转城市的方法,通过节省搜索空间能够快速求解较优的可行出行方案。算法经实例验证。
5.针对铁路旅客出行方案可靠性评价问题,分析了可靠性评价研究的层次和影响可靠性的因素,然后从服务层次角度提出了行程时间可靠性评价和服务能力可靠性评价两个问题。
6.针对行程时间可靠性评价问题,研究了单弧段行程时间可靠性的评价方法和换乘出行方案的接续可靠性评价方法,提出了通过分析列车延误历史数据评价出行方案接续可靠性的方法,并经算例验证。
7.针对服务能力可靠性评价问题,结合我国铁路客票系统数据的现状,从旅客购票难易程度出发,提出了通过分析列车票额和旅客历史购票规律判断OD间购票紧张程度,进而评价出行方案服务能力可靠性的方法,并经实例验证。
The expansion of China's railway passenger network, the popularization of online ticketing and growing passenger travel demand have laid the foundation for the development of travel services. Researches on travel services aim to provide travelers with personalized travel plans that cover their whole journey. The researches have a significant influence to improve the service quality of travel service providers and agencies. This paper proposes a generalized travel services problem and dissects it into two subproblems, design and evaluation. From the perspective of railway travelers, this paper focuses on the model and algorithms for railway travel planning problem, as well as methods on reliability evaluation of railway travel plans. The main research work of this paper can be concluded as follows:
1. For all intents and purposes, a traveler's journey consists of a series of activities, so the whole journey can be abstracted as a travel plan consisted of travel services that support travel activities. In order to design travel plans that cover the whole journey the paper proposes a novel problem-travel services design problem (TSDP) from the perspective of combining time and space. A generalized model and solution of TSDP is proposed, which breaks the limitation that existent researches separate time and space problems.
2. From the perspective of evaluating the reliability of travel plans, the paper presents travel services evaluation problem (TSEP). Common characteristics of TSEP in different fields are analyzed, and the paper theoretically proposes the general evaluation methods on reliability of travel time and service capacity.
3. For railway travel planning problem, a transit service network is constructed to describe railway passenger services. The definition of railway travel plan is given. A railway travel planning model with personalized optimization objectives is proposed, and it models a realistic travel planning problem with non-designated transfer points and possible co-station transfers.
4. To solve railway travel planning model, the paper proposes two algorithms with respect to different application scope. First algorithm is called transfer node matching. Following a two-stage strategy, it searches a set of feasible travel plans within a certain number of transfers and then from the set selects optimal travel plans. The other algorithm is called ranking-based travel plan search. When searching travel plans, it chooses alternative transit cities from a selective set of prioritized cities. As it saves search space, the algorithm can efficiently find feasible travel plans. Examples of both algorithms are given.
5. For railway travel plan reliability evaluation, it discusses the levels of reliability researches and factors that affect travel time reliability and service capacity reliability. From the perspective of service reliability, the paper focuses on the following two issues: travel time reliability evaluation and service capacity reliability evaluation.
6. In travel time reliability evaluation, methods to measure travel time reliability of a single-legged travel plan and connecting reliability of a multi-legged travel plan are proposed. Travel time reliability and connecting reliability can be calculated based on trains' punctuality data.
7. In service capacity reliability evaluation, considering the status quo of China Railway Ticketing System's data structure, the paper proposes a method to assess the train's service capacity reliability by measuring the degree of difficulty for passengers to buy tickets. The probability of tickets in short supply is calculated by analyzing the process of passengers buying tickets, and then the service capacity reliability of a travel plan is measured based on the probabilities.
1.从旅客出行的时空活动出发,将旅客出行全过程抽象为由出行服务构成的出行方案。以规划全程出行方案为目标,从时空结合的角度提出了旅客出行服务设计问题,给出了通用模型和一般求解过程,突破了原有研究将出行规划时空问题分割的缺陷。
2.以出行方案的可靠性为评价对象提出了旅客出行服务评价问题,并对不同领域出行服务评价问题的基本特征和共性进行了分析,从理论上提出了出行方案的时间可靠性和服务能力可靠性评价的一般方法。
3.针对我国铁路旅程规划问题,以铁路客运服务为描述对象建立了铁路换乘服务网络,给出了铁路旅客出行方案的定义,建立了不同优化目标下,可实现不限中转地点和同城换乘的旅程规划问题模型。
4.针对铁路旅程规划模型,提出了换乘节点匹配法和高等级节点优先法对模型进行快速求解。前者采用先求可行解后优化的两阶段求解思路,可快速求解一定换乘次数以内的最优出行方案；后者采用优先寻找较高等级节点作为中转城市的方法,通过节省搜索空间能够快速求解较优的可行出行方案。算法经实例验证。
5.针对铁路旅客出行方案可靠性评价问题,分析了可靠性评价研究的层次和影响可靠性的因素,然后从服务层次角度提出了行程时间可靠性评价和服务能力可靠性评价两个问题。
6.针对行程时间可靠性评价问题,研究了单弧段行程时间可靠性的评价方法和换乘出行方案的接续可靠性评价方法,提出了通过分析列车延误历史数据评价出行方案接续可靠性的方法,并经算例验证。
7.针对服务能力可靠性评价问题,结合我国铁路客票系统数据的现状,从旅客购票难易程度出发,提出了通过分析列车票额和旅客历史购票规律判断OD间购票紧张程度,进而评价出行方案服务能力可靠性的方法,并经实例验证。
The expansion of China's railway passenger network, the popularization of online ticketing and growing passenger travel demand have laid the foundation for the development of travel services. Researches on travel services aim to provide travelers with personalized travel plans that cover their whole journey. The researches have a significant influence to improve the service quality of travel service providers and agencies. This paper proposes a generalized travel services problem and dissects it into two subproblems, design and evaluation. From the perspective of railway travelers, this paper focuses on the model and algorithms for railway travel planning problem, as well as methods on reliability evaluation of railway travel plans. The main research work of this paper can be concluded as follows:
1. For all intents and purposes, a traveler's journey consists of a series of activities, so the whole journey can be abstracted as a travel plan consisted of travel services that support travel activities. In order to design travel plans that cover the whole journey the paper proposes a novel problem-travel services design problem (TSDP) from the perspective of combining time and space. A generalized model and solution of TSDP is proposed, which breaks the limitation that existent researches separate time and space problems.
2. From the perspective of evaluating the reliability of travel plans, the paper presents travel services evaluation problem (TSEP). Common characteristics of TSEP in different fields are analyzed, and the paper theoretically proposes the general evaluation methods on reliability of travel time and service capacity.
3. For railway travel planning problem, a transit service network is constructed to describe railway passenger services. The definition of railway travel plan is given. A railway travel planning model with personalized optimization objectives is proposed, and it models a realistic travel planning problem with non-designated transfer points and possible co-station transfers.
4. To solve railway travel planning model, the paper proposes two algorithms with respect to different application scope. First algorithm is called transfer node matching. Following a two-stage strategy, it searches a set of feasible travel plans within a certain number of transfers and then from the set selects optimal travel plans. The other algorithm is called ranking-based travel plan search. When searching travel plans, it chooses alternative transit cities from a selective set of prioritized cities. As it saves search space, the algorithm can efficiently find feasible travel plans. Examples of both algorithms are given.
5. For railway travel plan reliability evaluation, it discusses the levels of reliability researches and factors that affect travel time reliability and service capacity reliability. From the perspective of service reliability, the paper focuses on the following two issues: travel time reliability evaluation and service capacity reliability evaluation.
6. In travel time reliability evaluation, methods to measure travel time reliability of a single-legged travel plan and connecting reliability of a multi-legged travel plan are proposed. Travel time reliability and connecting reliability can be calculated based on trains' punctuality data.
7. In service capacity reliability evaluation, considering the status quo of China Railway Ticketing System's data structure, the paper proposes a method to assess the train's service capacity reliability by measuring the degree of difficulty for passengers to buy tickets. The probability of tickets in short supply is calculated by analyzing the process of passengers buying tickets, and then the service capacity reliability of a travel plan is measured based on the probabilities.
引文
[1]E. W. Dijkstra. A note on two problems in connexion with graphs [J]. Numerische Mathematik,1959,1(1):269-271
[2]陈丽佳.基于公交网络模型的最优路径算法研究与实现[学位论文].长沙：中南大学,2009
[3]L. R. Ford Jr., D. R. Fulkerson. Flows in Networks [M]. Princeton, NJ, USA:Princeton University Press,1962
[4]L. R. Ford. Network Flow Theory [M]. Santa Monica, CA:RAND Corporation,1956
[5]R. Bellman. On a routing problem [J]. Quarterly of Applied Mathematics,1958,16(1):87-90
[6]P. E. Hart, N. J. Nilsson, B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths [J]. IEEE Transactions on Systems Science and Cybernetics,1968,4(2): 100-107
[7]U. Pape. Implementation and efficiency of Moore-algorithms for the shortest route problem [J]. Mathematical Programming,1974,7(1):212-222
[8]D. P. Bertsekas. Network optimization:continuous and discrete models [M]. Nashua, NH, USA:Athena Scientific,1998:51-114
[9]陆锋.最短路径算法：分类体系与研究进展[J].测绘学报,2001,30(3)：269-275
[10]L. Marton. A label-setting algorithm for calculating shortest path trees in sparse networks [J]. Hungarian Electronic Journal of Sciences,2000,19(2):115-132
[11]D. Delling, P. Sanders, D. Schultes, et al. Engineering Route Planning Algorithms [M]. Algorithmics of Large and Complex Networks, Lerner J. U. Rgen, Wagner Dorothea, Zweig Katharina A., Berlin, Heidelberg:Springer-Verlag,2009:117-139
[12]D. Delling. Engineering and Augmenting Route Planning Algorithms [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2009
[13]D. Schieferdecker. Systematic Combination of Speed-Up Techniques for exact Shortest-Path Queries [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2008
[14]G. B. Dantzig. Linear Programming and Extensions [M]. Princeton, NJ, USA:Princeton University Press,1963
[15]A. V. Goldberg, C. Harrelson. Computing the shortest path:A* search meets graph theory [C]. SODA'05. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA:Society for Industrial and Applied Mathematics, 2005:156-165
[16]G. Nannicini, D. Delling, L. Liberti, et al. Bidirectional A* search for time-dependent fast paths [C]. the 7th international conference on Experimental algorithms(WEA'08). Lecture Notes in Computer Science. Provincetown, MA, USA:Springer-Verlag,2008:334-346
[17]A. V. Goldberg, R. F. F. Werneck. Computing Point-to-Point Shortest Paths from External Memory [C]. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005). Vancouver, BC, Canada:SIAM,2005:26-40
[18]R. Bauer, D. Delling, D. Wagner. Experimental study of speed-up techniques for timetable information systems [J]. Networks,2011,57(1):38-52
[19]D. Delling, D. Wagner. Landmark-based routing in dynamic graphs [C]. the 6th international conference on Experimental algorithms(WEA'07). Lecture Notes in Computer Science. Rome, Italy:Springer-Verlag,2007:52-65
[20]D. Wagner, T. Willhalm. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs [C]. The 11th European Symposium on Algorithms. Lecture Notes in Computer Science. Budapest, Hungary:Springer-Verlag,2003:776-788
[21]D. Wagner, T. Willhalm, C. Zaroliagis. Geometric containers for efficient shortest-path computation [J]. ACM Journal of Experimental Algorithmics,2005,10:1-3
[22]M. Holzer, F. Schulz, D. Wagner, et al. Combining speed-up techniques for shortest-path computations [J]. ACM Journal of Experimental Algorithmics,2005,10:2-5
[23]D. Wagner, T. Willhalm, C. Zaroliagis. Dynamic Shortest Paths Containers [J]. Electronic Notes in Theoretical Computer Science,2004,92:65-84
[24]宋青,汪小帆.最短路径算法加速技术研究综述[J].电子科技大学学报,2012,41(2)：176-184
[25]U. Lauther. An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background [J]. In Geoinformation und Mobilitat--von der Forschung zur praktischen Anwendung,2004,22:219-230
[26]B. Monien, S. Schamberger. Graph partitioning with the Party library:helpful-sets in practice [C]. SB AC-PAD 2004 the 16th Symposium on Computer Architecture and High Performance Computing. Foz do Iguacu, PR, Brazil:2004:198-205
[27]E. Kohler, R. Mohring, H. Schilling. Acceleration of Shortest Path and Constrained Shortest Path Computation [C].4th International Workshop(WEA'05). Lecture Notes in Computer Science. Santorini Island, Greece:Springer-Verlag,2005:126-138
[28]F. Pellegrini. SCOTCH:Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package [Z].2007: http://www.labri.fr/perso/pelegrin/scotch/
[29]G. Karypis, V. Kumar. METIS-Serial Graph Partitioning and Fill-reducing Matrix Ordering [Z].2011:http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
[30]R. H. Mohring, H. Schilling, B. Schutz, et al. Partitioning Graphs to Speed Up Dijkstra's Algorithm [C]. the 4th International Workshop(WEA'05). Lecture Notes in Computer Science. Santorini Island, Greece:Springer-Verlag,2005:273-283
[31]E. Kohler, R. H. Mohring, H. Schilling. Fast point-to-point shortest path computations with arc-flags [C].9th DIM ACS Implementaion Challenge.2006
[32]J. L. Bander, C. C. I. White. A heuristic search algorithm for path determination with learning [J]. IEEE Transactions on Systems, Man and Cybernetics Part A:Systems and Humans,1998, 28(1):131-134
[33]P. Sanders, D. Schultes. Highway Hierarchies Hasten Exact Shortest Path Queries [C]. the 13th Annual European Symposium on Algorithms(ESA'05). Lecture Notes in Computer Science. Mallorca, Spain:Springer-Verlag,2005:568-579
[34]P. Sanders, D. Schultes. Engineering highway hierarchies [C]. the 14th Annual European Symposium on Algorithms(ESA'06). Lecture Notes in Computer Science. Zurich, Switzerland: Springer-Verlag,2006:804-816
[35]R. Geisberger. Contraction Hierarchies [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2008
[36]R. Geisberger, P. Sanders, D. Schultes, et al. Contraction Hierarchies:Faster and Simpler Hierarchical Routing in Road Networks [C]. the 7th international conference on Experimental algorithms(WEA'08). Lecture Notes in Computer Science. Provincetown, MA, USA: Springer-Verlag,2008:319-333
[37]陆锋,周成虎,万庆.基于层次空间推理的交通网络行车最优路径算法[J].武汉测绘科技大学学报,2000,25(3)：226-232
[38]付梦印,李杰,邓志红.限制搜索区域的分层路径规划算法[J].计算机辅助设计与图形学学报,2005,17(8)：1773-1777
[39]汤筠筠,张代胜,陈朝阳.公交出行查询系统中出行路径选择模型的研究[J].合肥工业大学学报(自然科学版),2004,27(10)：1227-1230
[40]翁敏,毋河海,杜清运等.基于公交网络模型的最优出行路径选择的研究[J].武汉大学学报(信息科学版),2004,29(6)：500-503
[41]赵巧霞,马志强,张发.以最小换乘次数和站数为目标的公交出行算法[J].计算机应用,2004,24(12)：136-137,146
[42]陈琛.城市公共交通换乘系统研究[学位论文].南京：东南大学,2004
[43]汪江洪.公交换乘系统研究及其评价[学位论文].成都：西南交通大学,2006
[44]张玉春,韩秀华,臧雪柏.基于双向搜索的公交路径选择算法及优化模型[J].吉林大学学报(信息科学版),2009,27(6)：579-584
[45]陈小辉.公交网络最优路径选择算法研究[J].科学技术与工程,2009,9(11)：3141-3143,3161
[46]赵敏.公交换乘系统的算法研究与应用[学位论文].太原：中北大学,2009
[47]C. Liu. Best-path planning for public transportation systems [C]. The IEEE 5th International Conference on Intelligent Transportation Systems(ITSC2002). Singapore:2002:834-839
[48]F. Schulz, D. Wagner, K. Weihe. Dijkstra's Algorithm On-Line:An Empirical Case Study from Public Railroad Transport [C]. The 3rd International Workshop on Algorithm Engineering (WAE'99). Lecture Notes in Computer Science. London, UK:Springer, 1999:110-123
[49]E. Pyrga, F. Schulz, D. Wagner, et al. Experimental comparison of shortest path approaches for timetable information [C]. the 6th Workshop on Algorithm Engineering and Experiments(ALENEX'O4). New Orleans. LA, USA:SIAM,2004:88-99
[50]F. Schulz. Timetable information and shortest paths [Dissertation]. Karlsruhe, Germany: Universitat Karlsruhe,2005
[51]D. Delling, T. Pajor, D. Wagner. Engineering Time-Expanded Graphs for Faster Timetable Information [C].8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems(ATMOS'08). Lecture Notes in Computer Science. Universitat Karlsruhe, Germany:Springer-Verlag,2008:182-206
[52]M. Muller-Hannemann, F. Schulz, D. Wagner, et al. Timetable Information:Models and Algorithms [C].4th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS'04). Lecture Notes In Computer Science. Bergen, Norway: Springer-Verlag,2004:67-90
[53]E. Pyrga, F. Schulz, D. Wagner, et al. Efficient models for timetable information in public transportation systems [J]. ACM Journal of Experimental Algorithmics,2008,12:2-4
[54]A. Orda, R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length [J]. Journal of ACM,1990,37(3):607-625
[55]S. C. Wong, C.O. Tong. Estimation of time-dependent origin-destination matrices for transit networks [J]. Transportation Research Part B:Methodological,1998,32(1):35-48
[56]R. F. Casey, L. N. Labell, E. J. Carpenter, et al. Advanced public transportation systems:the state of the art update, DOT-VNTSC-FTA-97-9[R]. Washington, DC:US Department of Transportation,1998
[57]M. E. T. Horn. An extended model and procedural framework for planning multi-modal passenger journeys [J]. Transportation Research Part B:Methodological,2003,37(7): 641-660
[58]陈丽佳.基于公交网络模型的最优路径算法研究与实现[学位论文].中南大学,2009
[59]S. Chien, Z. Yang, E. Hou. Genetic Algorithm Approach for Transit Route Planning and Design [J]. Journal of Transportation Engineering,2001,127(3):200-207
[60]师桂兰,邓卫,葛亮.基于平均换乘的城市公交线网性能评价[J].洛阳大学学报,2003,18(4)：26-31
[61]傅冬绵.交通系统中最少换乘算法及其实现[J].华侨大学学报(自然科学版),2001,22(4)：348-350
[62]M. Milller-Hannemann, K. Weihe. Pareto Shortest Paths is Often Feasible in Practice [C]. the 5th International Workshop on Algorithm Engineering(WEA'01). Lecture Notes in Computer Science. Arhus, Denmark:Springer,2001:185-197
[63]M. Muller-Hannemann, M. Schnee. Finding All Attractive Train Connections by Multi-criteria Pareto Search [C].4th International Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS'04). Lecture Notes in Computer Science. Bergen, Norway:Springer,2007:246-263
[64]Y. Disser, M. Miiller Hannemann, M. Schnee. Multi-criteria Shortest Paths in Time-Dependent Train Networks [C].7th International Workshop on Experimental Algorithms(WEA'08). Lecture Notes in Computer Science. Provincetown, MA, USA: Springer,2008:347-361
[65]唐学燕.客运中转径路优化模型与算法研究[学位论文].成都：西南交通大学,2011
[66]齐玉杰,陈光伟.铁路客运经由计算[J].铁路计算机应用,1997,6(6)：39-41
[67]王华,季令.我国铁路客运合理径路选择的研究[J].上海铁道大学学报,1999,20(4)：51-54
[68]王华,季令.中转换乘经由在我国铁路客票系统中的应用[J].中国铁路,1998,(3)：28-30
[69]史峰,马钧培,向联慧等.客运中转径路的换乘模型及算法[J].铁道学报,1999,21(5)：1-4
[70]成惠.铁路运输特定经由算法的研究与实现[学位论文].长沙：中南大学,2007
[71]吕晓艳,刘春煌,单杏花等.基于车次径路约束下的客运径路生成算法优化[J].中国铁道科学,2007,28(3)：122-125
[72]吕晓艳,刘春煌,朱建生等.铁路客运中转径路计算模型研究[J].铁道运输与经济,2007,29(5)：75-77,80
[73]张彦.铁路客票中转换乘多径路选择问题的研究[J].铁道运输与经济,1997,19(8)：12-14
[74]王华.我国铁路客票系统和客运径路的研究[学位论文].上海：上海铁道大学,1997
[75]史峰,邓连波.旅客换乘网络优化设计[J].铁道科学与工程学报,2004,1(1)：78-82
[76]余震江.基于最短路径Dijkstra算法的铁路客运中转径路优化研究[学位论文].重庆大学,2008
[77]崔炳谋,马钧培,陈光伟等.铁路旅客旅行换乘方案优选算法[J].中国铁道科学,2007,28(6)：122-127
[78]刘兰芬,倪晓宇.铁路客运中转换乘模型的遗传算法研究[J].铁道运输与经济,2006,28(2)：86-89
[79]江南,史峰,卢红岩等.铁路旅客乘车方案优化决策模型研究[J].铁道学报,2007,29(3)：13-18
[80]杨淮清,薛明昊,余冠华.一种面向中转换乘的铁路网建模方法研究[J].计算机技术与发展,2010,20(4)：211-214,219
[81]于澎,朱建生.基于人工神经网络的铁路客票系统中转路径选取研究[J].铁道运输与经济,2010,32(3)：42-46
[82]董晓岩,刘军,季常煦.基于多种运输方式的行包快捷货物运输网络模型的设计与研究[J].物流技术,2006,(10)：36-39
[83]李先进.铁路行包运输组织方法及其优化研究[学位论文].北京交通大学,2007
[84]朱晔,田宁,杨东援等.铁路行包运输径路算法[J].中国铁道科学,2008,29(6)：111-115
[85]张瑞芬.铁路行包运营管理系统里程计算模块的设计与实现[学位论文].内蒙古大学,2009
[86]朱晔,田宁,杨东援等.铁路行包运输方案编制模型研究[J].铁道学报,2009,31(4)：20-24
[87]T. Pajor. Multi-Modal Route Planning [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2009
[88]C. Barrett, K. Bisset, M. Holzer, et al. Engineering Label-Constrained Shortest-Path Algorithms [C]. the 4th international conference on Algorithmic Aspects in Information and Management(AAIM'08). Lecture Notes in Computer Science. Shanghai, China: Springer-Verlag,2008:27-37
[89]C. Barrett, R. Jacob, M. Marathe. Formal-Language-Constrained Path Problems [J]. SIAM Journal on Computing,2000,30(3):809-837
[90]C. Barrett, K. Bisset, R. Jacob, et al. Classical and Contemporary Shortest Path Problems in Road Networks:Implementation and Experimental Analysis of the TRANSIMS Router [C]. 10th Annual European Symposium on Algorithms(ESA'02). Proceedings of the 10th Annual European Symposium on Algorithms. London, UK:Springer-Verlag,2002:126-138
[91]M. Holzer. Engineering Planar-Separator and Shortest-Path Algorithms [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2008
[92]H. Yu, F. Lu. A Multi-Modal Route Planning Approach with an Improved Genetic Algorithm [C]. Joint International Conference on Theory, Data Handling and Modelling in GeoSpatial Information Science. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences Volume 38, Part 2. Hong Kong:2010:343-348
[93]R. Sedgewick, J. Vitter. Shortest paths in euclidean graphs [J]. Algorithmica,1986,1:31-48
[94]Y. Yin, W. H. K. Lam, H. Ieda. Reliability assessment on transit network services [C]. The 1st International Symposium on Transportation Network Reliability. The network reliability of transport:proceedings of the 1st International Symposium on Transportation Network Reliability (INSTR). Kyoto, Japan:Pergamon,2003:119-132
[95]A. Rudnicki. Investigation by Computer Simulation-some aspect of transportation service reliability in urban public transport [C]. the 14th International Conference on the Applications of Computer Science and Mathematics in Architecture and Civil Engineering. Bauhaus University Weimar:1997
[96]M. H, K. H. Mathematics for Reliability Analysis [M]. Tokyo, Japan:Asakura-shoten,1982
[97]饭田恭敬.交通工程学[M].北京：人民交通出版社,1994
[98]A. Chen, H. Yang, H. K. Lo, et al. Capacity reliability of a road network:an assessment methodology and numerical results [J]. Transportation Research Part B:Methodological,2002, 36(3):225-252
[99]Y. Asakura, M. Kashiwadani. Road network reliability caused by daily fluctuation of traffic flow [C].19th PTRC Summer Annual Meeting, Seminar G. University of Sussex, England: 1991:73-84
[100]Y. Asakura. Reliability measures of an Origin and Destination Pair in a Deteriorated Road Network with Variable Flows [C]. the 4th Meeting of the Euro Working Group on Transportation. Transportation Networks:Recent Methodological Advances:Selected Proceedings of the 4th EURO Transportation Meeting. New Caste upon Tyne, UK:Pergamon, 1996:273-287
[101]熊志华.道路网行程时间可靠性基础理论与方法研究[学位论文].北京交通大学,2006
[102]陆奇志.公共交通运行时间可靠性评价方法研究[学位论文].新疆农业大学,2006
[103]陆奇志,艾力·斯木吐拉.基于Matlab仿真的公交系统运行时间可靠性评价方法[J].城市交通,2006,4(4)：70-75
[104]范海雁,杨晓光,严凌等.蒙特卡罗法在公交线路运行时间可靠性计算中的应用[J].上海理工大学学报,2006,28(1)：59-62
[105]宋晓梅.常规公交网络运行可靠性多层次评价模型与算法[学位论文].北京：北京交通大学,2010
[106]B. P. Sterman, J. L. Schofer. Factors Affecting Reliability of Urban Bus Services [J]. Transportation Engineering Journal,1976,102(1):147-159
[107]R. A. Chapman. Bus reliability-definition and measurement[R]. Newcastle-Upon-Tyne, Northumberland, England:Transport Operations Group, Newcastle-Upon-Tyne University, 1976
[108]A. Polus. Modeling and measurements of bus service reliability [J]. Transportation Research, 1978,12(4):253-256
[109]M. A. Turnquist. Strategies for improving reliability of bus transit service [J]. Transportation Research Record,1981,(818):7-13
[110]M. A. Turnquist, L. A. Bowman. The effects of network structure on reliability of transit service [J]. Transportation Research Part B:Methodological,1980,14(1-2):79-86
[111]M. Abkowitz, I. Engelstein. Methods for maintaining transit service regularity, No. NY-06-0097 Final Rpt.[R].:Rensselaer Polytechnic Institute Urban Mass Transportation Administration,1984
[112]Seoul metropolitan city. Survey report of bus service quality[R]. Seoul metropolitan city, Korea,2003
[113]J. Park, S. Kho. A New Method to Determine Level-of-Service Criteria for Headway Adherence [C]. TRB 85th Annual Meeting. Washington DC, USA:2006
[114]J. G. Strathman, K. J. Dueker, T. Kimpel, et al. Automated Bus Dispatching, Operations Control, and Service Reliability:Baseline Analysis [J]. Transportation Research Record: Journal of the Transportation Research Board,1999,#1666:28-36
[115]M. A. Turnquist. A model for investigating the effects of service frequency and reliability on bus passenger waiting times [J]. Transportation Research Record:Journal of the Transportation Research Board,1978,#663:70-73
[116]H. S. Levinson. The Reliability of Transit Service:An historical Perspective [J]. Journal of Urban Technology,2005,12(1):99-118
[117]N. V. Oort, R. V. Nes. Reliability of urban public transport and strategic and tactical planning, a first analysis [C]. TRAIL conference 2006 proceedings. Rotterdam:2006
[118]L. C. Cham. Understanding bus service reliability:a practical framework using AVL/APC data [Dissertation]. Cambridge, Massachusetts, USA:Massachusetts Institute Of Technology, 2006
[119]毛林繁.城市公交网络可靠性的双层规划模型[J].中国公路学报,2002,15(3)：88-91
[120]刘锐,严宝杰,黄志鹏等.可靠性理论在公交网络分析中的应用[J].公路交通科技,2008,25(4)：122-126
[121]戴帅,陈艳艳,荣建等.公共交通系统的可靠度研究[J].北京工业大学学报,2006,32(9)：813-816
[122]高桂凤,魏华,严宝杰.城市公交服务质量可靠性评价研究[J].武汉理工大学学报(交通科学与工程版),2007,31(1)：140-143
[123]魏华.城市公交服务质量与可靠性评价研究[学位论文].长安大学,2005
[124]赵航,宋瑞.公共交通系统营运可靠性研究[J].公路交通科技,2005,22(10)：132-135
[125]衡玉明.城市公交网络可靠性研究[学位论文].北京交通大学,2006
[126]张宇石.大城市常规公共交通运行可靠性的研究与实例评价[学位论文].北京交通大学,2008
[127]X. Chen, L. Yu, Y. Zhang, et al. Analyzing urban bus service reliability at the stop, route, and network levels [J]. Transportation Research Part A:Policy and Practice,2009,43(8):722-734
[128]宋晓梅,于雷.影响公交运行可靠性的因素分析及改善措施[J].综合运输,2009,(3)：59-62
[129]李夏苗.现代铁路货物运输组织理论研究[学位论文].北京：北京交通大学,2002
[130]李夏苗,卢红岩.快运货物列车编组方案的优化[J].中国铁道科学,2004,25(2)：117-120
[131]李夏苗.保证铁路货物及时送达的运输组织技术的研究[R].长沙,2002
[132]李夏苗,胡思继,朱晓立.直达货物运输按时送达可靠性的评估方法[J].中国铁道科学,2003,24(1)：123-126
[133]谢建光,谢如鹤.铁路货物运输的随机过程分析和及时送达概率估计[J].铁道学报,2006,28(1)：19-21
[134]董晓岩.基于可靠性品质的快运产品设计问题的研究[学位论文].北京交通大学,2011
[135]阳建鸣,戴贤春,祝继常.面向旅客服务的现代铁路综合信息系统[J].中国铁路,2003,(3)：27-32
[136]A. Goodall. Railway route planning in Australia [J]. Data Processing,1986,28(3):136-138
[137]Z. Peng, R. Huang. Design and development of interactive trip planning for web-based transit information systems [J]. Transportation Research Part C:Emerging Technologies,2000, 8(1-6):409-425
[138]M. Lehmuskoski. Mobile Internet in Helsinki Public Transport [J]. Public Transport International,2007,56(1):32-33
[139]Sabre(?) Global Distribution System. http://www.sabre.com
[140]Amadeus Bookings System. http://www.amadeus.net
[141]Galileo, http://www.travelport.com/lob/gds/galileo.aspx
[142]easyJet Airline. http://www.easyjet.com
[143]英国铁路(National Rail Enquiries) http://www.nationalrail.co.uk
[144]德国铁路股份公司(Deutsche Bahn AG). http://www.deutschebahn.com/site/bahn/en/start.html
[145]Yahoo Travel. http://travel.yahoo.com
[146]Kayak. http://www.kayak.com
[147]J. L. Adlera, B. Victor J. Blue. Toward the design of intelligent traveler information systems [J]. Transportation Research Part C:Emerging Technologies,1998,6(3):157-172
[148]林澜,闫春钢,蒋昌俊等.动态网络最短路问题的复杂性与近似算法[J].计算机学报,2007,30(4)：608-614
[149]王庆平,张兴芳,宋颖等.城市公交换乘的数学模型及其算法实现[J].计算机工程与应用,2008,44(7)：246-248
[150]A. Lozano, G. Storchi. Shortest viable hyperpath in multimodal networks [J]. Transportation Research Part B:Methodological,2002,36(10):853-874
[151]陈绍宽,彭宏勤,刘爽等.综合运输网络多方式分层分配模型研究[J].交通运输系统工程与信息,2009,9(6)：130-135
[152]G. B. Dantzig, D. R. Fulkerson, S. M. Johnson. On a linear-programming, combinatorial approach to the traveling-salesman problem [J]. Operations Research,1959,7(1):58-66
[153]G. B. Dantzig, J. H. Ramser. The truck dispatching problem [J]. Management science,1959, 6(1):80-91
[154]罗钧韶,靳文舟,魏明.基于驾驶员偏好的最优路径选择方法[J].公路与汽运,2011,(6)：58-60
[155]韦增欣,陈进来,罗朝晖.基于驾驶员偏好的最优路径选择[J].交通运输系统工程与信息,2010,10(6)：141-144
[156]Y. Iida, H. Wakabayashi. An approximation method of terminal reliability of road network using partial minimal path and cut sets [C]. Transport Policy, Management & Technology Towards 2001:Selected Proceedings of the Fifth World Conference on Transport Research. 1989
[157]冯琰,毕俊.多类型交通系统中的路径分析算法研究[C].中国地理信息系统协会第八届年会.中国地理信息系统协会第八届年会论文集.北京：科学出版社,2004：59-63
[158]T. G. Crainic, J. Rousseau. Multicommodity, multimode freight transportation:A general modeling and algorithmic framework for the service network design problem [J]. Transportation Research Part B:Methodological,1986,20(3):225-242
[159]T. G. Crainic. Service network design in freight transportation [J]. European Journal of Operational Research,2000,122(2):272-288
[160]许红,龙昭,马建军等.客运专线枢纽旅客衔接方案模型与计算方法的研究[J].北京交通大学学报(自然科学版),2008,32(3)：1-5
[161]王爽.快速客运网旅客列车开行方案编制理论与方法研究[学位论文].北京：北京交通大学,2010
[162]赵长江,李群仁.我国铁路快速客运网规划调整研究[J].铁道运输与经济,2007,29(12)：1-5
[163]王爽,赵鹏,刘晨光.客运节点等级划分方法及列车开行方案求解策略研究[J].铁道学报,2011,33(3)：1-8
[164]林冬梅,刘军.限制网络上的铁路旅程规划快速求解算法[J].铁道学报,2013,35(2)：8-13
[165]江志彬.基于列车运行图的城市轨道交通运营可靠性研究[学位论文].上海：同济大学,2007
[166]魏鹏,夏利华.行车准点率与RAMS可靠性的相关性[J].都市快轨交通,2010,23(1)：67-70
[167]王炜,陈学武.城市交通系统可持续发展理论体系研究[M].北京：科学出版社,2004
[168]A. Kanafani. Transportation demand analysis [M]. New York:McGraw-Hill,1983
[169]郭孜政.铁路客流预测方法研究[学位论文].西南交通大学,2005
[170]刘强.基于复杂系统的铁路客流预测方法研究[学位论文].中国铁道科学研究院,2008
[171]徐意,田长海,方琪根.以客运为主单线铁路通过能力计算方法[J].中国铁道科学,2003,24(4)：128-130
[172]梁栋,肖睿,赵颖.铁路运输能力计算理论方法改进研究[J].铁道经济研究,2011,(6)：1-4,8
[173]周黎,张超,胡思继.线路运输能力计算方法及其在京广线能力计算中的应用[J].北京交通大学学报,2006,30(6)：32-35
[174]李晓俊.面向多趟旅客列车的票额预分优化方法研究[学位论文].北京：北京交通大学,2012
[175]宋超.旅客列车的票额分配[J].中国铁路,2005,(8)：63-64
[176]冯飞.铁路客票发售和预订系统票额分配研究[J].铁道运输与经济,2009,31(7)：88-91
[2]陈丽佳.基于公交网络模型的最优路径算法研究与实现[学位论文].长沙：中南大学,2009
[3]L. R. Ford Jr., D. R. Fulkerson. Flows in Networks [M]. Princeton, NJ, USA:Princeton University Press,1962
[4]L. R. Ford. Network Flow Theory [M]. Santa Monica, CA:RAND Corporation,1956
[5]R. Bellman. On a routing problem [J]. Quarterly of Applied Mathematics,1958,16(1):87-90
[6]P. E. Hart, N. J. Nilsson, B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths [J]. IEEE Transactions on Systems Science and Cybernetics,1968,4(2): 100-107
[7]U. Pape. Implementation and efficiency of Moore-algorithms for the shortest route problem [J]. Mathematical Programming,1974,7(1):212-222
[8]D. P. Bertsekas. Network optimization:continuous and discrete models [M]. Nashua, NH, USA:Athena Scientific,1998:51-114
[9]陆锋.最短路径算法：分类体系与研究进展[J].测绘学报,2001,30(3)：269-275
[10]L. Marton. A label-setting algorithm for calculating shortest path trees in sparse networks [J]. Hungarian Electronic Journal of Sciences,2000,19(2):115-132
[11]D. Delling, P. Sanders, D. Schultes, et al. Engineering Route Planning Algorithms [M]. Algorithmics of Large and Complex Networks, Lerner J. U. Rgen, Wagner Dorothea, Zweig Katharina A., Berlin, Heidelberg:Springer-Verlag,2009:117-139
[12]D. Delling. Engineering and Augmenting Route Planning Algorithms [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2009
[13]D. Schieferdecker. Systematic Combination of Speed-Up Techniques for exact Shortest-Path Queries [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2008
[14]G. B. Dantzig. Linear Programming and Extensions [M]. Princeton, NJ, USA:Princeton University Press,1963
[15]A. V. Goldberg, C. Harrelson. Computing the shortest path:A* search meets graph theory [C]. SODA'05. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA:Society for Industrial and Applied Mathematics, 2005:156-165
[16]G. Nannicini, D. Delling, L. Liberti, et al. Bidirectional A* search for time-dependent fast paths [C]. the 7th international conference on Experimental algorithms(WEA'08). Lecture Notes in Computer Science. Provincetown, MA, USA:Springer-Verlag,2008:334-346
[17]A. V. Goldberg, R. F. F. Werneck. Computing Point-to-Point Shortest Paths from External Memory [C]. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005). Vancouver, BC, Canada:SIAM,2005:26-40
[18]R. Bauer, D. Delling, D. Wagner. Experimental study of speed-up techniques for timetable information systems [J]. Networks,2011,57(1):38-52
[19]D. Delling, D. Wagner. Landmark-based routing in dynamic graphs [C]. the 6th international conference on Experimental algorithms(WEA'07). Lecture Notes in Computer Science. Rome, Italy:Springer-Verlag,2007:52-65
[20]D. Wagner, T. Willhalm. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs [C]. The 11th European Symposium on Algorithms. Lecture Notes in Computer Science. Budapest, Hungary:Springer-Verlag,2003:776-788
[21]D. Wagner, T. Willhalm, C. Zaroliagis. Geometric containers for efficient shortest-path computation [J]. ACM Journal of Experimental Algorithmics,2005,10:1-3
[22]M. Holzer, F. Schulz, D. Wagner, et al. Combining speed-up techniques for shortest-path computations [J]. ACM Journal of Experimental Algorithmics,2005,10:2-5
[23]D. Wagner, T. Willhalm, C. Zaroliagis. Dynamic Shortest Paths Containers [J]. Electronic Notes in Theoretical Computer Science,2004,92:65-84
[24]宋青,汪小帆.最短路径算法加速技术研究综述[J].电子科技大学学报,2012,41(2)：176-184
[25]U. Lauther. An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background [J]. In Geoinformation und Mobilitat--von der Forschung zur praktischen Anwendung,2004,22:219-230
[26]B. Monien, S. Schamberger. Graph partitioning with the Party library:helpful-sets in practice [C]. SB AC-PAD 2004 the 16th Symposium on Computer Architecture and High Performance Computing. Foz do Iguacu, PR, Brazil:2004:198-205
[27]E. Kohler, R. Mohring, H. Schilling. Acceleration of Shortest Path and Constrained Shortest Path Computation [C].4th International Workshop(WEA'05). Lecture Notes in Computer Science. Santorini Island, Greece:Springer-Verlag,2005:126-138
[28]F. Pellegrini. SCOTCH:Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package [Z].2007: http://www.labri.fr/perso/pelegrin/scotch/
[29]G. Karypis, V. Kumar. METIS-Serial Graph Partitioning and Fill-reducing Matrix Ordering [Z].2011:http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
[30]R. H. Mohring, H. Schilling, B. Schutz, et al. Partitioning Graphs to Speed Up Dijkstra's Algorithm [C]. the 4th International Workshop(WEA'05). Lecture Notes in Computer Science. Santorini Island, Greece:Springer-Verlag,2005:273-283
[31]E. Kohler, R. H. Mohring, H. Schilling. Fast point-to-point shortest path computations with arc-flags [C].9th DIM ACS Implementaion Challenge.2006
[32]J. L. Bander, C. C. I. White. A heuristic search algorithm for path determination with learning [J]. IEEE Transactions on Systems, Man and Cybernetics Part A:Systems and Humans,1998, 28(1):131-134
[33]P. Sanders, D. Schultes. Highway Hierarchies Hasten Exact Shortest Path Queries [C]. the 13th Annual European Symposium on Algorithms(ESA'05). Lecture Notes in Computer Science. Mallorca, Spain:Springer-Verlag,2005:568-579
[34]P. Sanders, D. Schultes. Engineering highway hierarchies [C]. the 14th Annual European Symposium on Algorithms(ESA'06). Lecture Notes in Computer Science. Zurich, Switzerland: Springer-Verlag,2006:804-816
[35]R. Geisberger. Contraction Hierarchies [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2008
[36]R. Geisberger, P. Sanders, D. Schultes, et al. Contraction Hierarchies:Faster and Simpler Hierarchical Routing in Road Networks [C]. the 7th international conference on Experimental algorithms(WEA'08). Lecture Notes in Computer Science. Provincetown, MA, USA: Springer-Verlag,2008:319-333
[37]陆锋,周成虎,万庆.基于层次空间推理的交通网络行车最优路径算法[J].武汉测绘科技大学学报,2000,25(3)：226-232
[38]付梦印,李杰,邓志红.限制搜索区域的分层路径规划算法[J].计算机辅助设计与图形学学报,2005,17(8)：1773-1777
[39]汤筠筠,张代胜,陈朝阳.公交出行查询系统中出行路径选择模型的研究[J].合肥工业大学学报(自然科学版),2004,27(10)：1227-1230
[40]翁敏,毋河海,杜清运等.基于公交网络模型的最优出行路径选择的研究[J].武汉大学学报(信息科学版),2004,29(6)：500-503
[41]赵巧霞,马志强,张发.以最小换乘次数和站数为目标的公交出行算法[J].计算机应用,2004,24(12)：136-137,146
[42]陈琛.城市公共交通换乘系统研究[学位论文].南京：东南大学,2004
[43]汪江洪.公交换乘系统研究及其评价[学位论文].成都：西南交通大学,2006
[44]张玉春,韩秀华,臧雪柏.基于双向搜索的公交路径选择算法及优化模型[J].吉林大学学报(信息科学版),2009,27(6)：579-584
[45]陈小辉.公交网络最优路径选择算法研究[J].科学技术与工程,2009,9(11)：3141-3143,3161
[46]赵敏.公交换乘系统的算法研究与应用[学位论文].太原：中北大学,2009
[47]C. Liu. Best-path planning for public transportation systems [C]. The IEEE 5th International Conference on Intelligent Transportation Systems(ITSC2002). Singapore:2002:834-839
[48]F. Schulz, D. Wagner, K. Weihe. Dijkstra's Algorithm On-Line:An Empirical Case Study from Public Railroad Transport [C]. The 3rd International Workshop on Algorithm Engineering (WAE'99). Lecture Notes in Computer Science. London, UK:Springer, 1999:110-123
[49]E. Pyrga, F. Schulz, D. Wagner, et al. Experimental comparison of shortest path approaches for timetable information [C]. the 6th Workshop on Algorithm Engineering and Experiments(ALENEX'O4). New Orleans. LA, USA:SIAM,2004:88-99
[50]F. Schulz. Timetable information and shortest paths [Dissertation]. Karlsruhe, Germany: Universitat Karlsruhe,2005
[51]D. Delling, T. Pajor, D. Wagner. Engineering Time-Expanded Graphs for Faster Timetable Information [C].8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems(ATMOS'08). Lecture Notes in Computer Science. Universitat Karlsruhe, Germany:Springer-Verlag,2008:182-206
[52]M. Muller-Hannemann, F. Schulz, D. Wagner, et al. Timetable Information:Models and Algorithms [C].4th Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS'04). Lecture Notes In Computer Science. Bergen, Norway: Springer-Verlag,2004:67-90
[53]E. Pyrga, F. Schulz, D. Wagner, et al. Efficient models for timetable information in public transportation systems [J]. ACM Journal of Experimental Algorithmics,2008,12:2-4
[54]A. Orda, R. Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length [J]. Journal of ACM,1990,37(3):607-625
[55]S. C. Wong, C.O. Tong. Estimation of time-dependent origin-destination matrices for transit networks [J]. Transportation Research Part B:Methodological,1998,32(1):35-48
[56]R. F. Casey, L. N. Labell, E. J. Carpenter, et al. Advanced public transportation systems:the state of the art update, DOT-VNTSC-FTA-97-9[R]. Washington, DC:US Department of Transportation,1998
[57]M. E. T. Horn. An extended model and procedural framework for planning multi-modal passenger journeys [J]. Transportation Research Part B:Methodological,2003,37(7): 641-660
[58]陈丽佳.基于公交网络模型的最优路径算法研究与实现[学位论文].中南大学,2009
[59]S. Chien, Z. Yang, E. Hou. Genetic Algorithm Approach for Transit Route Planning and Design [J]. Journal of Transportation Engineering,2001,127(3):200-207
[60]师桂兰,邓卫,葛亮.基于平均换乘的城市公交线网性能评价[J].洛阳大学学报,2003,18(4)：26-31
[61]傅冬绵.交通系统中最少换乘算法及其实现[J].华侨大学学报(自然科学版),2001,22(4)：348-350
[62]M. Milller-Hannemann, K. Weihe. Pareto Shortest Paths is Often Feasible in Practice [C]. the 5th International Workshop on Algorithm Engineering(WEA'01). Lecture Notes in Computer Science. Arhus, Denmark:Springer,2001:185-197
[63]M. Muller-Hannemann, M. Schnee. Finding All Attractive Train Connections by Multi-criteria Pareto Search [C].4th International Workshop on Algorithmic Methods and Models for Optimization of Railways(ATMOS'04). Lecture Notes in Computer Science. Bergen, Norway:Springer,2007:246-263
[64]Y. Disser, M. Miiller Hannemann, M. Schnee. Multi-criteria Shortest Paths in Time-Dependent Train Networks [C].7th International Workshop on Experimental Algorithms(WEA'08). Lecture Notes in Computer Science. Provincetown, MA, USA: Springer,2008:347-361
[65]唐学燕.客运中转径路优化模型与算法研究[学位论文].成都：西南交通大学,2011
[66]齐玉杰,陈光伟.铁路客运经由计算[J].铁路计算机应用,1997,6(6)：39-41
[67]王华,季令.我国铁路客运合理径路选择的研究[J].上海铁道大学学报,1999,20(4)：51-54
[68]王华,季令.中转换乘经由在我国铁路客票系统中的应用[J].中国铁路,1998,(3)：28-30
[69]史峰,马钧培,向联慧等.客运中转径路的换乘模型及算法[J].铁道学报,1999,21(5)：1-4
[70]成惠.铁路运输特定经由算法的研究与实现[学位论文].长沙：中南大学,2007
[71]吕晓艳,刘春煌,单杏花等.基于车次径路约束下的客运径路生成算法优化[J].中国铁道科学,2007,28(3)：122-125
[72]吕晓艳,刘春煌,朱建生等.铁路客运中转径路计算模型研究[J].铁道运输与经济,2007,29(5)：75-77,80
[73]张彦.铁路客票中转换乘多径路选择问题的研究[J].铁道运输与经济,1997,19(8)：12-14
[74]王华.我国铁路客票系统和客运径路的研究[学位论文].上海：上海铁道大学,1997
[75]史峰,邓连波.旅客换乘网络优化设计[J].铁道科学与工程学报,2004,1(1)：78-82
[76]余震江.基于最短路径Dijkstra算法的铁路客运中转径路优化研究[学位论文].重庆大学,2008
[77]崔炳谋,马钧培,陈光伟等.铁路旅客旅行换乘方案优选算法[J].中国铁道科学,2007,28(6)：122-127
[78]刘兰芬,倪晓宇.铁路客运中转换乘模型的遗传算法研究[J].铁道运输与经济,2006,28(2)：86-89
[79]江南,史峰,卢红岩等.铁路旅客乘车方案优化决策模型研究[J].铁道学报,2007,29(3)：13-18
[80]杨淮清,薛明昊,余冠华.一种面向中转换乘的铁路网建模方法研究[J].计算机技术与发展,2010,20(4)：211-214,219
[81]于澎,朱建生.基于人工神经网络的铁路客票系统中转路径选取研究[J].铁道运输与经济,2010,32(3)：42-46
[82]董晓岩,刘军,季常煦.基于多种运输方式的行包快捷货物运输网络模型的设计与研究[J].物流技术,2006,(10)：36-39
[83]李先进.铁路行包运输组织方法及其优化研究[学位论文].北京交通大学,2007
[84]朱晔,田宁,杨东援等.铁路行包运输径路算法[J].中国铁道科学,2008,29(6)：111-115
[85]张瑞芬.铁路行包运营管理系统里程计算模块的设计与实现[学位论文].内蒙古大学,2009
[86]朱晔,田宁,杨东援等.铁路行包运输方案编制模型研究[J].铁道学报,2009,31(4)：20-24
[87]T. Pajor. Multi-Modal Route Planning [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2009
[88]C. Barrett, K. Bisset, M. Holzer, et al. Engineering Label-Constrained Shortest-Path Algorithms [C]. the 4th international conference on Algorithmic Aspects in Information and Management(AAIM'08). Lecture Notes in Computer Science. Shanghai, China: Springer-Verlag,2008:27-37
[89]C. Barrett, R. Jacob, M. Marathe. Formal-Language-Constrained Path Problems [J]. SIAM Journal on Computing,2000,30(3):809-837
[90]C. Barrett, K. Bisset, R. Jacob, et al. Classical and Contemporary Shortest Path Problems in Road Networks:Implementation and Experimental Analysis of the TRANSIMS Router [C]. 10th Annual European Symposium on Algorithms(ESA'02). Proceedings of the 10th Annual European Symposium on Algorithms. London, UK:Springer-Verlag,2002:126-138
[91]M. Holzer. Engineering Planar-Separator and Shortest-Path Algorithms [Dissertation]. Karlsruhe, Germany:Universitat Karlsruhe,2008
[92]H. Yu, F. Lu. A Multi-Modal Route Planning Approach with an Improved Genetic Algorithm [C]. Joint International Conference on Theory, Data Handling and Modelling in GeoSpatial Information Science. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences Volume 38, Part 2. Hong Kong:2010:343-348
[93]R. Sedgewick, J. Vitter. Shortest paths in euclidean graphs [J]. Algorithmica,1986,1:31-48
[94]Y. Yin, W. H. K. Lam, H. Ieda. Reliability assessment on transit network services [C]. The 1st International Symposium on Transportation Network Reliability. The network reliability of transport:proceedings of the 1st International Symposium on Transportation Network Reliability (INSTR). Kyoto, Japan:Pergamon,2003:119-132
[95]A. Rudnicki. Investigation by Computer Simulation-some aspect of transportation service reliability in urban public transport [C]. the 14th International Conference on the Applications of Computer Science and Mathematics in Architecture and Civil Engineering. Bauhaus University Weimar:1997
[96]M. H, K. H. Mathematics for Reliability Analysis [M]. Tokyo, Japan:Asakura-shoten,1982
[97]饭田恭敬.交通工程学[M].北京：人民交通出版社,1994
[98]A. Chen, H. Yang, H. K. Lo, et al. Capacity reliability of a road network:an assessment methodology and numerical results [J]. Transportation Research Part B:Methodological,2002, 36(3):225-252
[99]Y. Asakura, M. Kashiwadani. Road network reliability caused by daily fluctuation of traffic flow [C].19th PTRC Summer Annual Meeting, Seminar G. University of Sussex, England: 1991:73-84
[100]Y. Asakura. Reliability measures of an Origin and Destination Pair in a Deteriorated Road Network with Variable Flows [C]. the 4th Meeting of the Euro Working Group on Transportation. Transportation Networks:Recent Methodological Advances:Selected Proceedings of the 4th EURO Transportation Meeting. New Caste upon Tyne, UK:Pergamon, 1996:273-287
[101]熊志华.道路网行程时间可靠性基础理论与方法研究[学位论文].北京交通大学,2006
[102]陆奇志.公共交通运行时间可靠性评价方法研究[学位论文].新疆农业大学,2006
[103]陆奇志,艾力·斯木吐拉.基于Matlab仿真的公交系统运行时间可靠性评价方法[J].城市交通,2006,4(4)：70-75
[104]范海雁,杨晓光,严凌等.蒙特卡罗法在公交线路运行时间可靠性计算中的应用[J].上海理工大学学报,2006,28(1)：59-62
[105]宋晓梅.常规公交网络运行可靠性多层次评价模型与算法[学位论文].北京：北京交通大学,2010
[106]B. P. Sterman, J. L. Schofer. Factors Affecting Reliability of Urban Bus Services [J]. Transportation Engineering Journal,1976,102(1):147-159
[107]R. A. Chapman. Bus reliability-definition and measurement[R]. Newcastle-Upon-Tyne, Northumberland, England:Transport Operations Group, Newcastle-Upon-Tyne University, 1976
[108]A. Polus. Modeling and measurements of bus service reliability [J]. Transportation Research, 1978,12(4):253-256
[109]M. A. Turnquist. Strategies for improving reliability of bus transit service [J]. Transportation Research Record,1981,(818):7-13
[110]M. A. Turnquist, L. A. Bowman. The effects of network structure on reliability of transit service [J]. Transportation Research Part B:Methodological,1980,14(1-2):79-86
[111]M. Abkowitz, I. Engelstein. Methods for maintaining transit service regularity, No. NY-06-0097 Final Rpt.[R].:Rensselaer Polytechnic Institute Urban Mass Transportation Administration,1984
[112]Seoul metropolitan city. Survey report of bus service quality[R]. Seoul metropolitan city, Korea,2003
[113]J. Park, S. Kho. A New Method to Determine Level-of-Service Criteria for Headway Adherence [C]. TRB 85th Annual Meeting. Washington DC, USA:2006
[114]J. G. Strathman, K. J. Dueker, T. Kimpel, et al. Automated Bus Dispatching, Operations Control, and Service Reliability:Baseline Analysis [J]. Transportation Research Record: Journal of the Transportation Research Board,1999,#1666:28-36
[115]M. A. Turnquist. A model for investigating the effects of service frequency and reliability on bus passenger waiting times [J]. Transportation Research Record:Journal of the Transportation Research Board,1978,#663:70-73
[116]H. S. Levinson. The Reliability of Transit Service:An historical Perspective [J]. Journal of Urban Technology,2005,12(1):99-118
[117]N. V. Oort, R. V. Nes. Reliability of urban public transport and strategic and tactical planning, a first analysis [C]. TRAIL conference 2006 proceedings. Rotterdam:2006
[118]L. C. Cham. Understanding bus service reliability:a practical framework using AVL/APC data [Dissertation]. Cambridge, Massachusetts, USA:Massachusetts Institute Of Technology, 2006
[119]毛林繁.城市公交网络可靠性的双层规划模型[J].中国公路学报,2002,15(3)：88-91
[120]刘锐,严宝杰,黄志鹏等.可靠性理论在公交网络分析中的应用[J].公路交通科技,2008,25(4)：122-126
[121]戴帅,陈艳艳,荣建等.公共交通系统的可靠度研究[J].北京工业大学学报,2006,32(9)：813-816
[122]高桂凤,魏华,严宝杰.城市公交服务质量可靠性评价研究[J].武汉理工大学学报(交通科学与工程版),2007,31(1)：140-143
[123]魏华.城市公交服务质量与可靠性评价研究[学位论文].长安大学,2005
[124]赵航,宋瑞.公共交通系统营运可靠性研究[J].公路交通科技,2005,22(10)：132-135
[125]衡玉明.城市公交网络可靠性研究[学位论文].北京交通大学,2006
[126]张宇石.大城市常规公共交通运行可靠性的研究与实例评价[学位论文].北京交通大学,2008
[127]X. Chen, L. Yu, Y. Zhang, et al. Analyzing urban bus service reliability at the stop, route, and network levels [J]. Transportation Research Part A:Policy and Practice,2009,43(8):722-734
[128]宋晓梅,于雷.影响公交运行可靠性的因素分析及改善措施[J].综合运输,2009,(3)：59-62
[129]李夏苗.现代铁路货物运输组织理论研究[学位论文].北京：北京交通大学,2002
[130]李夏苗,卢红岩.快运货物列车编组方案的优化[J].中国铁道科学,2004,25(2)：117-120
[131]李夏苗.保证铁路货物及时送达的运输组织技术的研究[R].长沙,2002
[132]李夏苗,胡思继,朱晓立.直达货物运输按时送达可靠性的评估方法[J].中国铁道科学,2003,24(1)：123-126
[133]谢建光,谢如鹤.铁路货物运输的随机过程分析和及时送达概率估计[J].铁道学报,2006,28(1)：19-21
[134]董晓岩.基于可靠性品质的快运产品设计问题的研究[学位论文].北京交通大学,2011
[135]阳建鸣,戴贤春,祝继常.面向旅客服务的现代铁路综合信息系统[J].中国铁路,2003,(3)：27-32
[136]A. Goodall. Railway route planning in Australia [J]. Data Processing,1986,28(3):136-138
[137]Z. Peng, R. Huang. Design and development of interactive trip planning for web-based transit information systems [J]. Transportation Research Part C:Emerging Technologies,2000, 8(1-6):409-425
[138]M. Lehmuskoski. Mobile Internet in Helsinki Public Transport [J]. Public Transport International,2007,56(1):32-33
[139]Sabre(?) Global Distribution System. http://www.sabre.com
[140]Amadeus Bookings System. http://www.amadeus.net
[141]Galileo, http://www.travelport.com/lob/gds/galileo.aspx
[142]easyJet Airline. http://www.easyjet.com
[143]英国铁路(National Rail Enquiries) http://www.nationalrail.co.uk
[144]德国铁路股份公司(Deutsche Bahn AG). http://www.deutschebahn.com/site/bahn/en/start.html
[145]Yahoo Travel. http://travel.yahoo.com
[146]Kayak. http://www.kayak.com
[147]J. L. Adlera, B. Victor J. Blue. Toward the design of intelligent traveler information systems [J]. Transportation Research Part C:Emerging Technologies,1998,6(3):157-172
[148]林澜,闫春钢,蒋昌俊等.动态网络最短路问题的复杂性与近似算法[J].计算机学报,2007,30(4)：608-614
[149]王庆平,张兴芳,宋颖等.城市公交换乘的数学模型及其算法实现[J].计算机工程与应用,2008,44(7)：246-248
[150]A. Lozano, G. Storchi. Shortest viable hyperpath in multimodal networks [J]. Transportation Research Part B:Methodological,2002,36(10):853-874
[151]陈绍宽,彭宏勤,刘爽等.综合运输网络多方式分层分配模型研究[J].交通运输系统工程与信息,2009,9(6)：130-135
[152]G. B. Dantzig, D. R. Fulkerson, S. M. Johnson. On a linear-programming, combinatorial approach to the traveling-salesman problem [J]. Operations Research,1959,7(1):58-66
[153]G. B. Dantzig, J. H. Ramser. The truck dispatching problem [J]. Management science,1959, 6(1):80-91
[154]罗钧韶,靳文舟,魏明.基于驾驶员偏好的最优路径选择方法[J].公路与汽运,2011,(6)：58-60
[155]韦增欣,陈进来,罗朝晖.基于驾驶员偏好的最优路径选择[J].交通运输系统工程与信息,2010,10(6)：141-144
[156]Y. Iida, H. Wakabayashi. An approximation method of terminal reliability of road network using partial minimal path and cut sets [C]. Transport Policy, Management & Technology Towards 2001:Selected Proceedings of the Fifth World Conference on Transport Research. 1989
[157]冯琰,毕俊.多类型交通系统中的路径分析算法研究[C].中国地理信息系统协会第八届年会.中国地理信息系统协会第八届年会论文集.北京：科学出版社,2004：59-63
[158]T. G. Crainic, J. Rousseau. Multicommodity, multimode freight transportation:A general modeling and algorithmic framework for the service network design problem [J]. Transportation Research Part B:Methodological,1986,20(3):225-242
[159]T. G. Crainic. Service network design in freight transportation [J]. European Journal of Operational Research,2000,122(2):272-288
[160]许红,龙昭,马建军等.客运专线枢纽旅客衔接方案模型与计算方法的研究[J].北京交通大学学报(自然科学版),2008,32(3)：1-5
[161]王爽.快速客运网旅客列车开行方案编制理论与方法研究[学位论文].北京：北京交通大学,2010
[162]赵长江,李群仁.我国铁路快速客运网规划调整研究[J].铁道运输与经济,2007,29(12)：1-5
[163]王爽,赵鹏,刘晨光.客运节点等级划分方法及列车开行方案求解策略研究[J].铁道学报,2011,33(3)：1-8
[164]林冬梅,刘军.限制网络上的铁路旅程规划快速求解算法[J].铁道学报,2013,35(2)：8-13
[165]江志彬.基于列车运行图的城市轨道交通运营可靠性研究[学位论文].上海：同济大学,2007
[166]魏鹏,夏利华.行车准点率与RAMS可靠性的相关性[J].都市快轨交通,2010,23(1)：67-70
[167]王炜,陈学武.城市交通系统可持续发展理论体系研究[M].北京：科学出版社,2004
[168]A. Kanafani. Transportation demand analysis [M]. New York:McGraw-Hill,1983
[169]郭孜政.铁路客流预测方法研究[学位论文].西南交通大学,2005
[170]刘强.基于复杂系统的铁路客流预测方法研究[学位论文].中国铁道科学研究院,2008
[171]徐意,田长海,方琪根.以客运为主单线铁路通过能力计算方法[J].中国铁道科学,2003,24(4)：128-130
[172]梁栋,肖睿,赵颖.铁路运输能力计算理论方法改进研究[J].铁道经济研究,2011,(6)：1-4,8
[173]周黎,张超,胡思继.线路运输能力计算方法及其在京广线能力计算中的应用[J].北京交通大学学报,2006,30(6)：32-35
[174]李晓俊.面向多趟旅客列车的票额预分优化方法研究[学位论文].北京：北京交通大学,2012
[175]宋超.旅客列车的票额分配[J].中国铁路,2005,(8)：63-64
[176]冯飞.铁路客票发售和预订系统票额分配研究[J].铁道运输与经济,2009,31(7)：88-91