[1]世界环境与发展委员会. 我们共同的未来[M]. 北京:世界知识出版社,1989.[United Nations World Commission on Environment and Development. Our common future[M]. Beijing: World Affairs Press, 1989.] [2]Claudine Sproles. Trends in sustainable development[J]. Government Information Quarterly, 2008,25(2): 337-338. [3]高自友, 张好智, 孙会君. 城市交通网络设计问题中双层规划模型、方法及应用[J]. 交通运输系统工程与信息, 2004, 4(1): 36-44.[GAO Z Y, ZHANG H Z, SUN H J. Bi-level programming models, approaches and applications in urban transportation network design problems[J]. Communication and Transportation Systems Engineering and Information, 2004, 4(1): 36-44.] [4]高自友, 宋一凡, 四兵峰. 城市交通连续平衡网络设计—理论与方法[M]. 北京: 中国铁道出版社, 2000.[GAO Z Y, SONG Y F, SI B F. The continuous network design of urban transportation-theory and method[M]. Beijing: China Railway Publishing House, 2000.] [5]Chiou S W. Bilevel programming for the continuous transport network design[J]. Transportation Research Part B, 2005, 39: 361-383. [6]Jeff X, Ban, Henry X, et al. A general MPCC model and its solution algorithm for continuous network design problem[J]. Mathematical and Computer Modelling, 2006, 43(5-6):493-505. [7]张国强, 陆键. 连续网络设计问题的遗传算法[J]. 交通运输系统工程与信息, 2007,7(1):101-105.[ZHANG G Q, LU J. Genetic algorithm for continuous network design problem[J]. Journal of Transportation Systems Engineering and Information Technology, 2007,7(1):101-105.] [8]杨进, 徐猛, 高自友. 求解连续网络设计问题的模拟退火算法灵敏度分析交[J]. 交通运输系统工程与信息, 2009, 9(3): 64-70.[YANG J, XU M, GAO Z Y. Sensitivity analysis of simulated annealing for continuous network design problems[J]. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(3): 64-70.] [9]Tianze Xu, Heng Wei, Zhuan-De Wang. Study on continuous network design problem using simulated annealing and genetic algorithm[J]. Expert Systems with Applications, 2009, 36(2):2735-2741. [10]Hossain Poorzahedy, Mark A Turnquist. Approximate algorithms for the discrete network design problem[J]. Transportation Research Part B, 1982, 16(1):45-55. [11]刘灿齐. 预算约束的离散交通网络设计问题[J]. 中国公路学报, 2002,15(2):87-90.[LIU C Q. Discrete network design problem with budget constraint[J]. China Journal of Highway and Transport, 2002,15(2):87-90.] [12]Gao Z Y, Wu J J, Sun H J. Solution algorithm for the bi-level discrete network design problem[J]. Transportation Research Part B, 2005, 39: 479-495. [13]聂伟, 邵春福, 杨励雅,等. 混合交通网络设计的双层模型及遗传算法求解[J]. 土木工程学报, 2007, 40(8):90-93.[NIE W, SHAO C F, YANG L Y, et al. Bi-level programming model for mixed transportation network design and genetic solution algorithm[J]. China Girtl Engineering Journal, 2007,40(8):90-93.] [14]Yang Sun, Rui Song, Shiwei He, et al. Mixed transportation network design based on immune clone annealing algorithm[J]. Journal of Transportation Systems Engineering and Information Technology, 2009,9(3):103-108 [15]中建标公路委员会. 公路工程技术标准[S]. 北京:人民交通出版社,2004.[The Road Commission of China Association for Engineering Construction Standardization[S]. Beijing:The People Jiaotong Press, 2004.] [16]Yin Y, Lawphongpanich S. Internalizing emission externality on road networks[J]. Transportation Research Part D, 2006, 11: 292-301. [17]邢文训,谢金星. 现代优化计算方法[M]. 北京:清华大学出版社,2001. [XING W X, XIE J X. Modern optimum computation method[M]. Beijing:The Tsinghua Press, 2001.] [18]Jayakrishnan R, TsaiW K, ParashkerJ N, et al. Faster path based algorithm for traffic assignment. Transportation Research Record, Washington D C ,TRB National Research Council, 1994:75-83. [19]Sun C,Jayakrishnan R,TsaiW K. Computational study of a path based algorithm and its variants for static traffic assignment. Transportation Research Record, Washington D C, TRB National Research Council, 1994:106-115. [20]Chen A, Lee D H, Jayakrishnan R. Computational study of state-of-the-art path-based traffic assignment algorithms[J]. Mathematics and Computers in Simulation, 2002, 59(6): 509-518. |