基于扩展Logit的交通分配模型与算法研究
|
摘要
随着我国城市交通供需矛盾的日趋严重,交通问题已经成为制约城市发展的主要瓶颈之一。为了解决交通问题,改善交通状况,各级政府部门从交通供给和需求两方面同时出发,不断加大交通基础设施建设力度和提高交通需求管理水平。要保证交通规划和管理措施在一定程度上取得最佳效果,就需要采用先进的交通规划理论和方法来辅助决策。交通分配模型是现代交通规划理论研究的重要内容之一,也是城市道路交通网络设计和拥挤道路收费研究中的一个核心技术。在此背景下,本论文主要针对城市交通网络,研究能够更准确描述出行者路径选择行为的交通分配模型,并将其应用于交通网络设计和拥挤道路收费的研究中,使本论文研究形成一个较为完整的体系,以期为交通管理和规划者的决策提供一定的支持。本文主要完成了以下几方面的研究：
(1)为了克服基于传统Logit的交通分配模型所存在的不相关备选方案的独立性(ⅡA),采用考虑路径重叠的路径感知Logit (RPL-O)模型和路径尺度修正Logit (PSCL)模型,分别构建了基于RPL-O和PSCL的随机用户平衡模型,并证明了模型的等价性以及解的唯一性；设计了求解所提出两种新模型的基于路径的相继平均法(MSA)、连续权重平均法(MSWA)以及自动调整平均法(SRA)；通过数值实验对比了新模型与传统基于Logit的随机用户平衡模型的交通流分配结果,分析了三种算法的求解效率,结果表明SRA算法是本文所采用的求解算法中效率最高的算法。
(2)阐述了C-Logit、路径尺度Logit、广义巢式Logit、配对组合Logit路径选择模型的选择概率形式及模型参数的确定方法；分别构建了基于C-Logit、路径尺度Logit、RPL-O.路径尺度修正Logit、广义巢式Logit、配对组合Logit模型的多用户多准则随机用户平衡模型,并对所提出的六种新模型的等价性以及解的唯一性进行了证明；对比分析了模型中路网结构的表示方法和路径选择概率的计算过程；设计了通用的求解所提出模型的基于路径的SRA算法；通过数值实验对比了新模型与基于Logit的多用户多准则随机用户平衡模型的交通分配结果,分析了模型参数变化对分配流量的影响。
(3)分析了已有连续网络设计研究存在的不足,以出行总阻抗与总投资额之和最小为上层目标函数,以本文第3章所构建的两种模型以及另外四种基于扩展Logit的随机用户平衡模型为下层模型,构建出六种新的连续交通网络设计模型；设计了将遗传算法与SRA算法相结合的组合算法；通过数值实验验证了本文算法的有效性,分析了下层采用基于扩展Logit的随机用户平衡模型与传统确定性用户平衡模型所得到网络设计方案的区别,分析了模型参数变化时,网络设计结果的变化情况。
(4)通过分析传统次优拥挤收费研究中存在的不足,说明考虑多用户多准则以及采用基于扩展Logit的交通分配模型来研究拥挤收费的意义；以系统出行总时间最小为上层目标函数,以基于扩展Logit的多用户多准则随机用户平衡模型为下层模型,构建出六种新的次优拥挤收费模型；设计了将模拟退火算法与SRA算法相结合的组合算法；通过数值实验检验了算法的有效性,对比了下层采用基于扩展Logit的多用户多准则随机用户平衡模型与多用户多准则确定性用户平衡模型所得到的路段收费方案的区别,分析了模型参数变化时,拥挤收费方案的变化情况。
With the growing contradiction between the supply and demand of urban traffic in China, the traffic problems have become one of the major bottlenecks which restrict the urban development. In order to solve the traffic problems and improve the traffic situation, the government departments consider the traffic supply and demand simultaneously, and increase the construction intensity of the traffic infrastructure and improve the level of travel demand management continuously. To ensure the traffic planning and management measures to achieve the best effects, it needs to adopt the advanced traffic planning theories and methods to assist the decision making processes. The research of traffic assignment models is not only an important part of modern traffic planning theory, but also a core technology in the studies of urban road network design problem (URNDP) and congestion road pricing (CRP). In this context, this dissertation mainly focuses on urban traffic networks, and studies on the traffic assignment models which could describe the travelers'route choice behaviors more accurately and applies them in the studies of network design problem and congestion road pricing. And this make the studies of this dissertation form a complete system to provide supports for the decision making of traffic managers and planners. The main studying aspects of this dissertation are as following:
(l)In order to overcome the independence of irrelevant alternatives (ⅡA) property which existed in the traffic assignment models based on the traditional Logit model, the route perception Logit model (RPL-O) which only considered the route overlapping problem and the path size correction Logit model (PSCL) are used in this dissertation, and the stochastic user equilibrium models based on RPL-O and PSCL models were constructed respectively, and the equivalence of the proposed models and the uniqueness of the solutions were proved; the path-based method of successive averages (MSA), method of successive weighted averages (MSWA), and self-regulated averaging method (SRA) algorithm were designed to solve the two proposed stochastic user equilibrium models; through the numerical experiment, the traffic assignment results between the new models and the traditional Logit-based stochastic user equilibrium model were compared in this dissertation and the efficiencies of the three proposed algorithms were analyzed, and the results showed that SRA algorithm was the most efficient algorithm among them.
(2)The forms of selection probability and the methods to determine the parameters of C-Logit, path size Logit, generalized nested Logit, paired combinatorial Logit were described; the multi-class multi-criteria stochastic user equilibrium models based on the C-Logit, path size Logit, RPL-O, path size correction Logit, generalized nested Logit, paired combinatorial Logit models were constructed, and the equivalence of the six proposed models and the uniqueness of solutions were proved; the representation of road network structure and calculation methods of the route selection probability of different models were compared and analyzed; the common path-based SRA algorithm was designed to solve the proposed models; through the numerical experiment, the traffic assignment results between the new models and Logit-based multi-class multi-criteria stochastic user equilibrium model were compared, and the impacts of model parameters on the assigned flows were analyzed.
(3)The deficiencies of the existing studies on continuous network design were analyzed, and the minimum summation of the total travel costs and investment amount was used in the upper level objective function, and the two models proposed in chapter three and the other four extended Logit-based stochastic user equilibrium models were adopted in the lower level models, then the six new continuous traffic network design models were constructed; the combination algorithm which combined the genetic algorithm and SRA algorithm was designed; through the numerical experiment, the effectiveness of the algorithm was demonstrated and the differences of the network design schemes between the extended Logit-based stochastic user equilibrium models and the traditional deterministic user equilibrium model used as the lower level model were analyzed, the changes in the network design results were analyzed when the model parameters varied.
(4)By analyzing the deficiencies of the traditional second-best congestion pricing studies, the significance to consider the multi-class multi-criteria and the use of extended Logit-based traffic assignment models on the studying of congestion pricing was indicated; the minimum total travel time was used as the upper level objective function, and the extended Logit-based multi-class multi-criteria stochastic user equilibrium models were adopted in the lower level models, six new second-best congestion pricing models were built; the combination algorithm which combined the simulated annealing algorithm and SRA algorithm was designed; through the numerical experiment, the effectiveness of the combination algorithm was tested and the differences of the congestion pricing schemes between the extended Logit-based multi-class multi-criteria stochastic user equilibrium models and the multi-class multi-criteria deterministic user equilibrium model used as the lower level model were analyzed, the changes in the congestion pricing results were analyzed when the model parameters varied.
(1)为了克服基于传统Logit的交通分配模型所存在的不相关备选方案的独立性(ⅡA),采用考虑路径重叠的路径感知Logit (RPL-O)模型和路径尺度修正Logit (PSCL)模型,分别构建了基于RPL-O和PSCL的随机用户平衡模型,并证明了模型的等价性以及解的唯一性；设计了求解所提出两种新模型的基于路径的相继平均法(MSA)、连续权重平均法(MSWA)以及自动调整平均法(SRA)；通过数值实验对比了新模型与传统基于Logit的随机用户平衡模型的交通流分配结果,分析了三种算法的求解效率,结果表明SRA算法是本文所采用的求解算法中效率最高的算法。
(2)阐述了C-Logit、路径尺度Logit、广义巢式Logit、配对组合Logit路径选择模型的选择概率形式及模型参数的确定方法；分别构建了基于C-Logit、路径尺度Logit、RPL-O.路径尺度修正Logit、广义巢式Logit、配对组合Logit模型的多用户多准则随机用户平衡模型,并对所提出的六种新模型的等价性以及解的唯一性进行了证明；对比分析了模型中路网结构的表示方法和路径选择概率的计算过程；设计了通用的求解所提出模型的基于路径的SRA算法；通过数值实验对比了新模型与基于Logit的多用户多准则随机用户平衡模型的交通分配结果,分析了模型参数变化对分配流量的影响。
(3)分析了已有连续网络设计研究存在的不足,以出行总阻抗与总投资额之和最小为上层目标函数,以本文第3章所构建的两种模型以及另外四种基于扩展Logit的随机用户平衡模型为下层模型,构建出六种新的连续交通网络设计模型；设计了将遗传算法与SRA算法相结合的组合算法；通过数值实验验证了本文算法的有效性,分析了下层采用基于扩展Logit的随机用户平衡模型与传统确定性用户平衡模型所得到网络设计方案的区别,分析了模型参数变化时,网络设计结果的变化情况。
(4)通过分析传统次优拥挤收费研究中存在的不足,说明考虑多用户多准则以及采用基于扩展Logit的交通分配模型来研究拥挤收费的意义；以系统出行总时间最小为上层目标函数,以基于扩展Logit的多用户多准则随机用户平衡模型为下层模型,构建出六种新的次优拥挤收费模型；设计了将模拟退火算法与SRA算法相结合的组合算法；通过数值实验检验了算法的有效性,对比了下层采用基于扩展Logit的多用户多准则随机用户平衡模型与多用户多准则确定性用户平衡模型所得到的路段收费方案的区别,分析了模型参数变化时,拥挤收费方案的变化情况。
With the growing contradiction between the supply and demand of urban traffic in China, the traffic problems have become one of the major bottlenecks which restrict the urban development. In order to solve the traffic problems and improve the traffic situation, the government departments consider the traffic supply and demand simultaneously, and increase the construction intensity of the traffic infrastructure and improve the level of travel demand management continuously. To ensure the traffic planning and management measures to achieve the best effects, it needs to adopt the advanced traffic planning theories and methods to assist the decision making processes. The research of traffic assignment models is not only an important part of modern traffic planning theory, but also a core technology in the studies of urban road network design problem (URNDP) and congestion road pricing (CRP). In this context, this dissertation mainly focuses on urban traffic networks, and studies on the traffic assignment models which could describe the travelers'route choice behaviors more accurately and applies them in the studies of network design problem and congestion road pricing. And this make the studies of this dissertation form a complete system to provide supports for the decision making of traffic managers and planners. The main studying aspects of this dissertation are as following:
(l)In order to overcome the independence of irrelevant alternatives (ⅡA) property which existed in the traffic assignment models based on the traditional Logit model, the route perception Logit model (RPL-O) which only considered the route overlapping problem and the path size correction Logit model (PSCL) are used in this dissertation, and the stochastic user equilibrium models based on RPL-O and PSCL models were constructed respectively, and the equivalence of the proposed models and the uniqueness of the solutions were proved; the path-based method of successive averages (MSA), method of successive weighted averages (MSWA), and self-regulated averaging method (SRA) algorithm were designed to solve the two proposed stochastic user equilibrium models; through the numerical experiment, the traffic assignment results between the new models and the traditional Logit-based stochastic user equilibrium model were compared in this dissertation and the efficiencies of the three proposed algorithms were analyzed, and the results showed that SRA algorithm was the most efficient algorithm among them.
(2)The forms of selection probability and the methods to determine the parameters of C-Logit, path size Logit, generalized nested Logit, paired combinatorial Logit were described; the multi-class multi-criteria stochastic user equilibrium models based on the C-Logit, path size Logit, RPL-O, path size correction Logit, generalized nested Logit, paired combinatorial Logit models were constructed, and the equivalence of the six proposed models and the uniqueness of solutions were proved; the representation of road network structure and calculation methods of the route selection probability of different models were compared and analyzed; the common path-based SRA algorithm was designed to solve the proposed models; through the numerical experiment, the traffic assignment results between the new models and Logit-based multi-class multi-criteria stochastic user equilibrium model were compared, and the impacts of model parameters on the assigned flows were analyzed.
(3)The deficiencies of the existing studies on continuous network design were analyzed, and the minimum summation of the total travel costs and investment amount was used in the upper level objective function, and the two models proposed in chapter three and the other four extended Logit-based stochastic user equilibrium models were adopted in the lower level models, then the six new continuous traffic network design models were constructed; the combination algorithm which combined the genetic algorithm and SRA algorithm was designed; through the numerical experiment, the effectiveness of the algorithm was demonstrated and the differences of the network design schemes between the extended Logit-based stochastic user equilibrium models and the traditional deterministic user equilibrium model used as the lower level model were analyzed, the changes in the network design results were analyzed when the model parameters varied.
(4)By analyzing the deficiencies of the traditional second-best congestion pricing studies, the significance to consider the multi-class multi-criteria and the use of extended Logit-based traffic assignment models on the studying of congestion pricing was indicated; the minimum total travel time was used as the upper level objective function, and the extended Logit-based multi-class multi-criteria stochastic user equilibrium models were adopted in the lower level models, six new second-best congestion pricing models were built; the combination algorithm which combined the simulated annealing algorithm and SRA algorithm was designed; through the numerical experiment, the effectiveness of the combination algorithm was tested and the differences of the congestion pricing schemes between the extended Logit-based multi-class multi-criteria stochastic user equilibrium models and the multi-class multi-criteria deterministic user equilibrium model used as the lower level model were analyzed, the changes in the congestion pricing results were analyzed when the model parameters varied.
引文
[1]北京市统计局.北京统计年鉴[M].北京：中国统计出版社,2013.
[2]Braess P D D. Uber Ein Paradoxon Aus Der Verkehrsplanung [J]. Unternehmensforschung,1968, 12(1):258-268.
[3]聂冲,贾生华.离散选择模型的基本原理及其发展演进评介[J].数量经济技术经济研究,2005,(11)：151-159.
[4]Luce D. Individual Choice Behavior [M].New York:John Wiley and Sons,1959.
[5]McFadden D. Conditional Logit Analysis of Qualitative Choice Behavior [M]. in P.Zarembka ed. New York:Academic Press,1974.
[6]Bhat C R. Analysis of Travel Mode and Departure Time Choice for Urban Shopping Trips [J]. Transportation Research Part B:Methodological,1998,32(6):361-371.
[7]Small K A. Approximate Generalized Extreme Value Models of Discrete Choice [J]. Journal of Econometrics,1994,62(2):351-382.
[8]Swait J. Choice Set Generation within the Generalized Extreme Value Family of Discrete Choice Models [J]. Transportation Research Part B:Methodological,2001,35(7):643-666.
[9]周嘉男,何丹恒,罗霞.基于Logit模型的路径选择及交通流分配[J].大连交通大学学报,2013,(1)：31-34.
[10]Vega A, Reynolds-Feighan A. A Methodological Framework for the Study of Residential Location and Travel-To-Work Mode Choice Under Central and Suburban Employment Destination Patterns [J]. Transportation Research Part A:Policy and Practice,2009,43(4): 401-419.
[11]杨励雅,李霞,邵春福.居住地,出行方式与出发时间联合选择的交叉巢式Logit模型[J].同济大学学报：自然科学版,2013,40(11)：1647-1653.
[12]Fisk C. Some Developments in Equilibrium Traffic Assignment [J]. Transportation Research Part B:Methodological,1980,14(3):243-255.
[13]Train K E. Discrete Choice Methods with Simulation [M]. Second ed. United States of America: Cambridge University Press,2003.
[14]关宏志.非集计模型：交通行为分析的工具[M].北京：人民交通出版社,2004.
[15]Daganzo C F, Sheffi Y. On Stochastic Models of Traffic Assignment [J]. Transportation Science,1977,11 (3):253-274.
[16]Prashker J N, Bekhor S. Route Choice Models Used in the Stochastic User Equilibrium Problem:A Review [J]. Transport reviews,2004,24(4):437-463.
[17]McFadden D, Train K. Mixed MNL Models for Discrete Response [J]. Journal of applied Econometrics,2000,15(5):447-470.
[18]Cascetta E, Nuzzolo A, Russo F, Vitetta A. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems:Specification and some Calibration Results for Interurban Networks [C]. Proceedings of the 13th International Symposium on Transportation and Traffic Theory. Pergamon,1996:697-711.
[19]Ben-Akiva M, Bierlaire M. Discrete Choice Methods and their Applications to Short Term Travel Decisions [M]. Handbook of transportation science. Springer,1999:5-33.
[20]Cascetta E, Russo F, Viola F A, Vitetta A. A Model of Route Perception in Urban Road Networks [J]. Transportation Research Part B:Methodological,2002,36(7):577-592.
[21]Bovy P H, Bekhor S, Prato C G. The Factor of Revisited Path Size:Alternative Derivation [J]. Transportation Research Record:Journal of the Transportation Research Board,2008,2076(1): 132-140.
[22]Prato C G, Bekhor S. Modeling Route Choice Behavior:How Relevant is the Composition of Choice Set? [J]. Transportation Research Record:Journal of the Transportation Research Board, 2007,2003(1):64-73.
[23]Bliemer M C, Bovy P H. Impact of Route Choice Set On Route Choice Probabilities [J]. Transportation Research Record:Journal of the Transportation Research Board,2008,2076(1): 10-19.
[24]王力,王川久,沈晓蓉,范跃祖.基于模糊旅行时间的动态交通分配模型[J].北京航空航天大学学报,2006,31(10)：1149-1152.
[25]Zhou Z, Chen A, Bekhor S. C-Logit Stochastic User Equilibrium Model:Formulations and Solution Algorithm [J]. Transportmetrica,2012,8(1):17-41.
[26]Bekhor S, Prato C G. Effects of Choice Set Composition in Route Choice Modeling [C]. Proceedings of the 11th International Conference on Travel Behavior Research. Kyoto, Japan, 2006.
[27]Hoogendoorn-Lanser S, van Ness R, Bovy P H. Path Size and Overlap in Multi-Modal Transport Networks [C]. Transportation and Traffic Theory. Flow, Dynamics and Human Interaction.16th International Symposium on Transportation and Traffic Theory,2005.
[28]邱松林,程琳,许项东.基于路径长度的Logit型随机用户均衡模型[J].东南大学学报(自然科学版),2012,42(1)：173-176.
[29]Cascetta E, Papola A. Random Utility Models with Implicit Availability/Perception of Choice Alternatives for the Simulation of Travel Demand [J]. Transportation Research Part C: Emerging Technologies,2001,9(4):249-263.
[30]McFadden D. Modelling the Choice of Residential Location [M].Institute of Transportation Studies, University of California,1978.
[31]Forinash C V, Koppelman F S. Application and Interpretation of Nested Logit Models of Intercity Mode Choice [J]. Transportation Research Record,1993,1413:98-106.
[32]Vovsha P, Bekhor S. Link-Nested Logit Model of Route Choice:Overcoming Route Overlapping Problem [J]. Transportation Research Record:Journal of the Transportation Research Board,1998,1645(1):133-142.
[33]Koppelman F S, Wen C. The Paired Combinatorial Logit Model:Properties, Estimation and Application [J]. Transportation Research Part B:Methodological,2000,34(2):75-89.
[34]Wen C, Koppelman F S. The Generalized Nested Logit Model [J]. Transportation Research Part B:Methodological,2001,35(7):627-641.
[35]刘振,周溪召.巢式Logit模型在交通方式选择行为中的应用[J].上海海事大学学报,2006,27(3)：66-70.
[36]南娟,王喆.基于巢式Logit模型的机场吞吐量预测方法[J].科学技术与工程,2008,8(24)：6572-6575,6602.
[37]张欢,卢毅,史峰,朱东铁.基于巢式Logit模型的超限车辆出行选择行为研究[J].交通运输 系统工程与信息,2012,12(6)：113-118.
[38]Papola A. Some Developments On the Cross-Nested Logit Model [J]. Transportation Research Part B:Methodological,2004,38(9):833-851.
[39]Abbe E, Bierlaire M, Toledo T. Normalization and Correlation of Cross-Nested Logit Models [J]. Transportation Research Part B:Methodological,2007,41(7):795-808.
[40]Marzano V, Papola A. On the Covariance Structure of the Cross-Nested Logit Model [J]. Transportation Research Part B:Methodological,2008,42(2):83-98.
[41]Bekhor S, Reznikova L, Toledo T. Application of Cross-Nested Logit Route Choice Model in Stochastic User Equilibrium Traffic Assignment [J]. Transportation Research Record:Journal of the Transportation Research Board,2007,2003(1):41-49.
[42]Pravinvongvuth S, Chen A. Adaptation of the Paired Combinatorial Logit Model to the Route Choice Problem [J]. Transportmetrica,2005,1(3):223-240.
[43]王卫杰,王炜.基于配对组合logit模型的路线选择[J].东南大学学报(自然科学版),2010,40(4)：844-847.
[44]李军,赖信君,余志.基于Probit等效阻抗的配对组合Logit路径选择模型[J].交通运输系统工程与信息,2013,13(4)：100-105,148.
[45]Prashker J N, Bekhor S. Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models [J]. Transportation Research Record:Journal of the Transportation Research Board,1999,1676(1):145-152.
[46]邵春福.交通规划原理[M].北京：中国铁道出版社,2004.
[47]Wardrop J G. Some Theoretical Aspects of Road Traffic Research [C]. ICE Proceedings: Engineering Divisions. Thomas Telford,1952:325-362.
[48]Beckmann M, McGuire C B, Winsten C B. Studies in the Economics of Transportation [R], 1956.
[49]LeBlanc L J, Morlok E K, Pierskalla W P. An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem [J]. Transportation Research,1975,9(5):309-318.
[50]Sheffi Y, Powell W B. An Algorithm for the Equilibrium Assignment Problem with Random Link Times [J]. Networks,1982,12(2):191-207.
[51]Sheffi Y. Urban Transportation Networks:Equilibrium Analysis with Mathematical Programming Methods [M]. Prentice-Hall,1985.
[52]杨清华,贺国光,马寿峰.对动态交通分配的反思[J].系统工程,2000,18(1)：49-54,20.
[53]Merchant D K, Nemhauser G L. A Model and an Algorithm for the Dynamic Traffic Assignment Problems [J]. Transportation Science,1978,12(3):183-199.
[54]Merchant D K, Nemhauser G L. Optimal ity Conditions for a Dynamic Traffic Assignment Model [J]. Transportation Science,1978,12(3):200-207.
[55]Carey M, Subrahmanian E. An Approach to Modelling Time-Varying Flows On Congested Networks [J]. Transportation Research Part B:Methodological,2000,34(3):157-183.
[56]Ziliaskopoulos A K. A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem [J]. Transportation science,2000,34(1):37-49.
[57]Friesz T L, Luque J, Tobin R L, Wie B. Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem [J]. Operations Research,1989,37(6):893-901.
[58]Ran B, Boyce D E, LeBlanc L J. A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models [J]. Operations Research,1993,41(1):192-202.
[59]Ran B, Boyce D E. A Link-Based Variational Inequality Formulation of Ideal Dynamic User-Optimal Route Choice Problem [J]. Transportation Research Part C:Emerging Technologies,1996,4(1):1-12.
[60]Chen H, Hsueh C. A Model and an Algorithm for the Dynamic User-Optimal Route Choice Problem [J]. Transportation Research Part B:Methodological,1998,32(3):219-234.
[61]Mahmassani H S, Peeta S. System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic Network [M]. Urban Traffic Networks, Springer,1995:3-37.
[62]Peeta S, Mahmassani H S. System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks [J]. Annals of Operations Research,1995,60(1):81-113.
[63]Smith M J. A New Dynamic Traffic Model and the Existence and Calculation of Dynamic User Equilibria On Congested Capacity-Constrained Road Networks [J]. Transportation Research PartB:Methodological,1993,27(1):49-63.
[64]杜豫川,孙立军,黄仕进.基于有限元方法的连续型交通分配模型解法[J].同济大学学报(自然科学版),2005,33(1)：58-62.
[65]Vaughan R. Urban Spatial Traffic Patterns [M].London, Pion,1987.
[66]Wong S C. An Alternative Formulation of D'Este's Trip Assignment Model [J]. Transportation Research Part B:Methodological,1994,28(3):187-196.
[67]Lam T N, Newell G F. Flow Dependent Traffic Assignment On a Circular City [J]. Transportation Science,1967,1(4):318-361.
[68]Taguchi A, Iri M. Continuum Approximation to Dense Networks and its Application to the Analysis of Urban Road Networks [M]. Springer,1982:178-217.
[69]Wong S C, Lee C K, Tong C O. Finite Element Solution for the Continuum Traffic Equilibrium Problems [J]. International Journal for Numerical Methods in Engineering,1998,43(7): 1253-1273.
[70]黄海军.城市交通网络平衡分析：理论与实践[M].北京：人民交通出版社,1994.
[71]Babonneau F, Vial J. An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands [J]. Transportation Science,2008,42(2):249-260.
[72]Rosa A, Maher M. Stochastic User Equilibrium Traffic Assignment with Multiple User Classes and Elastic Demand [C]. The Proceedings of the 13 th Mini-Euro Conference and 9 th Meeting of the Euro Working Group on Transportation, Bari, Italy, Citeseer,2002.
[73]Nagurney A, Dong J. A Multiclass, Multicriteria Traffic Network Equilibrium Model with Elastic Demand [J]. Transportation Research Part B:Methodological,2002,36(5):445-469.
[74]Meng Q, Liu Z. Mathematical Models and Computational Algorithms for Probit-Based Asymmetric Stochastic User Equilibrium Problem with Elastic Demand [J]. Transportmetrica, 2012,8(4):261-290.
[75]李志纯,黄海军.弹性需求下的组合出行模型与求解算法[J].中国公路学报,2005,18(3)：94-98.
[76]李志纯,朱道立.能力约束下的停车行为模型及其求解算法[J].中国公路学报,2007,20(5)：89-94.
[77]Daganzo C F. Stochastic Network Equilibrium with Multiple Vehicle Types and Asymmetric, Indefinite Link Cost Jacobians [J]. Transportation Science,1983,17(3):282-300.
[78]韩印,袁鹏程.多用户多方式混合随机交通平衡分配模型[J].交通运输工程学报,2008,8(1)：97-101.
[79]要甲,史峰,周钊,邓连波.基于出行时间预算的多模式多类用户城市交通均衡分析[J].中南大学学报(自然科学版),2011,42(11)：3572-3577.
[80]胡文君,周溪召.基于交叉巢式Logit的多用户多模式随机用户均衡模型[J].中国公路学报,2012,25(4)：133-140.
[81]胡文君,周溪召.基于成对组合Logit的多用户多模式随机用户均衡模型[J].系统工程理论与实践,2013,33(5)：1318-1326.
[82]熊伟,严新平.一种多模式下考虑排放的交通分配模型及其算法研究[J].公路交通科技,2009,26(9)：112-115.
[83]杨文国,高自友.考虑环境因素的广义用户平衡和广义系统最优配流模型[J].中国公路学报,2003,16(4)：72-76.
[84]钟绍鹏,林锦山,邓卫ATIS和恶劣天气下的随机交通分配模型[J].系统工程理论与实践,2013,33(5)：1327-1334.
[85]李昕,刘澜,戢晓峰ATIS影响下的基于广义成本的随机用户平衡模型[J].交通运输系统工程与信息,2009,9(2)：50-55.
[86]熊轶,黄海军,李志纯.交通信息系统作用下的随机用户均衡模型与演进[J].交通运输系统工程与信息,2003,3(3)：44-48.
[87]张波,隽志才,林徐勋.基于累积前景理论的随机用户均衡交通分配模型[J].西南交通大学学报,2011,46(5)：868-874.
[88]张波,隽志才,林徐勋.基于累积前景理论的出发时间选择SDUO模型[J].管理工程学报,2013,27(1)：68-76.
[89]徐红利,周晶,徐薇.基于累积前景理论的随机网络用户均衡模型[J].管理科学学报,2011,14(7)：1-7,54.
[90]王倩,周晶,徐薇.基于累积前景理论考虑路网通行能力退化的用户均衡模型[J].系统工程理论与实践,2013,33(6)：1563-1569.
[91]Evans S P. Derivation and Analysis of some Models for Combining Trip Distribution and Assignment [J]. Transportation Research,1976,10(1):37-57.
[92]Florian M, Nguyen S. A Combined Trip Distribution Modal Split and Trip Assignment Model [J]. Transportation Research,1978,12(4):241-246.
[93]Maher M. Algorithms for Logit-Based Stochastic User Equilibrium Assignment [J]. Transportation Research Part B:Methodological,1998,32(8):539-549.
[94]Liu H X, He X, He B. Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem [J]. Networks and Spatial Economics,2009,9(4):485-503.
[95]Chen M, Alfa A S. Algorithms for Solving Fisk's Stochastic Traffic Assignment Model [J]. Transportation Research Part B:Methodological,1991,25(6):405-412.
[96]Leurent F M. Curbing the Computational Difficulty of the Logit Equilibrium Assignment Model [J]. Transportation Research Part B:Methodological,1997,31(4):315-326.
[97]Damberg O, Lundgren J T, Patriksson M. An Algorithm for the Stochastic User Equilibrium Problem [J]. Transportation Research Part B:Methodological,1996,30(2):115-131.
[98]Bekhor S, Toledo T. Investigating Path-Based Solution Algorithms to the Stochastic User Equilibrium Problem [J]. Transportation Research Part B:Methodological,2005,39(3): 279-295.
[99]Chen A, Ryu S, Xu X, Choi K. Computation and Application of the Paired Combinatorial Logit Stochastic User Equilibrium Problem [J]. Computers & Operations Research,2014,43:68-77.
[100]Bekhor S, Prashker J N. Stochastic User Equilibrium Formulation for Generalized Nested Logit Model [J]. Transportation Research Record:Journal of the Transportation Research Board,2001,1752(1):84-90.
[101]史峰,罗端高.降级路网的多类用户均衡分配模型及求解算法[J].交通运输系统工程与信息,2008,8(4)：70-76.
[102]余孝军,黄海军,刘天亮.固定需求网络中多用户类随机均衡的效率损失[J].交通运输系统工程与信息,2009,9(4)：83-89.
[103]何胜学.基于出行时间预算的多用户交通分配模型及算法[J].公路交通科技,2009,26(5)：107-111.116.
[104]吕彪,蒲云,刘海旭.多用户类型弹性需求随机期望-超额用户平衡模型[J].西南交通大学学报,2012,47(3)：516-525.
[105]张天然,钱红波,赵娅丽,叶亮.双准则交通分配和方式划分相结合的网络均衡[J].同济大学学报(自然科学版),2007,35(10)：1363-1367,1389.
[106]刘伟铭,黄亚飞.多车型多准则SUE模型及在通行费清分中的应用[J].华南理工大学学报(自然科学版),2005,33(12)：70-74.
[107]刘伟铭,黄亚飞.联网收费情况下的多车型多准则交通均衡模型与算法[J].土木工程学报,2004,37(10)：104-110.
[108]Dafermos S C. A Multicriteria Route-Choice Traffic Equilibrium Model [R]. Lefchetz Center for Dynamical Systems, Brown University, Providence, RI,1981.
[109]Marcotte P, Zhu D. An Efficient Algorithm for a Bicriterion Traffic Assignment Problem [M]. Advanced methods in transportation analysis, Springer,1996:63-73.
[110]Nagurney A. A Multiclass, Multicriteria Traffic Network Equilibrium Model [J]. Mathematical and Computer Modelling,2000,32(3):393-411.
[111]Yang H, Huang H. The Multi-Class, Multi-Criteria Traffic Network Equilibrium and Systems Optimum Problem [J]. Transportation Research Part B:Methodological,2004,38(1):1-15.
[112]Huang H, Li Z. A Multiclass, Multicriteria Logit-Based Traffic Equilibrium Assignment Model Under ATIS [J]. European Journal of Operational Research,2007,176(3):1464-1477.
[113]郭仁拥,黄海军.基于ATIS的多用户多准则随机均衡交通配流演化模型[J].中国公路学报,2008,21(5)：87-90.
[114]徐兵,朱道立.多用户多准则固定需求随机交通均衡变分模型[J].公路交通科技,2007,24(4)：129-133.
[115]徐兵,朱道立.多用户多准则弹性需求随机交通均衡变分模型[J].西南交通大学学报,2008,43(1)：114-119.
[116]高自友,宋一凡,四兵锋.城市交通连续平衡网络设计：理论与方法[M].北京：中国铁道出版社,2000.
[117]Gao Z, Wu J, Sun H. Solution Algorithm for the Bi-Level Discrete Network Design Problem [J]. Transportation Research Part B:Methodological,2005,39(6):479-495.
[118]Chen M, Alfa A S. A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach [J]. Transportation Science,1991,25(3):215-224.
[119]Zhang H, Gao Z. Two-Way Road Network Design Problem with Variable Lanes [J]. Journal of Systems Science and Systems Engineering,2007,16(1):50-61.
[120]Cantarella G E, Pavone G, Vitetta A. Heuristics for Urban Road Network Design:Lane Layout and Signal Settings [J]. European Journal of Operational Research,2006,175(3):1682-1695.
[121]Zhang H, Gao Z. Bilevel Programming Model and Solution Method for Mixed Transportation Network Design Problem [J]. Journal of Systems Science and Complexity,2009,22(3): 446-459.
[122]孙杨,宋瑞,何世伟,陈强.混合交通网络设计及免疫克隆退火算法求解研究[J].交通运输系统工程与信息,2009,9(3)：103-108.
[123]陈群,姚加林.混合交通网络设计问题的迭代降维算法[J].东南大学学报(英文版),2012,28(2)：236-239.
[124]Abdulaal M, LeBlanc L J. Continuous Equilibrium Network Design Models [J]. Transportation Research Part B:Methodological,1979,13(1):19-32.
[125]Tan H N, Gershwin S B, Athans M. Hybrid Optimization in Urban Traffic Networks [R].1979.
[126]Suwansirikul C, Friesz T L, Tobin R L. Equilibrium Decomposed Optimization:A Heuristic for the Continuous Equilibrium Network Design Problem [J]. Transportation science,1987, 21(4):254-263.
[127]Yang H. Sensitivity Analysis for the Elastic-Demand Network Equilibrium Problem with Applications [J]. Transportation Research Part B:Methodological,1997,31(1):55-70.
[128]宋一凡,高自友.求解连续平衡网络设计问题近似解的启发式算法[J].北京交通大学学报,1998,22(6)：19-24,28.
[129]Meng Q, Yang H, Bell M. An Equivalent Continuously Differentiable Model and a Locally Convergent Algorithm for the Continuous Network Design Problem [J]. Transportation Research Part B:Methodological,2001,35(1):83-105.
[130]Mathew T V, Sharma S. Capacity Expansion Problem for Large Urban Transportation Networks [J]. Journal of Transportation Engineering,2009,135(7):406-415.
[131]Chiou S. Bilevel Programming for the Continuous Transport Network Design Problem [J]. Transportation Research Part B:Methodological,2005,39(4):361-383.
[132]杨进,徐猛,高自友.求解连续网络设计问题的模拟退火算法灵敏度分析[J].交通运输系统工程与信息,2009,9(3)：64-70.
[133]Wang D Z, Lo H K. Global Optimum of the Linearized Network Design Problem with Equilibrium Flows [J]. Transportation Research Part B:Methodological,2010,44(4):482-492.
[134]Davis G A. Exact Local Solution of the Continuous Network Design Problem Via Stochastic User Equilibrium Assignment [J]. Transportation Research Part B:Methodological,1994,28(1): 61-75.
[135]Lim Y, Heydecker B G, Lee S. A Continuous Network Design Model in Stochastic User Equilibrium Based On Sensitivity Analysis [J]. Journal of advanced transportation,2005,39(1): 63-79.
[136]许良,高自友.基于路段能力可靠性的城市交通网络设计[J].中国公路学报,2006,19(2)：86-90.
[137]Wang G M, Gao Z Y, Xu M. An MPEC Formulation and its Cutting Constraint Algorithm for Continuous Network Design Problem with Multi-User Classes [J]. Applied Mathematical Modelling,2014,38(5):1846-1858.
[138]高自友,张好智,孙会君.城市交通网络设计问题中双层规划模型、方法及应用[J].交通运输系统工程与信息,2004,4(1)：35-44.
[139]Yang H, H. Bell M G. Models and Algorithms for Road Network Design:A Review and some New Developments [J]. Transport Reviews,1998,18(3):257-278.
[140]鲍月,徐猛,高自友.次优拥挤收费的随机双目标模型[J].北京交通大学学报,2013,37(2)：129-133.
[141]Pigou A C. The Economics of Welfare [M].Transaction Publishers,1924.
[142]Knight F H. Some Fallacies in the Interpretation of Social Cost [J]. The Quarterly Journal of Economics,1924,38(4):582-606.
[143]张小宁.交通网络拥挤收费原理[M].合肥：合肥工业大学出版社,2009.
[144]Vickrey W S. Congestion Theory and Transport Investment [J]. The American Economic Review,1969:251-260.
[145]Arnott R, de Palma A, Lindsey R. The Welfare Effects of Congestion Tolls with Heterogeneous Commuters [J]. Journal of Transport Economics and Policy,1994:139-161.
[146]Yang H, Hai-Jun H. Analysis of the Time-Varying Pricing of a Bottleneck with Elastic Demand Using Optimal Control Theory [J]. Transportation Research Part B:Methodological, 1997,31(6):425-440.
[147]Wie B, Tobin R L. Dynamic Congestion Pricing Models for General Traffic Networks [J]. Transportation Research Part B:Methodological,1998,32(5):313-327.
[148]Yang H, Meng Q. Departure Time, Route Choice and Congestion Toll in a Queuing Network with Elastic Demand [J]. Transportation Research Part B:Methodological,1998,32(4): 247-260.
[149]Teodorovic D, Edara P. A Real-Time Road Pricing System:The Case of a Two-Link Parallel Network [J]. Computers& operations research,2007,34(1):2-27.
[150]Yang H, Huang H. Principle of Marginal-Cost Pricing:How Does It Work in a General Road Network? [J]. Transportation Research Part A:Policy and Practice,1998,32(1):45-54.
[151]Guo X, Yang H. User Heterogeneity and Bi-Criteria System Optimum [J]. Transportation Research Part B:Methodological,2009,43(4):379-390.
[152]Clark A, Sumalee A, Shepherd S, Connors R. On the Existence and Uniqueness of First Best Tolls in Networks with Multiple User Classes and Elastic Demand [J]. International Journal of Control,2009,5(2):141-157.
[153]王听,黄海军.多用户弹性需求网络的双准则系统最优交通分配[J].系统工程理论与实践,2011,(S1)：94-102.
[154]Yang H. System Optimum, Stochastic User Equilibrium, and Optimal Link Tolls [J]. Transportation Science,1999,33(4):354-360.
[155]Maher M, Stewart K, Rosa A. Stochastic Social Optimum Traffic Assignment [J]. Transportation Research Part B:Methodological,2005,39(8):753-767.
[156]Stewart K. Tolling Traffic Links Under Stochastic Assignment:Modelling the Relationship Between the Number and Price Level of Tolled Links and Optimal Traffic Flows [J]. Transportation Research Part A:Policy and Practice,2007,41(7):644-654.
[157]Yang H, Zhang X. Existence of Anonymous Link Tolls for System Optimum On Networks with Mixed Equilibrium Behaviors [J]. Transportation Research Part B:Methodological,2008, 42(2):99-112.
[158]Zhang X, Yang H, Huang H. Multiclass Multicriteria Mixed Equilibrium On Networks and Uniform Link Tolls for System Optimum [J]. European Journal of Operational Research,2008, 189(1):146-158.
[159]Sumalee A, Xu W. First-Best Marginal Cost Toll for a Traffic Network with Stochastic Demand [J]. Transportation Research Part B:Methodological,2011,45(1):41-59.
[160]Verhoef E T. Second-Best Congestion Pricing in General Networks. Heuristic Algorithms for Finding Second-Best Optimal Toll Levels and Toll Points [J]. Transportation Research Part B: Methodological,2002,36(8):707-729.
[161]Meng Q, Lee D, Cheu R L, Yang H. Logit-Based Stochastic User Equilibrium Problem for Entry-Exit Toll Schemes [J]. Journal of transportation engineering,2004,130(6):805-813.
[162]Yang H, Bell M G. Traffic Restraint, Road Pricing and Network Equilibrium [J]. Transportation Research Part B:Methodological,1997,31(4):303-314.
[163]张华歆,周溪召.多模式交通网络的拥挤道路收费双层规划模型[J].系统工程理论方法应用,2005,14(6)：546-551.
[164]吕彪,蒲云,刘海旭.考虑路网可靠性和空间公平性的次优拥挤收费模型[J].运筹与管理,2013,(2)：188-194.
[165]吕彪,蒲云,刘海旭.基于遗传算法的随机路网次优拥挤收费模型[J].计算机工程,2013,39(8)：257-261.
[166]Ben-Akiva M E, Lerman S R. Discrete Choice Analysis:Theory and Application to Travel Demand [M].MIT press,1985.
[167]Ramming M S. Network Knowledge and Route Choice [D]. Massachusetts Institute of Technology, 2001.
[168]Dial R B. A Probabilistic Multipath Traffic Assignment Model Which Obviates Path Enumeration [J]. Transportation research,1971,5(2):83-111.
[169]Bell M G. Alternatives to Dial's Logit Assignment Algorithm [J]. Transportation Research Part B:Methodological,1995,29(4):287-295.
[170]Dijkstra E W. A Note on Two Problems in Connection with Graphs [J]. Numerical Mathematics,1959,1:269-271.
[171]Shier D R. On Algorithms for Finding the K-shortest Paths in a Network [J]. Networks,1979, 9:195-214.
[172]Eppstein D. Finding the K Shortest Paths [J]. Journal of the Society for Industrial and Applied Mathematics,1998,28(2):652-673.
[173]Ben-Akiva M, Bergman M J, Daly A J, Ramaswamy R. Modeling Inter-Urban Route Choice Behaviour [C]. Proceedings of the 9th International Symposium on Transportation and Traffic Theory, VNU Press, Utrecht,1984:299-330.
[174]Azevedo J A, Santos Costa M E O, Silvestre Madera J J E R, Vieira Martins E Q. An Algorithm for the Ranking of Shortest Paths [J]. European Journal of Operational Research, 1993,69(1):97-106.
[175]De la Barra T, Perez B, Anez J. Multidimensional Path Search and Assignment [C]. Proceedings of the 21st PTRC Summer Annual Meeting. Manchester,England,1993:307-319.
[176]Robbins H, Monro S. A Stochastic Approximation Method [J]. The annals of mathematical statistics,1951:400-407.
[177]Blum J R. Multidimensional Stochastic Approximation Methods [J]. The Annals of Mathematical Statistics,1954:737-744.
[178]Leblanc L J. Mathematical Programming Algorithms for Large-Scale Network Equilibrium and Network Design Problems [D]. Northwestern University,1973.
[179]Bar-Gera H. Transportation Network Test Problems,2001.< http://www.bgu.ac.il/-bargera/tntp/>.
[180]龚峻峰,余志,何兆成.一种基于路段惩罚法的合理路径集生成算法[J].公路交通科技,2009,26(9)：107-111,124.
[181]Ben-Akiva M, Ramming S. Lecture Notes:Discrete Choice Models of Traveler Behavior in Networks [J]. Prepared for Advanced Methods for Planning and Management of Transportation Networks. Capri, Italy,1998,25.
[182]Chu C. A Paired Combinatorial Logit Model for Travel Demand Analysis [C]. TRANSPORT POLICY, MANAGEMENT & TECHNOLOGY TOWARDS 2001:SELECTED PROCEEDINGS OF THE FIFTH WORLD CONFERENCE ON TRANSPORT RESEARCH, 1989.
[183]李桂玲.双层规划中几个问题的研究[D].山东科技大学,2005.
[184]Bracken J, McGill J T. Mathematical Programs with Optimization Problems in the Constraints [J]. Operations Research,1973,21(1):37-44.
[185]Candler W, Norton R. Multilevel Programming [R]. Technical Report 20, World Bank Development Research Center, Washington D.C., USA,1977.
[186]蔡金,高自友.求解城市交通连续平衡网络设计问题的混合算法[J].北方交通大学学报,2002,26(2)：71-76.
[187]邢文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,1999.
[188]史峰,王辉,郁磊,胡斐MATLAB智能算法30个案例分析[M].北京：北京航空航天大学出版社,2011.
[189]Holland J H. Adaptation in Natural and Artificial Systems:An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence [M].U Michigan Press,1975.
[190]周明孙树栋.遗传算法原理及应用[M].北京：国防工业出版社,1999.
[191]Faghri A, Aneja S. Artificial Neural Network-Based Approach to Modeling Trip Production [J]. Transportation Research Record:Journal of the Transportation Research Board,1996, 1556(1):131-136.
[192]Li X, Soler-Flores F, Gonzalez-Cancelas N, Orive A C. Study on Forecasting the Berthing Time of the Ships in the Port [J]. Journal of Applied Sciences,2013,13(11):1970-1974.
[193]Li X, Lang M. Study On the Combination Prediction Method in Railway Freight Volume Prediction [J]. Advances in Transportation Studies,2013, Special Issue; 83-94.
[194]史峰,李志纯.拥挤道路使用收费的理论构架[J].交通运输工程学报,2002,2(2)：78-82.
[195]黄海军.拥挤道路使用收费的研究进展和实践难题[J].中国科学基金,2003,17(4)：198-203.
[196]Metropolis N, Rosenbluth A W, Rosenbluth M N, Teller A H, Teller E. Equation of State Calculations by Fast Computing Machines [J]. The journal of chemical physics,1953,21(6): 1087-1092.
[197]刘灿齐.现代交通规划学[M].北京：人民交通出版社,2001.
[2]Braess P D D. Uber Ein Paradoxon Aus Der Verkehrsplanung [J]. Unternehmensforschung,1968, 12(1):258-268.
[3]聂冲,贾生华.离散选择模型的基本原理及其发展演进评介[J].数量经济技术经济研究,2005,(11)：151-159.
[4]Luce D. Individual Choice Behavior [M].New York:John Wiley and Sons,1959.
[5]McFadden D. Conditional Logit Analysis of Qualitative Choice Behavior [M]. in P.Zarembka ed. New York:Academic Press,1974.
[6]Bhat C R. Analysis of Travel Mode and Departure Time Choice for Urban Shopping Trips [J]. Transportation Research Part B:Methodological,1998,32(6):361-371.
[7]Small K A. Approximate Generalized Extreme Value Models of Discrete Choice [J]. Journal of Econometrics,1994,62(2):351-382.
[8]Swait J. Choice Set Generation within the Generalized Extreme Value Family of Discrete Choice Models [J]. Transportation Research Part B:Methodological,2001,35(7):643-666.
[9]周嘉男,何丹恒,罗霞.基于Logit模型的路径选择及交通流分配[J].大连交通大学学报,2013,(1)：31-34.
[10]Vega A, Reynolds-Feighan A. A Methodological Framework for the Study of Residential Location and Travel-To-Work Mode Choice Under Central and Suburban Employment Destination Patterns [J]. Transportation Research Part A:Policy and Practice,2009,43(4): 401-419.
[11]杨励雅,李霞,邵春福.居住地,出行方式与出发时间联合选择的交叉巢式Logit模型[J].同济大学学报：自然科学版,2013,40(11)：1647-1653.
[12]Fisk C. Some Developments in Equilibrium Traffic Assignment [J]. Transportation Research Part B:Methodological,1980,14(3):243-255.
[13]Train K E. Discrete Choice Methods with Simulation [M]. Second ed. United States of America: Cambridge University Press,2003.
[14]关宏志.非集计模型：交通行为分析的工具[M].北京：人民交通出版社,2004.
[15]Daganzo C F, Sheffi Y. On Stochastic Models of Traffic Assignment [J]. Transportation Science,1977,11 (3):253-274.
[16]Prashker J N, Bekhor S. Route Choice Models Used in the Stochastic User Equilibrium Problem:A Review [J]. Transport reviews,2004,24(4):437-463.
[17]McFadden D, Train K. Mixed MNL Models for Discrete Response [J]. Journal of applied Econometrics,2000,15(5):447-470.
[18]Cascetta E, Nuzzolo A, Russo F, Vitetta A. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems:Specification and some Calibration Results for Interurban Networks [C]. Proceedings of the 13th International Symposium on Transportation and Traffic Theory. Pergamon,1996:697-711.
[19]Ben-Akiva M, Bierlaire M. Discrete Choice Methods and their Applications to Short Term Travel Decisions [M]. Handbook of transportation science. Springer,1999:5-33.
[20]Cascetta E, Russo F, Viola F A, Vitetta A. A Model of Route Perception in Urban Road Networks [J]. Transportation Research Part B:Methodological,2002,36(7):577-592.
[21]Bovy P H, Bekhor S, Prato C G. The Factor of Revisited Path Size:Alternative Derivation [J]. Transportation Research Record:Journal of the Transportation Research Board,2008,2076(1): 132-140.
[22]Prato C G, Bekhor S. Modeling Route Choice Behavior:How Relevant is the Composition of Choice Set? [J]. Transportation Research Record:Journal of the Transportation Research Board, 2007,2003(1):64-73.
[23]Bliemer M C, Bovy P H. Impact of Route Choice Set On Route Choice Probabilities [J]. Transportation Research Record:Journal of the Transportation Research Board,2008,2076(1): 10-19.
[24]王力,王川久,沈晓蓉,范跃祖.基于模糊旅行时间的动态交通分配模型[J].北京航空航天大学学报,2006,31(10)：1149-1152.
[25]Zhou Z, Chen A, Bekhor S. C-Logit Stochastic User Equilibrium Model:Formulations and Solution Algorithm [J]. Transportmetrica,2012,8(1):17-41.
[26]Bekhor S, Prato C G. Effects of Choice Set Composition in Route Choice Modeling [C]. Proceedings of the 11th International Conference on Travel Behavior Research. Kyoto, Japan, 2006.
[27]Hoogendoorn-Lanser S, van Ness R, Bovy P H. Path Size and Overlap in Multi-Modal Transport Networks [C]. Transportation and Traffic Theory. Flow, Dynamics and Human Interaction.16th International Symposium on Transportation and Traffic Theory,2005.
[28]邱松林,程琳,许项东.基于路径长度的Logit型随机用户均衡模型[J].东南大学学报(自然科学版),2012,42(1)：173-176.
[29]Cascetta E, Papola A. Random Utility Models with Implicit Availability/Perception of Choice Alternatives for the Simulation of Travel Demand [J]. Transportation Research Part C: Emerging Technologies,2001,9(4):249-263.
[30]McFadden D. Modelling the Choice of Residential Location [M].Institute of Transportation Studies, University of California,1978.
[31]Forinash C V, Koppelman F S. Application and Interpretation of Nested Logit Models of Intercity Mode Choice [J]. Transportation Research Record,1993,1413:98-106.
[32]Vovsha P, Bekhor S. Link-Nested Logit Model of Route Choice:Overcoming Route Overlapping Problem [J]. Transportation Research Record:Journal of the Transportation Research Board,1998,1645(1):133-142.
[33]Koppelman F S, Wen C. The Paired Combinatorial Logit Model:Properties, Estimation and Application [J]. Transportation Research Part B:Methodological,2000,34(2):75-89.
[34]Wen C, Koppelman F S. The Generalized Nested Logit Model [J]. Transportation Research Part B:Methodological,2001,35(7):627-641.
[35]刘振,周溪召.巢式Logit模型在交通方式选择行为中的应用[J].上海海事大学学报,2006,27(3)：66-70.
[36]南娟,王喆.基于巢式Logit模型的机场吞吐量预测方法[J].科学技术与工程,2008,8(24)：6572-6575,6602.
[37]张欢,卢毅,史峰,朱东铁.基于巢式Logit模型的超限车辆出行选择行为研究[J].交通运输 系统工程与信息,2012,12(6)：113-118.
[38]Papola A. Some Developments On the Cross-Nested Logit Model [J]. Transportation Research Part B:Methodological,2004,38(9):833-851.
[39]Abbe E, Bierlaire M, Toledo T. Normalization and Correlation of Cross-Nested Logit Models [J]. Transportation Research Part B:Methodological,2007,41(7):795-808.
[40]Marzano V, Papola A. On the Covariance Structure of the Cross-Nested Logit Model [J]. Transportation Research Part B:Methodological,2008,42(2):83-98.
[41]Bekhor S, Reznikova L, Toledo T. Application of Cross-Nested Logit Route Choice Model in Stochastic User Equilibrium Traffic Assignment [J]. Transportation Research Record:Journal of the Transportation Research Board,2007,2003(1):41-49.
[42]Pravinvongvuth S, Chen A. Adaptation of the Paired Combinatorial Logit Model to the Route Choice Problem [J]. Transportmetrica,2005,1(3):223-240.
[43]王卫杰,王炜.基于配对组合logit模型的路线选择[J].东南大学学报(自然科学版),2010,40(4)：844-847.
[44]李军,赖信君,余志.基于Probit等效阻抗的配对组合Logit路径选择模型[J].交通运输系统工程与信息,2013,13(4)：100-105,148.
[45]Prashker J N, Bekhor S. Stochastic User-Equilibrium Formulations for Extended-Logit Assignment Models [J]. Transportation Research Record:Journal of the Transportation Research Board,1999,1676(1):145-152.
[46]邵春福.交通规划原理[M].北京：中国铁道出版社,2004.
[47]Wardrop J G. Some Theoretical Aspects of Road Traffic Research [C]. ICE Proceedings: Engineering Divisions. Thomas Telford,1952:325-362.
[48]Beckmann M, McGuire C B, Winsten C B. Studies in the Economics of Transportation [R], 1956.
[49]LeBlanc L J, Morlok E K, Pierskalla W P. An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem [J]. Transportation Research,1975,9(5):309-318.
[50]Sheffi Y, Powell W B. An Algorithm for the Equilibrium Assignment Problem with Random Link Times [J]. Networks,1982,12(2):191-207.
[51]Sheffi Y. Urban Transportation Networks:Equilibrium Analysis with Mathematical Programming Methods [M]. Prentice-Hall,1985.
[52]杨清华,贺国光,马寿峰.对动态交通分配的反思[J].系统工程,2000,18(1)：49-54,20.
[53]Merchant D K, Nemhauser G L. A Model and an Algorithm for the Dynamic Traffic Assignment Problems [J]. Transportation Science,1978,12(3):183-199.
[54]Merchant D K, Nemhauser G L. Optimal ity Conditions for a Dynamic Traffic Assignment Model [J]. Transportation Science,1978,12(3):200-207.
[55]Carey M, Subrahmanian E. An Approach to Modelling Time-Varying Flows On Congested Networks [J]. Transportation Research Part B:Methodological,2000,34(3):157-183.
[56]Ziliaskopoulos A K. A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem [J]. Transportation science,2000,34(1):37-49.
[57]Friesz T L, Luque J, Tobin R L, Wie B. Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem [J]. Operations Research,1989,37(6):893-901.
[58]Ran B, Boyce D E, LeBlanc L J. A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models [J]. Operations Research,1993,41(1):192-202.
[59]Ran B, Boyce D E. A Link-Based Variational Inequality Formulation of Ideal Dynamic User-Optimal Route Choice Problem [J]. Transportation Research Part C:Emerging Technologies,1996,4(1):1-12.
[60]Chen H, Hsueh C. A Model and an Algorithm for the Dynamic User-Optimal Route Choice Problem [J]. Transportation Research Part B:Methodological,1998,32(3):219-234.
[61]Mahmassani H S, Peeta S. System Optimal Dynamic Assignment for Electronic Route Guidance in a Congested Traffic Network [M]. Urban Traffic Networks, Springer,1995:3-37.
[62]Peeta S, Mahmassani H S. System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks [J]. Annals of Operations Research,1995,60(1):81-113.
[63]Smith M J. A New Dynamic Traffic Model and the Existence and Calculation of Dynamic User Equilibria On Congested Capacity-Constrained Road Networks [J]. Transportation Research PartB:Methodological,1993,27(1):49-63.
[64]杜豫川,孙立军,黄仕进.基于有限元方法的连续型交通分配模型解法[J].同济大学学报(自然科学版),2005,33(1)：58-62.
[65]Vaughan R. Urban Spatial Traffic Patterns [M].London, Pion,1987.
[66]Wong S C. An Alternative Formulation of D'Este's Trip Assignment Model [J]. Transportation Research Part B:Methodological,1994,28(3):187-196.
[67]Lam T N, Newell G F. Flow Dependent Traffic Assignment On a Circular City [J]. Transportation Science,1967,1(4):318-361.
[68]Taguchi A, Iri M. Continuum Approximation to Dense Networks and its Application to the Analysis of Urban Road Networks [M]. Springer,1982:178-217.
[69]Wong S C, Lee C K, Tong C O. Finite Element Solution for the Continuum Traffic Equilibrium Problems [J]. International Journal for Numerical Methods in Engineering,1998,43(7): 1253-1273.
[70]黄海军.城市交通网络平衡分析：理论与实践[M].北京：人民交通出版社,1994.
[71]Babonneau F, Vial J. An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands [J]. Transportation Science,2008,42(2):249-260.
[72]Rosa A, Maher M. Stochastic User Equilibrium Traffic Assignment with Multiple User Classes and Elastic Demand [C]. The Proceedings of the 13 th Mini-Euro Conference and 9 th Meeting of the Euro Working Group on Transportation, Bari, Italy, Citeseer,2002.
[73]Nagurney A, Dong J. A Multiclass, Multicriteria Traffic Network Equilibrium Model with Elastic Demand [J]. Transportation Research Part B:Methodological,2002,36(5):445-469.
[74]Meng Q, Liu Z. Mathematical Models and Computational Algorithms for Probit-Based Asymmetric Stochastic User Equilibrium Problem with Elastic Demand [J]. Transportmetrica, 2012,8(4):261-290.
[75]李志纯,黄海军.弹性需求下的组合出行模型与求解算法[J].中国公路学报,2005,18(3)：94-98.
[76]李志纯,朱道立.能力约束下的停车行为模型及其求解算法[J].中国公路学报,2007,20(5)：89-94.
[77]Daganzo C F. Stochastic Network Equilibrium with Multiple Vehicle Types and Asymmetric, Indefinite Link Cost Jacobians [J]. Transportation Science,1983,17(3):282-300.
[78]韩印,袁鹏程.多用户多方式混合随机交通平衡分配模型[J].交通运输工程学报,2008,8(1)：97-101.
[79]要甲,史峰,周钊,邓连波.基于出行时间预算的多模式多类用户城市交通均衡分析[J].中南大学学报(自然科学版),2011,42(11)：3572-3577.
[80]胡文君,周溪召.基于交叉巢式Logit的多用户多模式随机用户均衡模型[J].中国公路学报,2012,25(4)：133-140.
[81]胡文君,周溪召.基于成对组合Logit的多用户多模式随机用户均衡模型[J].系统工程理论与实践,2013,33(5)：1318-1326.
[82]熊伟,严新平.一种多模式下考虑排放的交通分配模型及其算法研究[J].公路交通科技,2009,26(9)：112-115.
[83]杨文国,高自友.考虑环境因素的广义用户平衡和广义系统最优配流模型[J].中国公路学报,2003,16(4)：72-76.
[84]钟绍鹏,林锦山,邓卫ATIS和恶劣天气下的随机交通分配模型[J].系统工程理论与实践,2013,33(5)：1327-1334.
[85]李昕,刘澜,戢晓峰ATIS影响下的基于广义成本的随机用户平衡模型[J].交通运输系统工程与信息,2009,9(2)：50-55.
[86]熊轶,黄海军,李志纯.交通信息系统作用下的随机用户均衡模型与演进[J].交通运输系统工程与信息,2003,3(3)：44-48.
[87]张波,隽志才,林徐勋.基于累积前景理论的随机用户均衡交通分配模型[J].西南交通大学学报,2011,46(5)：868-874.
[88]张波,隽志才,林徐勋.基于累积前景理论的出发时间选择SDUO模型[J].管理工程学报,2013,27(1)：68-76.
[89]徐红利,周晶,徐薇.基于累积前景理论的随机网络用户均衡模型[J].管理科学学报,2011,14(7)：1-7,54.
[90]王倩,周晶,徐薇.基于累积前景理论考虑路网通行能力退化的用户均衡模型[J].系统工程理论与实践,2013,33(6)：1563-1569.
[91]Evans S P. Derivation and Analysis of some Models for Combining Trip Distribution and Assignment [J]. Transportation Research,1976,10(1):37-57.
[92]Florian M, Nguyen S. A Combined Trip Distribution Modal Split and Trip Assignment Model [J]. Transportation Research,1978,12(4):241-246.
[93]Maher M. Algorithms for Logit-Based Stochastic User Equilibrium Assignment [J]. Transportation Research Part B:Methodological,1998,32(8):539-549.
[94]Liu H X, He X, He B. Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem [J]. Networks and Spatial Economics,2009,9(4):485-503.
[95]Chen M, Alfa A S. Algorithms for Solving Fisk's Stochastic Traffic Assignment Model [J]. Transportation Research Part B:Methodological,1991,25(6):405-412.
[96]Leurent F M. Curbing the Computational Difficulty of the Logit Equilibrium Assignment Model [J]. Transportation Research Part B:Methodological,1997,31(4):315-326.
[97]Damberg O, Lundgren J T, Patriksson M. An Algorithm for the Stochastic User Equilibrium Problem [J]. Transportation Research Part B:Methodological,1996,30(2):115-131.
[98]Bekhor S, Toledo T. Investigating Path-Based Solution Algorithms to the Stochastic User Equilibrium Problem [J]. Transportation Research Part B:Methodological,2005,39(3): 279-295.
[99]Chen A, Ryu S, Xu X, Choi K. Computation and Application of the Paired Combinatorial Logit Stochastic User Equilibrium Problem [J]. Computers & Operations Research,2014,43:68-77.
[100]Bekhor S, Prashker J N. Stochastic User Equilibrium Formulation for Generalized Nested Logit Model [J]. Transportation Research Record:Journal of the Transportation Research Board,2001,1752(1):84-90.
[101]史峰,罗端高.降级路网的多类用户均衡分配模型及求解算法[J].交通运输系统工程与信息,2008,8(4)：70-76.
[102]余孝军,黄海军,刘天亮.固定需求网络中多用户类随机均衡的效率损失[J].交通运输系统工程与信息,2009,9(4)：83-89.
[103]何胜学.基于出行时间预算的多用户交通分配模型及算法[J].公路交通科技,2009,26(5)：107-111.116.
[104]吕彪,蒲云,刘海旭.多用户类型弹性需求随机期望-超额用户平衡模型[J].西南交通大学学报,2012,47(3)：516-525.
[105]张天然,钱红波,赵娅丽,叶亮.双准则交通分配和方式划分相结合的网络均衡[J].同济大学学报(自然科学版),2007,35(10)：1363-1367,1389.
[106]刘伟铭,黄亚飞.多车型多准则SUE模型及在通行费清分中的应用[J].华南理工大学学报(自然科学版),2005,33(12)：70-74.
[107]刘伟铭,黄亚飞.联网收费情况下的多车型多准则交通均衡模型与算法[J].土木工程学报,2004,37(10)：104-110.
[108]Dafermos S C. A Multicriteria Route-Choice Traffic Equilibrium Model [R]. Lefchetz Center for Dynamical Systems, Brown University, Providence, RI,1981.
[109]Marcotte P, Zhu D. An Efficient Algorithm for a Bicriterion Traffic Assignment Problem [M]. Advanced methods in transportation analysis, Springer,1996:63-73.
[110]Nagurney A. A Multiclass, Multicriteria Traffic Network Equilibrium Model [J]. Mathematical and Computer Modelling,2000,32(3):393-411.
[111]Yang H, Huang H. The Multi-Class, Multi-Criteria Traffic Network Equilibrium and Systems Optimum Problem [J]. Transportation Research Part B:Methodological,2004,38(1):1-15.
[112]Huang H, Li Z. A Multiclass, Multicriteria Logit-Based Traffic Equilibrium Assignment Model Under ATIS [J]. European Journal of Operational Research,2007,176(3):1464-1477.
[113]郭仁拥,黄海军.基于ATIS的多用户多准则随机均衡交通配流演化模型[J].中国公路学报,2008,21(5)：87-90.
[114]徐兵,朱道立.多用户多准则固定需求随机交通均衡变分模型[J].公路交通科技,2007,24(4)：129-133.
[115]徐兵,朱道立.多用户多准则弹性需求随机交通均衡变分模型[J].西南交通大学学报,2008,43(1)：114-119.
[116]高自友,宋一凡,四兵锋.城市交通连续平衡网络设计：理论与方法[M].北京：中国铁道出版社,2000.
[117]Gao Z, Wu J, Sun H. Solution Algorithm for the Bi-Level Discrete Network Design Problem [J]. Transportation Research Part B:Methodological,2005,39(6):479-495.
[118]Chen M, Alfa A S. A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach [J]. Transportation Science,1991,25(3):215-224.
[119]Zhang H, Gao Z. Two-Way Road Network Design Problem with Variable Lanes [J]. Journal of Systems Science and Systems Engineering,2007,16(1):50-61.
[120]Cantarella G E, Pavone G, Vitetta A. Heuristics for Urban Road Network Design:Lane Layout and Signal Settings [J]. European Journal of Operational Research,2006,175(3):1682-1695.
[121]Zhang H, Gao Z. Bilevel Programming Model and Solution Method for Mixed Transportation Network Design Problem [J]. Journal of Systems Science and Complexity,2009,22(3): 446-459.
[122]孙杨,宋瑞,何世伟,陈强.混合交通网络设计及免疫克隆退火算法求解研究[J].交通运输系统工程与信息,2009,9(3)：103-108.
[123]陈群,姚加林.混合交通网络设计问题的迭代降维算法[J].东南大学学报(英文版),2012,28(2)：236-239.
[124]Abdulaal M, LeBlanc L J. Continuous Equilibrium Network Design Models [J]. Transportation Research Part B:Methodological,1979,13(1):19-32.
[125]Tan H N, Gershwin S B, Athans M. Hybrid Optimization in Urban Traffic Networks [R].1979.
[126]Suwansirikul C, Friesz T L, Tobin R L. Equilibrium Decomposed Optimization:A Heuristic for the Continuous Equilibrium Network Design Problem [J]. Transportation science,1987, 21(4):254-263.
[127]Yang H. Sensitivity Analysis for the Elastic-Demand Network Equilibrium Problem with Applications [J]. Transportation Research Part B:Methodological,1997,31(1):55-70.
[128]宋一凡,高自友.求解连续平衡网络设计问题近似解的启发式算法[J].北京交通大学学报,1998,22(6)：19-24,28.
[129]Meng Q, Yang H, Bell M. An Equivalent Continuously Differentiable Model and a Locally Convergent Algorithm for the Continuous Network Design Problem [J]. Transportation Research Part B:Methodological,2001,35(1):83-105.
[130]Mathew T V, Sharma S. Capacity Expansion Problem for Large Urban Transportation Networks [J]. Journal of Transportation Engineering,2009,135(7):406-415.
[131]Chiou S. Bilevel Programming for the Continuous Transport Network Design Problem [J]. Transportation Research Part B:Methodological,2005,39(4):361-383.
[132]杨进,徐猛,高自友.求解连续网络设计问题的模拟退火算法灵敏度分析[J].交通运输系统工程与信息,2009,9(3)：64-70.
[133]Wang D Z, Lo H K. Global Optimum of the Linearized Network Design Problem with Equilibrium Flows [J]. Transportation Research Part B:Methodological,2010,44(4):482-492.
[134]Davis G A. Exact Local Solution of the Continuous Network Design Problem Via Stochastic User Equilibrium Assignment [J]. Transportation Research Part B:Methodological,1994,28(1): 61-75.
[135]Lim Y, Heydecker B G, Lee S. A Continuous Network Design Model in Stochastic User Equilibrium Based On Sensitivity Analysis [J]. Journal of advanced transportation,2005,39(1): 63-79.
[136]许良,高自友.基于路段能力可靠性的城市交通网络设计[J].中国公路学报,2006,19(2)：86-90.
[137]Wang G M, Gao Z Y, Xu M. An MPEC Formulation and its Cutting Constraint Algorithm for Continuous Network Design Problem with Multi-User Classes [J]. Applied Mathematical Modelling,2014,38(5):1846-1858.
[138]高自友,张好智,孙会君.城市交通网络设计问题中双层规划模型、方法及应用[J].交通运输系统工程与信息,2004,4(1)：35-44.
[139]Yang H, H. Bell M G. Models and Algorithms for Road Network Design:A Review and some New Developments [J]. Transport Reviews,1998,18(3):257-278.
[140]鲍月,徐猛,高自友.次优拥挤收费的随机双目标模型[J].北京交通大学学报,2013,37(2)：129-133.
[141]Pigou A C. The Economics of Welfare [M].Transaction Publishers,1924.
[142]Knight F H. Some Fallacies in the Interpretation of Social Cost [J]. The Quarterly Journal of Economics,1924,38(4):582-606.
[143]张小宁.交通网络拥挤收费原理[M].合肥：合肥工业大学出版社,2009.
[144]Vickrey W S. Congestion Theory and Transport Investment [J]. The American Economic Review,1969:251-260.
[145]Arnott R, de Palma A, Lindsey R. The Welfare Effects of Congestion Tolls with Heterogeneous Commuters [J]. Journal of Transport Economics and Policy,1994:139-161.
[146]Yang H, Hai-Jun H. Analysis of the Time-Varying Pricing of a Bottleneck with Elastic Demand Using Optimal Control Theory [J]. Transportation Research Part B:Methodological, 1997,31(6):425-440.
[147]Wie B, Tobin R L. Dynamic Congestion Pricing Models for General Traffic Networks [J]. Transportation Research Part B:Methodological,1998,32(5):313-327.
[148]Yang H, Meng Q. Departure Time, Route Choice and Congestion Toll in a Queuing Network with Elastic Demand [J]. Transportation Research Part B:Methodological,1998,32(4): 247-260.
[149]Teodorovic D, Edara P. A Real-Time Road Pricing System:The Case of a Two-Link Parallel Network [J]. Computers& operations research,2007,34(1):2-27.
[150]Yang H, Huang H. Principle of Marginal-Cost Pricing:How Does It Work in a General Road Network? [J]. Transportation Research Part A:Policy and Practice,1998,32(1):45-54.
[151]Guo X, Yang H. User Heterogeneity and Bi-Criteria System Optimum [J]. Transportation Research Part B:Methodological,2009,43(4):379-390.
[152]Clark A, Sumalee A, Shepherd S, Connors R. On the Existence and Uniqueness of First Best Tolls in Networks with Multiple User Classes and Elastic Demand [J]. International Journal of Control,2009,5(2):141-157.
[153]王听,黄海军.多用户弹性需求网络的双准则系统最优交通分配[J].系统工程理论与实践,2011,(S1)：94-102.
[154]Yang H. System Optimum, Stochastic User Equilibrium, and Optimal Link Tolls [J]. Transportation Science,1999,33(4):354-360.
[155]Maher M, Stewart K, Rosa A. Stochastic Social Optimum Traffic Assignment [J]. Transportation Research Part B:Methodological,2005,39(8):753-767.
[156]Stewart K. Tolling Traffic Links Under Stochastic Assignment:Modelling the Relationship Between the Number and Price Level of Tolled Links and Optimal Traffic Flows [J]. Transportation Research Part A:Policy and Practice,2007,41(7):644-654.
[157]Yang H, Zhang X. Existence of Anonymous Link Tolls for System Optimum On Networks with Mixed Equilibrium Behaviors [J]. Transportation Research Part B:Methodological,2008, 42(2):99-112.
[158]Zhang X, Yang H, Huang H. Multiclass Multicriteria Mixed Equilibrium On Networks and Uniform Link Tolls for System Optimum [J]. European Journal of Operational Research,2008, 189(1):146-158.
[159]Sumalee A, Xu W. First-Best Marginal Cost Toll for a Traffic Network with Stochastic Demand [J]. Transportation Research Part B:Methodological,2011,45(1):41-59.
[160]Verhoef E T. Second-Best Congestion Pricing in General Networks. Heuristic Algorithms for Finding Second-Best Optimal Toll Levels and Toll Points [J]. Transportation Research Part B: Methodological,2002,36(8):707-729.
[161]Meng Q, Lee D, Cheu R L, Yang H. Logit-Based Stochastic User Equilibrium Problem for Entry-Exit Toll Schemes [J]. Journal of transportation engineering,2004,130(6):805-813.
[162]Yang H, Bell M G. Traffic Restraint, Road Pricing and Network Equilibrium [J]. Transportation Research Part B:Methodological,1997,31(4):303-314.
[163]张华歆,周溪召.多模式交通网络的拥挤道路收费双层规划模型[J].系统工程理论方法应用,2005,14(6)：546-551.
[164]吕彪,蒲云,刘海旭.考虑路网可靠性和空间公平性的次优拥挤收费模型[J].运筹与管理,2013,(2)：188-194.
[165]吕彪,蒲云,刘海旭.基于遗传算法的随机路网次优拥挤收费模型[J].计算机工程,2013,39(8)：257-261.
[166]Ben-Akiva M E, Lerman S R. Discrete Choice Analysis:Theory and Application to Travel Demand [M].MIT press,1985.
[167]Ramming M S. Network Knowledge and Route Choice [D]. Massachusetts Institute of Technology, 2001.
[168]Dial R B. A Probabilistic Multipath Traffic Assignment Model Which Obviates Path Enumeration [J]. Transportation research,1971,5(2):83-111.
[169]Bell M G. Alternatives to Dial's Logit Assignment Algorithm [J]. Transportation Research Part B:Methodological,1995,29(4):287-295.
[170]Dijkstra E W. A Note on Two Problems in Connection with Graphs [J]. Numerical Mathematics,1959,1:269-271.
[171]Shier D R. On Algorithms for Finding the K-shortest Paths in a Network [J]. Networks,1979, 9:195-214.
[172]Eppstein D. Finding the K Shortest Paths [J]. Journal of the Society for Industrial and Applied Mathematics,1998,28(2):652-673.
[173]Ben-Akiva M, Bergman M J, Daly A J, Ramaswamy R. Modeling Inter-Urban Route Choice Behaviour [C]. Proceedings of the 9th International Symposium on Transportation and Traffic Theory, VNU Press, Utrecht,1984:299-330.
[174]Azevedo J A, Santos Costa M E O, Silvestre Madera J J E R, Vieira Martins E Q. An Algorithm for the Ranking of Shortest Paths [J]. European Journal of Operational Research, 1993,69(1):97-106.
[175]De la Barra T, Perez B, Anez J. Multidimensional Path Search and Assignment [C]. Proceedings of the 21st PTRC Summer Annual Meeting. Manchester,England,1993:307-319.
[176]Robbins H, Monro S. A Stochastic Approximation Method [J]. The annals of mathematical statistics,1951:400-407.
[177]Blum J R. Multidimensional Stochastic Approximation Methods [J]. The Annals of Mathematical Statistics,1954:737-744.
[178]Leblanc L J. Mathematical Programming Algorithms for Large-Scale Network Equilibrium and Network Design Problems [D]. Northwestern University,1973.
[179]Bar-Gera H. Transportation Network Test Problems,2001.< http://www.bgu.ac.il/-bargera/tntp/>.
[180]龚峻峰,余志,何兆成.一种基于路段惩罚法的合理路径集生成算法[J].公路交通科技,2009,26(9)：107-111,124.
[181]Ben-Akiva M, Ramming S. Lecture Notes:Discrete Choice Models of Traveler Behavior in Networks [J]. Prepared for Advanced Methods for Planning and Management of Transportation Networks. Capri, Italy,1998,25.
[182]Chu C. A Paired Combinatorial Logit Model for Travel Demand Analysis [C]. TRANSPORT POLICY, MANAGEMENT & TECHNOLOGY TOWARDS 2001:SELECTED PROCEEDINGS OF THE FIFTH WORLD CONFERENCE ON TRANSPORT RESEARCH, 1989.
[183]李桂玲.双层规划中几个问题的研究[D].山东科技大学,2005.
[184]Bracken J, McGill J T. Mathematical Programs with Optimization Problems in the Constraints [J]. Operations Research,1973,21(1):37-44.
[185]Candler W, Norton R. Multilevel Programming [R]. Technical Report 20, World Bank Development Research Center, Washington D.C., USA,1977.
[186]蔡金,高自友.求解城市交通连续平衡网络设计问题的混合算法[J].北方交通大学学报,2002,26(2)：71-76.
[187]邢文训,谢金星.现代优化计算方法[M].北京：清华大学出版社,1999.
[188]史峰,王辉,郁磊,胡斐MATLAB智能算法30个案例分析[M].北京：北京航空航天大学出版社,2011.
[189]Holland J H. Adaptation in Natural and Artificial Systems:An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence [M].U Michigan Press,1975.
[190]周明孙树栋.遗传算法原理及应用[M].北京：国防工业出版社,1999.
[191]Faghri A, Aneja S. Artificial Neural Network-Based Approach to Modeling Trip Production [J]. Transportation Research Record:Journal of the Transportation Research Board,1996, 1556(1):131-136.
[192]Li X, Soler-Flores F, Gonzalez-Cancelas N, Orive A C. Study on Forecasting the Berthing Time of the Ships in the Port [J]. Journal of Applied Sciences,2013,13(11):1970-1974.
[193]Li X, Lang M. Study On the Combination Prediction Method in Railway Freight Volume Prediction [J]. Advances in Transportation Studies,2013, Special Issue; 83-94.
[194]史峰,李志纯.拥挤道路使用收费的理论构架[J].交通运输工程学报,2002,2(2)：78-82.
[195]黄海军.拥挤道路使用收费的研究进展和实践难题[J].中国科学基金,2003,17(4)：198-203.
[196]Metropolis N, Rosenbluth A W, Rosenbluth M N, Teller A H, Teller E. Equation of State Calculations by Fast Computing Machines [J]. The journal of chemical physics,1953,21(6): 1087-1092.
[197]刘灿齐.现代交通规划学[M].北京：人民交通出版社,2001.