城市轨道交通新线投入运营下常规公交线网优化调整方法研究
|
摘要
为了解决大城市的交通拥堵问题,我国大城市纷纷建设或规划了轨道交通网络。构建合理的轨道与常规公交一体化网络,是充分发挥公交运力资源配置、提高公交服务水平的关键。由于轨道交通线路的建设具有时序性,在实际中通常配合轨道交通新线,规划常规公交网络的优化调整方案。本文着重研究轨道交通新线投入运营下常规公交线网的优化调整方法,所做的工作主要包含以下六个部分：
(1)研究了基于轨道交通新线的常规公交网络特性。在比较轨道交通与常规公交特性的基础上,从与轨道交通线路的竞争与合作关系、空间拓扑结构关系、一体化功能关系给出了常规公交线路的分类与特性,并分析了轨道与接运公交-体化网络、轨道与常规公交一体化网络的特性。
(2)研究了轨道交通新线投入运营下常规公交网络优化调整的特性。从城市的发展、出行者的需求、公共交通系统的供给的角度分析了影响常规公交网络优化调整的因素。给出了常规公交网络与线路优化调整的整体原则。分析了常规公交线路与网络的优化调整策略。
(3)研究了公交一体化下常规公交候选线路生成的启发式算法。在给定被接运服务的轨道交通车站的条件下,提出了接运公交候选线路生成的启发式算法。针对轨道与常规公交一体化网络,以与轨道交通新线的空间拓扑结构关系为基础,给出了既有常规公交候选线路生成的启发式算法；以与轨道交通新线的一体化功能关系为基础,给出了新建常规公交候选线路生成的启发式算法。
(4)将为轨道交通车站集散客流服务的接运公交网络作为研究对象,以轨道交通车站的集散量为输入条件,提出了接运公交网络的设计方法。考虑接运公交网络服务的需求与接运公交供给密切相关、接运公交时刻表与轨道交通到站时间的优化衔接,同时优化接运公交线路与时刻表,构建了接运公交网络设计的多目标规划模型。设计了遗传-变邻域搜索算法,利用产生式方法求解模型的Pareto解集。采用算例对提出的模型与算法进行了验证。
(5)以轨道与常规公交一体化网络为研究对象,以一体化网络的性能优化为研究目标,提出了基于轨道交通新线的常规公交网络的优化调整方法。以公交网络有效服务的乘客量最大化、轨道交通客流量最大化、乘客平均公交成本最小化、运营成本最小化、车辆使用规模最小化为目标,提出了常规公交网络的优化调整模型。模型不仅优化调整常规公交线路的走向,而且优化调整线路的运营参数。在给出公交一体化网络有效路径搜索与网络性能计算的基础上,设计了遗传-变邻域搜索算法求解模型的Pareto解。采用算例对提出的模型与算法进行了验证。
(6)选用郑州轨道交通1号线为背景进行了实例验证,说明了研究的实用价值与意义。
In order to solve the traffic congestion problem, rail transit networks have been planned and constructed in many big cities in China. To construct a reasonable integrated network of rail transit and bus is the key to give full play of transit resource allocation, and to improve transit service quality. Due to the sequential character of rail transit lines construction, in practice, the programme of bus network optimization and adjustment is usually planned in coordination with the new rail transit line. The methodology of bus network optimization and adjustment with new rail transit line in operation is worked on. The following six parts are mainly contained:
(1) The characteristics of bus network are discussed based on new rail transit line. On the basis of comparing the characteristics of rail transit and bus, classification and characteristics of bus lines are analyzed considering the competition and cooperation relation, topological structure relation and function integration relation with rail transit line respectively. In addition, the characteristics of the integrated network of rail transit and feeder bus, of the rail transit and bus are proposed respectively.
(2) The characteristics of bus network optimization and adjustment with new rail transit line under operation are investigated. From the perspective of urban development, travelers'demands, and the supply of the transit system, factors influencing bus network optimization and adjustment are analyzed. The overall principles as well as the optimal strategies of bus network and line optimization and adjustment are proposed.
(3) A heuristic algorithm for generating bus candidate lines is investigated. When a rail station that requires feeder service is given, a heuristic algorithm for generating feeder bus candidate lines of the rail station is proposed. For the integrated network of rail transit and bus, a heuristic algorithm for candidate lines generation of existing bus lines is presented based on topological relationship with the new rail transit line, and a heuristic algorithm for candidate lines generation of new bus lines is also proposed based on integrated function relationship with the new rail transit line.
(4) With the feeder bus network which offers passenger feeder service for rail transit station as the object of study and the feeder demand as input parameter, a methodology of feeder bus network design is proposed. The close relationship between feeder bus supply and the demand for feeder bus network service, the schedule coordination between feeder bus timetable and arrival time of rail transit station are both taken into consideration. A multi-objective programming model for feeder bus network design is proposed to simultaneous optimizes feeder bus route alignment and timetable. Based on genetic algorithm and variable neighborhood search, a genetic-variable neighborhood search algorithm is developed to get Pareto solution set of the model. A numerical example is used to verify the proposed mathematical model and the solution algorithm.
(5) With the integrated network of rail transit and bus network as the object of study and optimizing performance of the integrated network as the goal of study, a methodology is proposed for bus network optimization and adjustment based on new rail transit line. With the objectives of maximizing satisfied transit demand, maximizing rail transit demand, minimizing the average transit user cost, minimizing operation cost and minimizing used fleet size, a multi-objective programming model is formulated for bus network optimization and adjustment. The alignment and operational parameters of bus lines are both optimized by the proposed model. Based on the algorithm for transit efficient path search and computational procedure for integrated network system performance, a genetic-variable neighborhood search algorithm is developed to get Pareto solution set of the proposed model. A numerical example is used to verify the proposed mathematical model and the solution algorithm.
(6) Rail transit line No.1in Zhengzhou taken as the background, a real example is used to verify the practical value and significance of the study.
(1)研究了基于轨道交通新线的常规公交网络特性。在比较轨道交通与常规公交特性的基础上,从与轨道交通线路的竞争与合作关系、空间拓扑结构关系、一体化功能关系给出了常规公交线路的分类与特性,并分析了轨道与接运公交-体化网络、轨道与常规公交一体化网络的特性。
(2)研究了轨道交通新线投入运营下常规公交网络优化调整的特性。从城市的发展、出行者的需求、公共交通系统的供给的角度分析了影响常规公交网络优化调整的因素。给出了常规公交网络与线路优化调整的整体原则。分析了常规公交线路与网络的优化调整策略。
(3)研究了公交一体化下常规公交候选线路生成的启发式算法。在给定被接运服务的轨道交通车站的条件下,提出了接运公交候选线路生成的启发式算法。针对轨道与常规公交一体化网络,以与轨道交通新线的空间拓扑结构关系为基础,给出了既有常规公交候选线路生成的启发式算法；以与轨道交通新线的一体化功能关系为基础,给出了新建常规公交候选线路生成的启发式算法。
(4)将为轨道交通车站集散客流服务的接运公交网络作为研究对象,以轨道交通车站的集散量为输入条件,提出了接运公交网络的设计方法。考虑接运公交网络服务的需求与接运公交供给密切相关、接运公交时刻表与轨道交通到站时间的优化衔接,同时优化接运公交线路与时刻表,构建了接运公交网络设计的多目标规划模型。设计了遗传-变邻域搜索算法,利用产生式方法求解模型的Pareto解集。采用算例对提出的模型与算法进行了验证。
(5)以轨道与常规公交一体化网络为研究对象,以一体化网络的性能优化为研究目标,提出了基于轨道交通新线的常规公交网络的优化调整方法。以公交网络有效服务的乘客量最大化、轨道交通客流量最大化、乘客平均公交成本最小化、运营成本最小化、车辆使用规模最小化为目标,提出了常规公交网络的优化调整模型。模型不仅优化调整常规公交线路的走向,而且优化调整线路的运营参数。在给出公交一体化网络有效路径搜索与网络性能计算的基础上,设计了遗传-变邻域搜索算法求解模型的Pareto解。采用算例对提出的模型与算法进行了验证。
(6)选用郑州轨道交通1号线为背景进行了实例验证,说明了研究的实用价值与意义。
In order to solve the traffic congestion problem, rail transit networks have been planned and constructed in many big cities in China. To construct a reasonable integrated network of rail transit and bus is the key to give full play of transit resource allocation, and to improve transit service quality. Due to the sequential character of rail transit lines construction, in practice, the programme of bus network optimization and adjustment is usually planned in coordination with the new rail transit line. The methodology of bus network optimization and adjustment with new rail transit line in operation is worked on. The following six parts are mainly contained:
(1) The characteristics of bus network are discussed based on new rail transit line. On the basis of comparing the characteristics of rail transit and bus, classification and characteristics of bus lines are analyzed considering the competition and cooperation relation, topological structure relation and function integration relation with rail transit line respectively. In addition, the characteristics of the integrated network of rail transit and feeder bus, of the rail transit and bus are proposed respectively.
(2) The characteristics of bus network optimization and adjustment with new rail transit line under operation are investigated. From the perspective of urban development, travelers'demands, and the supply of the transit system, factors influencing bus network optimization and adjustment are analyzed. The overall principles as well as the optimal strategies of bus network and line optimization and adjustment are proposed.
(3) A heuristic algorithm for generating bus candidate lines is investigated. When a rail station that requires feeder service is given, a heuristic algorithm for generating feeder bus candidate lines of the rail station is proposed. For the integrated network of rail transit and bus, a heuristic algorithm for candidate lines generation of existing bus lines is presented based on topological relationship with the new rail transit line, and a heuristic algorithm for candidate lines generation of new bus lines is also proposed based on integrated function relationship with the new rail transit line.
(4) With the feeder bus network which offers passenger feeder service for rail transit station as the object of study and the feeder demand as input parameter, a methodology of feeder bus network design is proposed. The close relationship between feeder bus supply and the demand for feeder bus network service, the schedule coordination between feeder bus timetable and arrival time of rail transit station are both taken into consideration. A multi-objective programming model for feeder bus network design is proposed to simultaneous optimizes feeder bus route alignment and timetable. Based on genetic algorithm and variable neighborhood search, a genetic-variable neighborhood search algorithm is developed to get Pareto solution set of the model. A numerical example is used to verify the proposed mathematical model and the solution algorithm.
(5) With the integrated network of rail transit and bus network as the object of study and optimizing performance of the integrated network as the goal of study, a methodology is proposed for bus network optimization and adjustment based on new rail transit line. With the objectives of maximizing satisfied transit demand, maximizing rail transit demand, minimizing the average transit user cost, minimizing operation cost and minimizing used fleet size, a multi-objective programming model is formulated for bus network optimization and adjustment. The alignment and operational parameters of bus lines are both optimized by the proposed model. Based on the algorithm for transit efficient path search and computational procedure for integrated network system performance, a genetic-variable neighborhood search algorithm is developed to get Pareto solution set of the proposed model. A numerical example is used to verify the proposed mathematical model and the solution algorithm.
(6) Rail transit line No.1in Zhengzhou taken as the background, a real example is used to verify the practical value and significance of the study.
引文
[1]北京交通发展研究中心.北京市2011年上半年交通运行分析报告[R].北京：北京交通发展研究中心,2011.
[2]鲁放,韩宝明,李得伟.网络化城市轨道交通在城市客运中的骨干作用[J].综合运输,2008,(2)：67-69.
[3]东莞科普网.《东莞市轨道交通网络规划》介绍[EB/OL]. http://www.dgkp.gov.cn/showart_2646.htm,2009.
[4]华商论坛.配合二号地铁开通,我市将对114条公交线路、9085块站牌进行调整和更换[EB/OL]. http://bbs.hsw.cn/read-htm-tid-2999830.html,2011.
[5]北京公交集团.25条公交线接驳地铁新线3条9字头公交撤离城中心缓堵[EB/OL]. http:// www.bjbus.com/home/news_detail.php?uNewsCode=00001524&uNewsType=2&uPageType= 10,2010.
[6]北京公交集团.公示：为配合地铁8号线开通公交集团开通多条线路[EB/OL]. http://www. bjbus.com/home/news_detail.php?uNewsCode=00001865&uNewsType=1&uPageType=3, 2011.
[7]北京公路网.上海：108条公交线对接地铁10号线[EB/OL]. http://www. chinahighway.com/ news/2010/401170.php,2010.
[8]广州至信交通顾问有限公司.广州市轨道交通四号线交通衔接规划[R].广州：广州至信交通顾问有限公司,2006.
[9]中国采招网.轨道交通R2线沿线公交接驳专题研究招标公告[EB/OL]. http://www. bidcenter.com.cn/newscontent-5506741-1.html,2009.
[10]中国采招网.常规公交与轨道交通衔接规划编制服务重新招标公告[EB/OL]. http://gd. bidcenter. com.cn/diqurili-7525797-1.html,2011.
[11]CJJ/T114-2007,城市公共交通分类标准[S].
[12]Vuchic V R. Urban Transit:Operation, Planning and Economics[M]. New Jersey:John Wiley & Sons, Inc, USA,2004.
[13]陆海华,李橘云,陈天明.轨道交通接运公交专线现状特性分析[J].西部交通科技,2010,(4)：58-61.
[14]戴帅.大城市公共交通一体化关键技术研究[D].北京：北京工业大学,2008.
[15]Chien S, Yang Z. GENETIC ALGORITHM APPROACH FOR TRANSIT ROUTE PLANNING AND DESIGN[J]. Journal of Transportation Engineering,2007,27(3):200-207.
[16]Ceder A, Wilson N. Bus Network Design[J]. Transportation Research Part B,1986,20(4): 331-344.
[17]Ceder A, Israeli Y. User and operator perspectives in transitnetwork design[J]. Transportation Research Record 1623,1997:3-7.
[18]Lee Y.1. Analysis and optimization of transit network design with integrated routing and scheduling[D]. Partial:The University of Pennsylvania in Partial,1998.
[19]Fang Z, Gan A. Optimization of transit network to minimize transfer[R]. Prepared for Research Center Florida Department of Transportation, contract No.BD-015-02,2003.
[20]于滨.城市公交系统模型与算法研究[D].大连：大连理工大学,2006.
[21]刘好德.公交线网优化设计理论及实现方法研究[D].上海：同济大学,2008.
[22]顾志康.大城市快速公交线网规划理论与方法研究[D].江苏：东南大学,2008.
[23]Daganzo C F. Structure of competitive transit networks[J]. Transportation Research Part B: Methodological,2010,44(4):434-446.
[24]Curtin K M, Biba S. The Transit Route Arc-Node Service Maximization problem[J]. European Journal of Operational Research,2011,208(1):46-56.
[25]Lee Y J, Vuchic V R. Transit Network Design with Variable Demand[J]. Journal of Transportation Engineering,2005,131(1):1-10.
[26]Fan W, Machemehl R B. Optimal Transit Route Network Design Problem with Variable Transit Demand:Genetic Algorithm Approach[J]. Journal of Transportation Engineering,2006,132(1): 40-51.
[27]Marwah B R, Parti R. Modelling for estimation of demand to generate feeder bus routes of mass rapid transit system[J]. Journal of the Institution of Engineers,2004,85:169-173.
[28]Matisziw T C, Murray A T, Kim C. Strategic route extension in transit networks[J]. European Journal of Operational Research,2006,171(2):661-673.
[29]Marin A, Jaramillo P. Urban rapid transit network capacity expansion[J]. European Journal of Operational Research,2008,191(1):45-60.
[30]Baaj M H, Mahmassani H S. An AI-based approach for transit route system planning and design [J]. Journal of advanced transportation,1991,25(2):187-210.
[31]Kepaptsoglou K, Karlaftis M. Transit Route Network Design Problem:Review[J]. Journal of Transportation Engineering,2009,135(8):492-505.
[32]王炜.实用公交线网规划方法研究[J].东南大学学报,1990,20(4)：81-88.
[33]Zhao F, Zeng X G R. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks [J]. European Journal of Operational Research,2008,186(2): 841-855.
[34]Baaj M H, Mahmassani H S. Hybrid route generation heuristic algorithm for the design of transit networks[J]. Transportation Research Part C,1995,3(1):31-50.
[35]Mauttone A, Urquhart M. A route set construction algorithm for the transit network design problem[J]. Computers and Operations Research,2009,36(8):2440-2449.
[36]Cipriani E, Gori S, Petrelli M. Transit network design:A procedure and an application to a large urban area[J]. Transportation Research Part C,2012,20(1):3-14.
[37]邢文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,1999.
[38]Bielli M, Caramia M, Carotenuto P. Genetic algorithms in bus network optimization [J]. Transportation Research Part C,2002,10(1):19-34.
[39]Gaetano F, Stefano G, Petrelli M. An heuristic transit network design algorithm for medium size towns[C]. In:Proceedings of the 13th Mini-EURO Conference, Bari, Italy,2002.
[40]Tom V M, Mohan S. Transit Route Network Design using Frequency Coded Genetic Algorithm[J]. Journal of Transportation Engineering,2003,129(2):186-195.
[41]Beltran B, Carrese S, Cipriani E, Petrelli M. Transit network design with allocation of green vehicles:A genetic algorithm approach[J]. Transportation Research Part C,2009,17(5): 475-483.
[42]白子建,赵淑芝,田振中.公共交通网络优化的禁忌算法设计与实现[J].吉林大学学报(工学版),2006,36(3)：341-344.
[43]Fan W, Machemehl R B. Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem[J]. Journal of Transportation Engineering,2006,132(2):122-132.
[44]Duan L, Yin Y. Public Transit Network Planning Based on Evolutionary Algorithm[C]. International Conference on Transportation Engineering,2009:3930-3935.
[45]Yu B, Yang Z, Cheng C, Liu C. Optimizing bus transit network with parallel ant colony algorithm[C]. In:Proceedings of the Eastern Asia Society forTransportation Studies,2005, (5): 374-389.
[46]Yang Z Z, Y B, Cheng C. A Parallel Ant Colony Algorithm for Bus Network Optimization[J]. Computer-Aided Civil and Infrastructure Engineering,2007,22(1):44-55.
[47]Zhao F. Simulated Annealing-Genetic Algorithm for Transit Network Optimization[J]. Journal of Computing in Civil Engineering,2006,20(1):57-68.
[48]Current J R, ReVelle C S, Cohon J L. The hierarchical network design problem[J]. European Journal of Operational Research,1986,27(1):57-66.
[49]Kuah G K, Perl J. Optimization of Feeder Bus Routes and Bus Stop Spacing[J]. Jouranl of Transportation Engineering,1988,114(3):341-354.
[50]Chien S, Yang Z. Optimal feeder bus routes on irregular street networks[J]. Journal of Advanced Transportation,2000,34(2):213-248.
[51]Kuah G K, Perl J. The Feeder-bus Network-design Problem[J]. Journal of the Operational Research Society,1989,40(8):751-767.
[52]Martins C L, Pato M V. Search strategies for the feeder bus network design problem[J]. European Journal of Operational Research,1998,106(2-3):425-440.
[53]蒋冰蕾,孙爱充.城市快速轨道交通接运公交路线网规划[J].系统工程理论与实践,1998,(3)：130-134,139.
[54]Shrivastav P, Dhingra S L. Development of feeder routes for suburban railway stations using heuristic approach[J]. Journal of Transportation Engineering,2001,127(4):334-341.
[55]Verma A, Dhingra S L. Feeder bus Routes Generation within integrated mass transit planning framework[J]. Jouranl of Transportation Engineering,2005,131(11):822-834.
[56]Kuan S N, Ong H L, Ng K M. Solving the feeder bus network design problem by genetic algorithms and ant colony optimization[J]. Advances in Engineering Software,2006,37(6): 351-359.
[57]薛行健.城市轨道交通接运公交线网优化研究[D].长沙：长沙理工大学,2008.
[58]Shrivastava P, O'Mahony M. Use of a Hybrid Algorithm for Modeling Coordinated Feeder[J]. Journal of Transportation Engineering,2009,135(1):1-8.
[59]吴修朋.武汉市轨道交通二号线接运公交线网优化研究[D].武汉：武汉理工大学,2008.
[60]Chien S, Spasovic L N, Chhonkar R S. Evaluation of feeder bus systems with probabilistic time-varying demands and non-additive value of time[J]. Transportation Research Record: Journal of the Transportation Research Board, TRR No.1760,2001:47-55.
[61]Quadrifoglio L, Li X G. A methodology to derive the critical demand density for designing and operating feeder transit services[J]. Transportation Research Part B,2009,43(10):922-935.
[62]Li X G, Quadrifoglio L. Feeder transit services:Choosing between fixed and demand responsive policy[J]. Transportation Research Part C,2010,18(5):770-780.
[63]Mohaymany A S, Gholami A. Multimodal Feeder Network Design Problem:Ant Colony Optimization Approach[J]. Jouranl of Transportation Engineering,2010,136(4):323-331.
[64]Alshalalfah A, Shalaby A. Feasibility of Flex-Route as a Feeder Transit Service to Rail Stations in the Suburbs:Case Study in Toronto[J]. Journal of Urban Planning and Development, 2012,138(1):90-100.
[65]Shrivastava P, O'Mahony P. A model for development of optimized feeder routes and coordinated schedules—A genetic algorithms approach[J]. Transport Policy,2006,13(5): 413-425.
[66]Wirasinghe S C, Hurdle V F, Newell G F. Optimal parameters for a coordinated rail and bus transit system[J]. Transport Science,1977,11(4):359-74.
[67]Wirasinghe S C. Nearly optimal parameters for a rail/feeder-bus system on a rectangular grid[J]. Transportation Research Part A,1980,14(1):33-40.
[68]Chien S, Schonfeld P. Joint Optimization of a Rail Transit Line and Its Feeder Bus System[J]. Journal of advanced transportation,1998,32(3):253-284.
[69]孙杨,宋瑞,何世伟.大城市轨道交通与接运公交综合发展研究[J].综合运输,2009,(12)：53-56.
[70]Guihaire V, Hao J K. Transit network design and scheduling:A global review[J]. Transportation Research Part A:Policy and Practice,2008,42(10):1251-1273.
[71]Verma A, Dhingra S L. Developing Integrated Schedules for Urban Rail and Feeder Bus Operation[J]. Journal of Urban Planning and Development,2007,132(3):138-146.
[72]Wan K H. optimal integrated transit network design[D]. Hong Kong:Hong Kong University of Science and Technology,2002.
[73]Hong K L, Yip C W, Wan K H. Modeling transfer and non-linear fare structure inmulti-modal network[J]. Transportation Research Part B:Methodological,2003,37(2):149-170.
[74]Li Z C, Lam W H K, Wong S C. Optimization of a Bus and Rail Transit System with Feeder Bus Services under Different Market Regimes[J]. Transportation and Traffic Theory 2009: Golden Jubilee,2009:495-516.
[75]Zhang J W, Liao F X, Arentze T, Timmermansa H. A multimodal transport network model for advanced traveler information systems[J], Procedia Computer Science,2011, (5):912-919.
[76]Gallo M, Montella B, Acierno Luca D. The transit network design problem with elastic demand and internalisation of external costs:An application to rail frequency optimization[J]. Transportation Research Part C,2011,19(6):1276-1305..
[77]陈旭梅,林国鑫,于雷.常规公共交通与轨道交通运营调度协调模型[J].系统工程理论与实践,2009,29(10)：165-173.
[78]张宇石,陈旭梅,于雷,何波,林国鑫.基于换乘站点的轨道交通与常规公交运营协调模型研究[J].铁道学报,2009,31(3)：11-19.
[79]范海雁,杨晓光,夏晓梅,严凌.基于轨道交通的常规公交线网调整方法[J].城市轨道交通研究,2005,(4)：36-38.
[80]张发才,基于轨道交通的常规公交调整方法研究[C].中国城市交通规划2006年年会第22次学术研讨会,2006,351-357.
[81]周昌标,王婷静,赖友兵.基于道路公交与轨道交通布局模式的公交线网调整方法[J].城 市轨道交通研究,2008,(4)：44-47.
[82]翟栋栋.轨道交通环境下地面公交线网布局发展规划研究[D].西安：长安大学,2008.
[83]李橘云.基于轨道交通的常规公交线路优化对策研究[J].都市快轨交通,2009,22(3)：10-13.
[84]梁丽娟.城市轨道线网形成期公交线路调整方法研究[D].上海：同济大学,2009.
[85]林丽凡.接运轨道交通的常规公交规划方法研究[D].合肥：合肥工业大学.2009
[86]Li Z, Chen X W, Liu X Q. Transit Network Optimization Method Based on BRT Attracting Region:A Case Study of Changzhou[C]. ICCTP 2009:Critical Issues in Transportation System Planning, Development, and Management,2009,1063-1069.
[87]孔繁钰,高志刚,徐上,刘海洲.基于轨道交通的常规公交配套规划[J].交通科技与经济,2010,3(59)：25-27.
[88]王振报,陈艳艳,段卫静.常规公交线路调整方案评估方法[J].交通运输系统工程与信息,2011,11(3)：124-130.
[89]牛学琴.配合城市轨道交通的接运公交线网优化研究[D].四川：西南交通大学,2011.
[90]陈丽君,陈学武,陆卫,施毅.基于轨道交通与公交一体化的公交线路及站点调整方法：中国,201010593890[P].2011-08-17.
[91]GB/T21562-2008,轨道交通可靠性、可用性、可维修性和安全性规范及示例[S].
[92]Bowman L A, Turnquist M A. Service Frequency, Schedule Reliability and Passenger Wait Times at Transit Stops[J]. Transportation Research Part A,1981,15(6):465-471.
[93]Bates J, Polak J, Jones P, Cook A. The valuation of reliability for personal travel[J]. Transportation Research Part E,2001,37(2-3):191-229.
[94]Kittelson P B, Quade K, Hunter-Zaworski K M. Transit Capacity and Quality of Service Manual. Wanshingon DC:Transportation Research Board, National Academy Press,2003.
[95]Camus R, Longo G, Macorini C. Estimation of Transit Reliability Level-of-Service Based on Automatic Vehicle Location Data[J]. Transportation Research Record,2005:277-286.
[96]陈峰,王子甲,李志强.城市轨道交通建设成本构成分析[J].铁道运输与经济,2008,30(9)：53-55.
[97]罗世民,陈红江.城市轨道交通的环境评价[J].南吕高专学报,2006,4(65)：101-108.
[98]郑州市公共交通总公司.郑州公交信息查询系统[EB/OL]. http://218.28.136.20:8000/bus//, 2011.
[99]马超群,王玉萍,陈宽民.城市轨道交通与常规公交之竞争模型[J].交通运输系统工程与信息,2007,7(3)：140-143.
[100]罗小强.城市轨道交通线网布局规划理论与方法研究[D].西安：长安大学,2011.
[101]新华网.多条地铁线运力已近极,地铁限流将成常态化举措[EB/OL]. http://news.xinhuanet. com/fortune/2011-02/26/c_121124738.htm,2011.
[102]Shepherd S P, Zhang X, Emberger G, Hudson M, May A D, Paulley N. Designing optimal urban transport strategies:The role of individual policy instruments and the impact of financial constraints[J]. Transport Policy,2006,13(1):49-65.
[103]Cervero R. Alternative Approaches to Modeling the Travel-Demand Impacts of Smart Growth[J]. Journal of the American Planning Association,2006,72(3):285-295.
[104]俞洁,杨晓光,尹瑞,夏胜国.基于TOD模式的成长型城市公共交通规划[J].交通运输工程学报,2007,7(3)：106-110.
[105]徐瑞华,滕靖.城市轨道交通网络应急指挥辅助决策支持系统的相关问题研究[J].城市公用事业,2010,24(3)：1-4.
[106]滕靖,徐瑞华.城市轨道交通突发事件下公交应急联动策略[J].铁道学报,2010,32(5)：13-17.
[107]D.Han L, Yuan F, Chin S M, Hwang H. Global Optimization of emergency evacuation assignments[J]. Interfaces,2006,36(6):502-513.
[108]Kepaptsoglou K, G.Karlaftis M. The bus bridging problem in metro operations:conceptual framework, models and algorithms[J]. Public Transport,2010,1(4):275-297.
[109]Lin C C. The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services [J]. International Journal of Production Economics,2010,123(1):20-30.
[110]杨晗熠.枢纽确定单连接轴-辐网络结构在中国民用航空网络中的应用[J].北京理工大学学报：社会科学版,2010,12(2)：27-30.
[111]王波,李晓霞,安栓庄.轨道交通换乘站客流特性分析及车站设计[J].都市快轨交通,2010,23(2)：55-58.
[112]孙杨,宋瑞,何世伟.弹性需求下的接运公交网络设计[J].吉林大学学报(工学版),2011,41(2)：349-354.
[113]徐华海,程世丹.以步行网络为基础的城市复兴策略研究[J].华中建筑,2009：27(6)：63-65.
[114]吕国林,张晓春.深圳市自行车交通发展策略及网络规划[J].城市交通,2009,7(3)：68-72.
[115]中华人民共和国国家统计局.中国统计年鉴[EB/OL]. http://www.stats.gov.cn/tjsj/ndsj/, 2011.
[116]陈洁,陆锋,程吕秀.可达性度量方法及应用研究进展评述[J].地理科学进展,2007,26(5)：100-112.
[117]吴娇蓉,郑宇,陈小鸿.城市建成区轨道站公交换乘设施规划方法[J].同济大学学报(自然科学版),2008,36(11)：1501-1506.
[118]赵航.城市公交系统网络运能计算与优化整合理论及方法研究[D].北京：北京交通大学,2009.
[119]孙杨,宋瑞,何世伟.接运公交时刻表与车辆调度综合优化[J].吉林大学学报工学版,2011,41(5)：1228-1233.
[120]北京地铁.地铁时刻表[EB/OL]. http://www.bjsubway.com/node/200,2012.
[121]宋南南,刘晖,陈学武.基于客流量和道路条件分析城市公交车型[J].中国市政工程,2008,(4)：96-98.
[122]GA/T 507-2004,中华人民共和国公共安全行业标准-公交专用道设置[S].
[123]GB 50220-95,城市道路交通规划设计规范[S].
[124]赵硕.城市轨道交通与地面常规公交站点衔接换乘研究[D].西安：西安建筑科技大学,2011.
[125]Furth P G., Rahbee, A B. Optimal bus stop spacing through dynamic programming and geographic modeling[J]. Transportation Research Record,2000:15-22.
[126]宋杨,陈宽民,姚新虎.配合城市轨道交通的常规公交起讫点的确定[J].长安大学学报(自然科学版),2006,26(3)：73-76.
[127]Dijkstra E. A Note on Two Problems in Connection with Graphs[J]. Numeriche Mathematik, 1959,1:269-271.
[128]陆华普.交通规划理论与方法[M].2006,北京：清华大学出版社.
[129]Yen J Y. Finding the K shortest loopless paths in a network[J]. Management Science,1971, 17(11):712-716.
[130]Akgun A., Erkut E., Batta R.. On finding dissimilar paths[J]. European Journal of Operation Research,2000,121(2):232-246.
[131]van der Zijpp N J, Catalano F. Path enumeration by finding the constrained K-shortest paths[J]. Transportation Research Part B,2005,39(6):545-563.
[132]陈文兰,潘荫荣.一个求解次短和渐次短路径的实用算法[J].计算机应用与软件,2006,23(1)：94-96.
[133]北京公共交通集团.2009年第一批公交线网优化方案[EB/OL]. http://www.bjbus.com/home /news_detail.php?uNewsCode=00001172&uNewsType=1&uPageType=3,2009.
[134]上海地铁联盟.徐泾枢纽公交调整方案公示[EB/OL]. http://www.unitedmetro.net.cn/ archiver/?tid-14836.html,2010.
[135]袁润文,配合城市轨道交通的常规公交线网调整研究[D].北京：北京交通大学,2008.
[136]刘术红.地铁接运公交客流预测及新增线路规模研究[D].哈尔滨：哈尔滨工业大学,2005.
[137]腾讯网,北京开通首条袖珍公交线路全长5.7公里[EB/OL]. http://news.qq.com/a/20100627 /000106.htm,2010.
[138]冼伟雄.广州市快速公交潮汐客流的应对措施[J].城市交通,2011,9(2)：26-33.
[139]Ceder A, Golany B, Tal O. Creating bus timetables with maximal synchronization[J]. Transportation Research Part A,2001,35(10):913-928.
[140]Fan W. Optimal Transit Route Network Design Problem:Algorithms, Implementations, and Numerical Results[D]. Austin:The University of Texas at Austin,2004.
[141]王炜,杨新苗,陈学武.城市公共交通系统规划方法与管理技术[M].北京：科学出版社,2002.
[142]周雪梅,张显尊,杨晓光,劳云腾.基于交通方式选择的公交出行需求预测[J].同济大学学报：自然科学版,2007,35(12)：1627-1631.
[143]Yan S Y, Chi C J, Tang C H. Inter-city Bus Routing and Timetable Setting under Stochastic Demands[J]. Transportation Research Part A,2006,40(7):572-586.
[144]Ceder A. Public Transit Planning and Operation:Theory, Modeling and Practice[M]. UK: Elsevier, Butterworth-Heinemann, Oxford,2007.
[145]Ceder A, Stern H I. Deficit Function Bus Scheduling with Deadheading Trip Insertions for Fleet Size Reduction[J]. Transportation Science,1981,15(4):338-363.
[146]徐以群.城市公交项目经济评价中的运营成本估算方法[J].城市公共交通,2009,(11)：35-37.
[147]孙杨,宋瑞,何世伟.随机需求下公交时刻表设计的鲁棒性优化[J].系统工程理论与实践,2011,31(5)：986-992.
[148]Gen M, Cheng R W. Genetic Algorithms and Engineering Optimization[M]. Wiley Interscience, 1999.
[149]玄光男,程润伟.遗传算法与工程优化[M].北京：清华大学出版社,2004.
[150]Yang J H, Wu C G, Lee H P, Liang Y C. Solving traveling salesman problems using generalized chromosome genetic algorithm[J]. Progress in Natural Science,2008,18(7): 887-892.
[151]Qing-dao-er-ji R, Wang Y P. A new hybrid genetic algorithm for job shop scheduling problem[J]. Computers & Operations Research,2012,39(10):2291-2299.
[152]Renner G, Ekart A. Genetic algorithms in computer aided design[J]. Computer-Aided Design, 2003,35(8):709-726.
[153]Mayer M K, A network parallel genetic algorithm for the one machine sequencing problem[J]. Computers & Mathematics with Applications,1999,37(3):71-78.
[154]Jaszkiewicz A, Zielniewicz P. Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem[J]. European Journal of Operational Research,2009,193(3): 885-890.
[155]Che Z H, Chiang C J. A modified Pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly [J]. Advances in Engineering Software,2010, 41(7-8):1011-1022.
[156]Poulos P N, Rigatos G G, Tzafestas S G, Koukos A K. A Pareto-optimal genetic algorithm for warehouse multi-objective optimization[J]. Engineering Applications of Artificial Intelligence, 2011,14(6):737-749.
[157]Mladenovic N, Hansen P. Variable neighborhood search[J]. Computers and Operations Research,1997,24(11):1097-1100.
[158]Kytojoki J, Nuortio T, Braysy O, Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems[J]. Computers and Operations Research, 2007,34(9):2743-2757.
[159]Carrabs F, Cordeau J, Laporte G. Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading[J]. INFORMS Journal on Computing,2007, 19(4):618-632.
[160]Roshanaei V, Naderi B, Jolai F, Khalili M. A variable neighborhood search for job shop scheduling with set-up times to minimize makespan[J]. Future Generation Computer Systems, 2009,25(6):654-661.
[161]Murata T, Ishibuchi H, Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling[J]. Computers and Industrial Engineering,1996,30(4):957-968.
[162]Ishibuchi H, Murata T. A Multi-Objective Genetic Local Search Algorithm and Its Application to Flowshop Scheduling [J]. IEEE Transactions on Systems Man and Cybernetics,1998,28(3): 392-403.
[163]李凯.考虑节能降耗的关键机器调度问题研究[D].合肥：合肥工业大学,2009.
[164]张玉云、蒋幸端.东莞轻轨R2线实验段昨开工[N].广州日报,2010-3-27(A10).
[165]李国彬,邓宇鹏,吴运建,郭静祯.东莞市公共交通发展分析[J].东莞理工学院学报,2009,16(6)：12-20,29.
[166]范文博,李志纯,张殿业.弹性需求下多方式交通网络中地铁线路规划问题研究[J].铁道学报,2008,30(4)：6-10.
[167]Yan S Y, Chi C J, Tang C H. Inter-city Bus Routing and Timetable Setting under Stochastic Demands[J]. Transportation Research Part A,2006,40 (7):572-586.
[168]宋瑞,何世伟,杨永凯,杨海,罗康锦.公交时刻表设计与车辆运用综合优化模型[J].中 国公路学报,2006,19(3)：70-76.
[169]张玉春,韩秀华,臧雪柏.基于双向搜索的公交路径选择算法及优化模型[J].吉林大学学报(信息科学版),2009,27(2)：579-584.
[170]向万里,刘洪升.城市公交网络出行路径选择的计算机算法研究[J].兰州交通大学学报(自然科学版),2006,25(1)：121-124.
[171]戴连贵,刘正东.公交调度发车间隔多目标组合优化模型[J].交通运输系统工程与信息,2007,7(4)：43-46.
[172]于滨,杨忠振,程春田,左志.公交线路发车频率优化的双层规划模型及其解法[J].吉林大学学报(工学版),2006,36(5)：43-46.
[173]Puchalsky C M. Use of bi-level optimization techniques for the problem of transit frequency determination New formulation and solution techniques [D]. Partia:The University of Pennsylvania in Partial,1998.
[174]姚加林,侯朝峰,杨肇夏,付成.基于可变公交发车频率的城市拥挤道路收费定价优化[J].交通运输系统工程与信息,2010,10(2)：94-99.
[175]何庆国.努力打造优秀郑州公交[J].人大建设,2009,(4)：52-53.
[176]腾讯网.郑州地铁1号线正式开工,时速最高可达80公里EB/OL]. http://news.qq.com/a/ 20090608/000614.htm,2009.
[177]新浪网.郑州地铁2号线一期开工,预测最高时速80公里[EB/OL]. http://henan.sina. com.cn/news/m/2010-12-29/63-51980.html,2010.
[2]鲁放,韩宝明,李得伟.网络化城市轨道交通在城市客运中的骨干作用[J].综合运输,2008,(2)：67-69.
[3]东莞科普网.《东莞市轨道交通网络规划》介绍[EB/OL]. http://www.dgkp.gov.cn/showart_2646.htm,2009.
[4]华商论坛.配合二号地铁开通,我市将对114条公交线路、9085块站牌进行调整和更换[EB/OL]. http://bbs.hsw.cn/read-htm-tid-2999830.html,2011.
[5]北京公交集团.25条公交线接驳地铁新线3条9字头公交撤离城中心缓堵[EB/OL]. http:// www.bjbus.com/home/news_detail.php?uNewsCode=00001524&uNewsType=2&uPageType= 10,2010.
[6]北京公交集团.公示：为配合地铁8号线开通公交集团开通多条线路[EB/OL]. http://www. bjbus.com/home/news_detail.php?uNewsCode=00001865&uNewsType=1&uPageType=3, 2011.
[7]北京公路网.上海：108条公交线对接地铁10号线[EB/OL]. http://www. chinahighway.com/ news/2010/401170.php,2010.
[8]广州至信交通顾问有限公司.广州市轨道交通四号线交通衔接规划[R].广州：广州至信交通顾问有限公司,2006.
[9]中国采招网.轨道交通R2线沿线公交接驳专题研究招标公告[EB/OL]. http://www. bidcenter.com.cn/newscontent-5506741-1.html,2009.
[10]中国采招网.常规公交与轨道交通衔接规划编制服务重新招标公告[EB/OL]. http://gd. bidcenter. com.cn/diqurili-7525797-1.html,2011.
[11]CJJ/T114-2007,城市公共交通分类标准[S].
[12]Vuchic V R. Urban Transit:Operation, Planning and Economics[M]. New Jersey:John Wiley & Sons, Inc, USA,2004.
[13]陆海华,李橘云,陈天明.轨道交通接运公交专线现状特性分析[J].西部交通科技,2010,(4)：58-61.
[14]戴帅.大城市公共交通一体化关键技术研究[D].北京：北京工业大学,2008.
[15]Chien S, Yang Z. GENETIC ALGORITHM APPROACH FOR TRANSIT ROUTE PLANNING AND DESIGN[J]. Journal of Transportation Engineering,2007,27(3):200-207.
[16]Ceder A, Wilson N. Bus Network Design[J]. Transportation Research Part B,1986,20(4): 331-344.
[17]Ceder A, Israeli Y. User and operator perspectives in transitnetwork design[J]. Transportation Research Record 1623,1997:3-7.
[18]Lee Y.1. Analysis and optimization of transit network design with integrated routing and scheduling[D]. Partial:The University of Pennsylvania in Partial,1998.
[19]Fang Z, Gan A. Optimization of transit network to minimize transfer[R]. Prepared for Research Center Florida Department of Transportation, contract No.BD-015-02,2003.
[20]于滨.城市公交系统模型与算法研究[D].大连：大连理工大学,2006.
[21]刘好德.公交线网优化设计理论及实现方法研究[D].上海：同济大学,2008.
[22]顾志康.大城市快速公交线网规划理论与方法研究[D].江苏：东南大学,2008.
[23]Daganzo C F. Structure of competitive transit networks[J]. Transportation Research Part B: Methodological,2010,44(4):434-446.
[24]Curtin K M, Biba S. The Transit Route Arc-Node Service Maximization problem[J]. European Journal of Operational Research,2011,208(1):46-56.
[25]Lee Y J, Vuchic V R. Transit Network Design with Variable Demand[J]. Journal of Transportation Engineering,2005,131(1):1-10.
[26]Fan W, Machemehl R B. Optimal Transit Route Network Design Problem with Variable Transit Demand:Genetic Algorithm Approach[J]. Journal of Transportation Engineering,2006,132(1): 40-51.
[27]Marwah B R, Parti R. Modelling for estimation of demand to generate feeder bus routes of mass rapid transit system[J]. Journal of the Institution of Engineers,2004,85:169-173.
[28]Matisziw T C, Murray A T, Kim C. Strategic route extension in transit networks[J]. European Journal of Operational Research,2006,171(2):661-673.
[29]Marin A, Jaramillo P. Urban rapid transit network capacity expansion[J]. European Journal of Operational Research,2008,191(1):45-60.
[30]Baaj M H, Mahmassani H S. An AI-based approach for transit route system planning and design [J]. Journal of advanced transportation,1991,25(2):187-210.
[31]Kepaptsoglou K, Karlaftis M. Transit Route Network Design Problem:Review[J]. Journal of Transportation Engineering,2009,135(8):492-505.
[32]王炜.实用公交线网规划方法研究[J].东南大学学报,1990,20(4)：81-88.
[33]Zhao F, Zeng X G R. Optimization of transit route network, vehicle headways and timetables for large-scale transit networks [J]. European Journal of Operational Research,2008,186(2): 841-855.
[34]Baaj M H, Mahmassani H S. Hybrid route generation heuristic algorithm for the design of transit networks[J]. Transportation Research Part C,1995,3(1):31-50.
[35]Mauttone A, Urquhart M. A route set construction algorithm for the transit network design problem[J]. Computers and Operations Research,2009,36(8):2440-2449.
[36]Cipriani E, Gori S, Petrelli M. Transit network design:A procedure and an application to a large urban area[J]. Transportation Research Part C,2012,20(1):3-14.
[37]邢文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,1999.
[38]Bielli M, Caramia M, Carotenuto P. Genetic algorithms in bus network optimization [J]. Transportation Research Part C,2002,10(1):19-34.
[39]Gaetano F, Stefano G, Petrelli M. An heuristic transit network design algorithm for medium size towns[C]. In:Proceedings of the 13th Mini-EURO Conference, Bari, Italy,2002.
[40]Tom V M, Mohan S. Transit Route Network Design using Frequency Coded Genetic Algorithm[J]. Journal of Transportation Engineering,2003,129(2):186-195.
[41]Beltran B, Carrese S, Cipriani E, Petrelli M. Transit network design with allocation of green vehicles:A genetic algorithm approach[J]. Transportation Research Part C,2009,17(5): 475-483.
[42]白子建,赵淑芝,田振中.公共交通网络优化的禁忌算法设计与实现[J].吉林大学学报(工学版),2006,36(3)：341-344.
[43]Fan W, Machemehl R B. Using a Simulated Annealing Algorithm to Solve the Transit Route Network Design Problem[J]. Journal of Transportation Engineering,2006,132(2):122-132.
[44]Duan L, Yin Y. Public Transit Network Planning Based on Evolutionary Algorithm[C]. International Conference on Transportation Engineering,2009:3930-3935.
[45]Yu B, Yang Z, Cheng C, Liu C. Optimizing bus transit network with parallel ant colony algorithm[C]. In:Proceedings of the Eastern Asia Society forTransportation Studies,2005, (5): 374-389.
[46]Yang Z Z, Y B, Cheng C. A Parallel Ant Colony Algorithm for Bus Network Optimization[J]. Computer-Aided Civil and Infrastructure Engineering,2007,22(1):44-55.
[47]Zhao F. Simulated Annealing-Genetic Algorithm for Transit Network Optimization[J]. Journal of Computing in Civil Engineering,2006,20(1):57-68.
[48]Current J R, ReVelle C S, Cohon J L. The hierarchical network design problem[J]. European Journal of Operational Research,1986,27(1):57-66.
[49]Kuah G K, Perl J. Optimization of Feeder Bus Routes and Bus Stop Spacing[J]. Jouranl of Transportation Engineering,1988,114(3):341-354.
[50]Chien S, Yang Z. Optimal feeder bus routes on irregular street networks[J]. Journal of Advanced Transportation,2000,34(2):213-248.
[51]Kuah G K, Perl J. The Feeder-bus Network-design Problem[J]. Journal of the Operational Research Society,1989,40(8):751-767.
[52]Martins C L, Pato M V. Search strategies for the feeder bus network design problem[J]. European Journal of Operational Research,1998,106(2-3):425-440.
[53]蒋冰蕾,孙爱充.城市快速轨道交通接运公交路线网规划[J].系统工程理论与实践,1998,(3)：130-134,139.
[54]Shrivastav P, Dhingra S L. Development of feeder routes for suburban railway stations using heuristic approach[J]. Journal of Transportation Engineering,2001,127(4):334-341.
[55]Verma A, Dhingra S L. Feeder bus Routes Generation within integrated mass transit planning framework[J]. Jouranl of Transportation Engineering,2005,131(11):822-834.
[56]Kuan S N, Ong H L, Ng K M. Solving the feeder bus network design problem by genetic algorithms and ant colony optimization[J]. Advances in Engineering Software,2006,37(6): 351-359.
[57]薛行健.城市轨道交通接运公交线网优化研究[D].长沙：长沙理工大学,2008.
[58]Shrivastava P, O'Mahony M. Use of a Hybrid Algorithm for Modeling Coordinated Feeder[J]. Journal of Transportation Engineering,2009,135(1):1-8.
[59]吴修朋.武汉市轨道交通二号线接运公交线网优化研究[D].武汉：武汉理工大学,2008.
[60]Chien S, Spasovic L N, Chhonkar R S. Evaluation of feeder bus systems with probabilistic time-varying demands and non-additive value of time[J]. Transportation Research Record: Journal of the Transportation Research Board, TRR No.1760,2001:47-55.
[61]Quadrifoglio L, Li X G. A methodology to derive the critical demand density for designing and operating feeder transit services[J]. Transportation Research Part B,2009,43(10):922-935.
[62]Li X G, Quadrifoglio L. Feeder transit services:Choosing between fixed and demand responsive policy[J]. Transportation Research Part C,2010,18(5):770-780.
[63]Mohaymany A S, Gholami A. Multimodal Feeder Network Design Problem:Ant Colony Optimization Approach[J]. Jouranl of Transportation Engineering,2010,136(4):323-331.
[64]Alshalalfah A, Shalaby A. Feasibility of Flex-Route as a Feeder Transit Service to Rail Stations in the Suburbs:Case Study in Toronto[J]. Journal of Urban Planning and Development, 2012,138(1):90-100.
[65]Shrivastava P, O'Mahony P. A model for development of optimized feeder routes and coordinated schedules—A genetic algorithms approach[J]. Transport Policy,2006,13(5): 413-425.
[66]Wirasinghe S C, Hurdle V F, Newell G F. Optimal parameters for a coordinated rail and bus transit system[J]. Transport Science,1977,11(4):359-74.
[67]Wirasinghe S C. Nearly optimal parameters for a rail/feeder-bus system on a rectangular grid[J]. Transportation Research Part A,1980,14(1):33-40.
[68]Chien S, Schonfeld P. Joint Optimization of a Rail Transit Line and Its Feeder Bus System[J]. Journal of advanced transportation,1998,32(3):253-284.
[69]孙杨,宋瑞,何世伟.大城市轨道交通与接运公交综合发展研究[J].综合运输,2009,(12)：53-56.
[70]Guihaire V, Hao J K. Transit network design and scheduling:A global review[J]. Transportation Research Part A:Policy and Practice,2008,42(10):1251-1273.
[71]Verma A, Dhingra S L. Developing Integrated Schedules for Urban Rail and Feeder Bus Operation[J]. Journal of Urban Planning and Development,2007,132(3):138-146.
[72]Wan K H. optimal integrated transit network design[D]. Hong Kong:Hong Kong University of Science and Technology,2002.
[73]Hong K L, Yip C W, Wan K H. Modeling transfer and non-linear fare structure inmulti-modal network[J]. Transportation Research Part B:Methodological,2003,37(2):149-170.
[74]Li Z C, Lam W H K, Wong S C. Optimization of a Bus and Rail Transit System with Feeder Bus Services under Different Market Regimes[J]. Transportation and Traffic Theory 2009: Golden Jubilee,2009:495-516.
[75]Zhang J W, Liao F X, Arentze T, Timmermansa H. A multimodal transport network model for advanced traveler information systems[J], Procedia Computer Science,2011, (5):912-919.
[76]Gallo M, Montella B, Acierno Luca D. The transit network design problem with elastic demand and internalisation of external costs:An application to rail frequency optimization[J]. Transportation Research Part C,2011,19(6):1276-1305..
[77]陈旭梅,林国鑫,于雷.常规公共交通与轨道交通运营调度协调模型[J].系统工程理论与实践,2009,29(10)：165-173.
[78]张宇石,陈旭梅,于雷,何波,林国鑫.基于换乘站点的轨道交通与常规公交运营协调模型研究[J].铁道学报,2009,31(3)：11-19.
[79]范海雁,杨晓光,夏晓梅,严凌.基于轨道交通的常规公交线网调整方法[J].城市轨道交通研究,2005,(4)：36-38.
[80]张发才,基于轨道交通的常规公交调整方法研究[C].中国城市交通规划2006年年会第22次学术研讨会,2006,351-357.
[81]周昌标,王婷静,赖友兵.基于道路公交与轨道交通布局模式的公交线网调整方法[J].城 市轨道交通研究,2008,(4)：44-47.
[82]翟栋栋.轨道交通环境下地面公交线网布局发展规划研究[D].西安：长安大学,2008.
[83]李橘云.基于轨道交通的常规公交线路优化对策研究[J].都市快轨交通,2009,22(3)：10-13.
[84]梁丽娟.城市轨道线网形成期公交线路调整方法研究[D].上海：同济大学,2009.
[85]林丽凡.接运轨道交通的常规公交规划方法研究[D].合肥：合肥工业大学.2009
[86]Li Z, Chen X W, Liu X Q. Transit Network Optimization Method Based on BRT Attracting Region:A Case Study of Changzhou[C]. ICCTP 2009:Critical Issues in Transportation System Planning, Development, and Management,2009,1063-1069.
[87]孔繁钰,高志刚,徐上,刘海洲.基于轨道交通的常规公交配套规划[J].交通科技与经济,2010,3(59)：25-27.
[88]王振报,陈艳艳,段卫静.常规公交线路调整方案评估方法[J].交通运输系统工程与信息,2011,11(3)：124-130.
[89]牛学琴.配合城市轨道交通的接运公交线网优化研究[D].四川：西南交通大学,2011.
[90]陈丽君,陈学武,陆卫,施毅.基于轨道交通与公交一体化的公交线路及站点调整方法：中国,201010593890[P].2011-08-17.
[91]GB/T21562-2008,轨道交通可靠性、可用性、可维修性和安全性规范及示例[S].
[92]Bowman L A, Turnquist M A. Service Frequency, Schedule Reliability and Passenger Wait Times at Transit Stops[J]. Transportation Research Part A,1981,15(6):465-471.
[93]Bates J, Polak J, Jones P, Cook A. The valuation of reliability for personal travel[J]. Transportation Research Part E,2001,37(2-3):191-229.
[94]Kittelson P B, Quade K, Hunter-Zaworski K M. Transit Capacity and Quality of Service Manual. Wanshingon DC:Transportation Research Board, National Academy Press,2003.
[95]Camus R, Longo G, Macorini C. Estimation of Transit Reliability Level-of-Service Based on Automatic Vehicle Location Data[J]. Transportation Research Record,2005:277-286.
[96]陈峰,王子甲,李志强.城市轨道交通建设成本构成分析[J].铁道运输与经济,2008,30(9)：53-55.
[97]罗世民,陈红江.城市轨道交通的环境评价[J].南吕高专学报,2006,4(65)：101-108.
[98]郑州市公共交通总公司.郑州公交信息查询系统[EB/OL]. http://218.28.136.20:8000/bus//, 2011.
[99]马超群,王玉萍,陈宽民.城市轨道交通与常规公交之竞争模型[J].交通运输系统工程与信息,2007,7(3)：140-143.
[100]罗小强.城市轨道交通线网布局规划理论与方法研究[D].西安：长安大学,2011.
[101]新华网.多条地铁线运力已近极,地铁限流将成常态化举措[EB/OL]. http://news.xinhuanet. com/fortune/2011-02/26/c_121124738.htm,2011.
[102]Shepherd S P, Zhang X, Emberger G, Hudson M, May A D, Paulley N. Designing optimal urban transport strategies:The role of individual policy instruments and the impact of financial constraints[J]. Transport Policy,2006,13(1):49-65.
[103]Cervero R. Alternative Approaches to Modeling the Travel-Demand Impacts of Smart Growth[J]. Journal of the American Planning Association,2006,72(3):285-295.
[104]俞洁,杨晓光,尹瑞,夏胜国.基于TOD模式的成长型城市公共交通规划[J].交通运输工程学报,2007,7(3)：106-110.
[105]徐瑞华,滕靖.城市轨道交通网络应急指挥辅助决策支持系统的相关问题研究[J].城市公用事业,2010,24(3)：1-4.
[106]滕靖,徐瑞华.城市轨道交通突发事件下公交应急联动策略[J].铁道学报,2010,32(5)：13-17.
[107]D.Han L, Yuan F, Chin S M, Hwang H. Global Optimization of emergency evacuation assignments[J]. Interfaces,2006,36(6):502-513.
[108]Kepaptsoglou K, G.Karlaftis M. The bus bridging problem in metro operations:conceptual framework, models and algorithms[J]. Public Transport,2010,1(4):275-297.
[109]Lin C C. The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services [J]. International Journal of Production Economics,2010,123(1):20-30.
[110]杨晗熠.枢纽确定单连接轴-辐网络结构在中国民用航空网络中的应用[J].北京理工大学学报：社会科学版,2010,12(2)：27-30.
[111]王波,李晓霞,安栓庄.轨道交通换乘站客流特性分析及车站设计[J].都市快轨交通,2010,23(2)：55-58.
[112]孙杨,宋瑞,何世伟.弹性需求下的接运公交网络设计[J].吉林大学学报(工学版),2011,41(2)：349-354.
[113]徐华海,程世丹.以步行网络为基础的城市复兴策略研究[J].华中建筑,2009：27(6)：63-65.
[114]吕国林,张晓春.深圳市自行车交通发展策略及网络规划[J].城市交通,2009,7(3)：68-72.
[115]中华人民共和国国家统计局.中国统计年鉴[EB/OL]. http://www.stats.gov.cn/tjsj/ndsj/, 2011.
[116]陈洁,陆锋,程吕秀.可达性度量方法及应用研究进展评述[J].地理科学进展,2007,26(5)：100-112.
[117]吴娇蓉,郑宇,陈小鸿.城市建成区轨道站公交换乘设施规划方法[J].同济大学学报(自然科学版),2008,36(11)：1501-1506.
[118]赵航.城市公交系统网络运能计算与优化整合理论及方法研究[D].北京：北京交通大学,2009.
[119]孙杨,宋瑞,何世伟.接运公交时刻表与车辆调度综合优化[J].吉林大学学报工学版,2011,41(5)：1228-1233.
[120]北京地铁.地铁时刻表[EB/OL]. http://www.bjsubway.com/node/200,2012.
[121]宋南南,刘晖,陈学武.基于客流量和道路条件分析城市公交车型[J].中国市政工程,2008,(4)：96-98.
[122]GA/T 507-2004,中华人民共和国公共安全行业标准-公交专用道设置[S].
[123]GB 50220-95,城市道路交通规划设计规范[S].
[124]赵硕.城市轨道交通与地面常规公交站点衔接换乘研究[D].西安：西安建筑科技大学,2011.
[125]Furth P G., Rahbee, A B. Optimal bus stop spacing through dynamic programming and geographic modeling[J]. Transportation Research Record,2000:15-22.
[126]宋杨,陈宽民,姚新虎.配合城市轨道交通的常规公交起讫点的确定[J].长安大学学报(自然科学版),2006,26(3)：73-76.
[127]Dijkstra E. A Note on Two Problems in Connection with Graphs[J]. Numeriche Mathematik, 1959,1:269-271.
[128]陆华普.交通规划理论与方法[M].2006,北京：清华大学出版社.
[129]Yen J Y. Finding the K shortest loopless paths in a network[J]. Management Science,1971, 17(11):712-716.
[130]Akgun A., Erkut E., Batta R.. On finding dissimilar paths[J]. European Journal of Operation Research,2000,121(2):232-246.
[131]van der Zijpp N J, Catalano F. Path enumeration by finding the constrained K-shortest paths[J]. Transportation Research Part B,2005,39(6):545-563.
[132]陈文兰,潘荫荣.一个求解次短和渐次短路径的实用算法[J].计算机应用与软件,2006,23(1)：94-96.
[133]北京公共交通集团.2009年第一批公交线网优化方案[EB/OL]. http://www.bjbus.com/home /news_detail.php?uNewsCode=00001172&uNewsType=1&uPageType=3,2009.
[134]上海地铁联盟.徐泾枢纽公交调整方案公示[EB/OL]. http://www.unitedmetro.net.cn/ archiver/?tid-14836.html,2010.
[135]袁润文,配合城市轨道交通的常规公交线网调整研究[D].北京：北京交通大学,2008.
[136]刘术红.地铁接运公交客流预测及新增线路规模研究[D].哈尔滨：哈尔滨工业大学,2005.
[137]腾讯网,北京开通首条袖珍公交线路全长5.7公里[EB/OL]. http://news.qq.com/a/20100627 /000106.htm,2010.
[138]冼伟雄.广州市快速公交潮汐客流的应对措施[J].城市交通,2011,9(2)：26-33.
[139]Ceder A, Golany B, Tal O. Creating bus timetables with maximal synchronization[J]. Transportation Research Part A,2001,35(10):913-928.
[140]Fan W. Optimal Transit Route Network Design Problem:Algorithms, Implementations, and Numerical Results[D]. Austin:The University of Texas at Austin,2004.
[141]王炜,杨新苗,陈学武.城市公共交通系统规划方法与管理技术[M].北京：科学出版社,2002.
[142]周雪梅,张显尊,杨晓光,劳云腾.基于交通方式选择的公交出行需求预测[J].同济大学学报：自然科学版,2007,35(12)：1627-1631.
[143]Yan S Y, Chi C J, Tang C H. Inter-city Bus Routing and Timetable Setting under Stochastic Demands[J]. Transportation Research Part A,2006,40(7):572-586.
[144]Ceder A. Public Transit Planning and Operation:Theory, Modeling and Practice[M]. UK: Elsevier, Butterworth-Heinemann, Oxford,2007.
[145]Ceder A, Stern H I. Deficit Function Bus Scheduling with Deadheading Trip Insertions for Fleet Size Reduction[J]. Transportation Science,1981,15(4):338-363.
[146]徐以群.城市公交项目经济评价中的运营成本估算方法[J].城市公共交通,2009,(11)：35-37.
[147]孙杨,宋瑞,何世伟.随机需求下公交时刻表设计的鲁棒性优化[J].系统工程理论与实践,2011,31(5)：986-992.
[148]Gen M, Cheng R W. Genetic Algorithms and Engineering Optimization[M]. Wiley Interscience, 1999.
[149]玄光男,程润伟.遗传算法与工程优化[M].北京：清华大学出版社,2004.
[150]Yang J H, Wu C G, Lee H P, Liang Y C. Solving traveling salesman problems using generalized chromosome genetic algorithm[J]. Progress in Natural Science,2008,18(7): 887-892.
[151]Qing-dao-er-ji R, Wang Y P. A new hybrid genetic algorithm for job shop scheduling problem[J]. Computers & Operations Research,2012,39(10):2291-2299.
[152]Renner G, Ekart A. Genetic algorithms in computer aided design[J]. Computer-Aided Design, 2003,35(8):709-726.
[153]Mayer M K, A network parallel genetic algorithm for the one machine sequencing problem[J]. Computers & Mathematics with Applications,1999,37(3):71-78.
[154]Jaszkiewicz A, Zielniewicz P. Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem[J]. European Journal of Operational Research,2009,193(3): 885-890.
[155]Che Z H, Chiang C J. A modified Pareto genetic algorithm for multi-objective build-to-order supply chain planning with product assembly [J]. Advances in Engineering Software,2010, 41(7-8):1011-1022.
[156]Poulos P N, Rigatos G G, Tzafestas S G, Koukos A K. A Pareto-optimal genetic algorithm for warehouse multi-objective optimization[J]. Engineering Applications of Artificial Intelligence, 2011,14(6):737-749.
[157]Mladenovic N, Hansen P. Variable neighborhood search[J]. Computers and Operations Research,1997,24(11):1097-1100.
[158]Kytojoki J, Nuortio T, Braysy O, Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems[J]. Computers and Operations Research, 2007,34(9):2743-2757.
[159]Carrabs F, Cordeau J, Laporte G. Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading[J]. INFORMS Journal on Computing,2007, 19(4):618-632.
[160]Roshanaei V, Naderi B, Jolai F, Khalili M. A variable neighborhood search for job shop scheduling with set-up times to minimize makespan[J]. Future Generation Computer Systems, 2009,25(6):654-661.
[161]Murata T, Ishibuchi H, Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling[J]. Computers and Industrial Engineering,1996,30(4):957-968.
[162]Ishibuchi H, Murata T. A Multi-Objective Genetic Local Search Algorithm and Its Application to Flowshop Scheduling [J]. IEEE Transactions on Systems Man and Cybernetics,1998,28(3): 392-403.
[163]李凯.考虑节能降耗的关键机器调度问题研究[D].合肥：合肥工业大学,2009.
[164]张玉云、蒋幸端.东莞轻轨R2线实验段昨开工[N].广州日报,2010-3-27(A10).
[165]李国彬,邓宇鹏,吴运建,郭静祯.东莞市公共交通发展分析[J].东莞理工学院学报,2009,16(6)：12-20,29.
[166]范文博,李志纯,张殿业.弹性需求下多方式交通网络中地铁线路规划问题研究[J].铁道学报,2008,30(4)：6-10.
[167]Yan S Y, Chi C J, Tang C H. Inter-city Bus Routing and Timetable Setting under Stochastic Demands[J]. Transportation Research Part A,2006,40 (7):572-586.
[168]宋瑞,何世伟,杨永凯,杨海,罗康锦.公交时刻表设计与车辆运用综合优化模型[J].中 国公路学报,2006,19(3)：70-76.
[169]张玉春,韩秀华,臧雪柏.基于双向搜索的公交路径选择算法及优化模型[J].吉林大学学报(信息科学版),2009,27(2)：579-584.
[170]向万里,刘洪升.城市公交网络出行路径选择的计算机算法研究[J].兰州交通大学学报(自然科学版),2006,25(1)：121-124.
[171]戴连贵,刘正东.公交调度发车间隔多目标组合优化模型[J].交通运输系统工程与信息,2007,7(4)：43-46.
[172]于滨,杨忠振,程春田,左志.公交线路发车频率优化的双层规划模型及其解法[J].吉林大学学报(工学版),2006,36(5)：43-46.
[173]Puchalsky C M. Use of bi-level optimization techniques for the problem of transit frequency determination New formulation and solution techniques [D]. Partia:The University of Pennsylvania in Partial,1998.
[174]姚加林,侯朝峰,杨肇夏,付成.基于可变公交发车频率的城市拥挤道路收费定价优化[J].交通运输系统工程与信息,2010,10(2)：94-99.
[175]何庆国.努力打造优秀郑州公交[J].人大建设,2009,(4)：52-53.
[176]腾讯网.郑州地铁1号线正式开工,时速最高可达80公里EB/OL]. http://news.qq.com/a/ 20090608/000614.htm,2009.
[177]新浪网.郑州地铁2号线一期开工,预测最高时速80公里[EB/OL]. http://henan.sina. com.cn/news/m/2010-12-29/63-51980.html,2010.