不确定环境下城市交通中车辆路径选择研究
|
摘要
伴着信息时代的到来，市场竞争更加剧烈，时间价值也日益提升。准时服务已经成为现代企业角逐市场的重要手段，体现着企业的服务水平，标志着企业的市场竞争能力。但同时，实现准时服务的城市交通环境却是不确定的：时变的交通流量，偶发的交通事故，突发的交通拥挤，导致了车辆在路段上随机的旅行时间。在多起点、多迄点的不确定城市交通环境中，某一起、迄点对之间只存在随机最优路径，不同行为主体在选择随机最优路径时会表现不同的行为特征，出行者的择路行为(包括路径选择和出行时间选择)会随着出行目的、约束时间、出行者的经验、对路网络的熟悉程度以及旅行时间的不确定程度而变化。作为实现交通出行合理化的重要内容和手段，研究不确定环境下车辆择路行为有助于减少城市交通捌挤，节约社会能源，保护城市环境，降低出行成本，提高运作效率，全面提高城市交通出行的满意度。由于车辆随机路径问题将运筹学理论与生产实践紧密地结合在一起，近几十年取得了很多成果，但到目前为止，将车辆随机路径选择问题与不确定环境下人们的决策行为相结合的研究仍然很少，许多不尽人意的地方有待于进一步完善和改进。本文较深入地研究了不确定环境下的一系列车辆路径选择行为问题。
论文的主要研究内容如下：
第1章，在对大量相关文献进行总结提炼的基础上，分别回顾了国内、外对车辆路径选择行为问题的研究成果，并指出了已有车辆路径选择行为问题研究中存在的不足和潜在的研究领域。
第2章，基于出行成本最小化的假设，根据不确定环境中人们出行时的路径选择行为过程，建立了OD对间任意中间节点至迄点的理想阻抗的动态用户最优分配的变分不等式模型，给出了求解该问题的嵌套对角化算法。对理想阻抗与瞬时阻抗的动态用户最优分配模型进行了比较：在理想动态用户最优状态下，同一OD对间同时出发、选择不同路径的出行者，其旅行时间相等而且最小。在瞬时动态用户最优状态下，同一OD对间同时出发、选择不同路径的出行者，其旅行时间可能不同。并用一个数值算例比较了这两类模型的差别。
第3章，随机、时变的交通流分布，偶发的交通事故等因素导致了路径随机的车辆旅行时间，也决定了现实城市交通网络中只存在随机最短路。这使得人们的决策行为变得极其复杂而无法找到最优路径。实证研究发现：人们在城市交通中的车辆择路行为符合展望理论提出的人们在不确定环境下的决策行为特征：①参考点依赖原则；②损失规避原则(对损失的规避程度大于对同等收益量的追求
With the increasing intensification of market competition at the information age, the value of time is also increased. Many enterprises realize that punctual serveice is an important measure to improve the ability of market competition, which indicates the level of serveice. On the contrary, the condition of transportation in urban is uncertainty, such as time-dependent traffic flow, occasionally happened incident, and unexpected traffic jam. All these facts decide travel time on route is radom. There only exists stochastic shortest route (SSR) from the origin to the destination in the urban taffic networks with many origins and many destinations. So, different travelers will have different behaviors in routing choice which, including route choice and departure time choice, will change with travel importance, time to be used for route, traveler's familiarity to the networks and the range of travel time. As an important approach to realize travel rationalization, research on vehicle routing choice under uncertainty will decrease traffic jam, protect urban envornment, reduce travel cost, improve operation efficiency and enhance customer satisfaction comprehensively. Since SSR problem tightly connect theory of Operations Research with practice of production, which was named as one of the most successful areas in Operations Research in the past decades. Up to the date, few researchs have been made on the connection between SSR choice and travelers' behaviors in urban traffic under uncertainty, and many dissatisfactory items await amelioration and modification. In this dissertation, a series of vehicle routing choice under uncertainty are analyzed thoroughly.
The main contents of this dissertation are as follows:
In chapter 1, based on summarizing relative references, we retrospecte domestic and foreign research on vehicle routing choice, point out shortcomings of research on this problem and find some potential areas of research.
hi chapter 2, with assumption of travel cost minimized, the dynamic user optimal (DUO) assignment models based on the ideal and the instantaneous impedance is compared. According to the travelers' routing behavior, this paper formulates an ideal DUO assignment model using the variational inequality approach. The presented model complies with the DUO equilibrium condition, in which for each origin- destination
论文的主要研究内容如下：
第1章，在对大量相关文献进行总结提炼的基础上，分别回顾了国内、外对车辆路径选择行为问题的研究成果，并指出了已有车辆路径选择行为问题研究中存在的不足和潜在的研究领域。
第2章，基于出行成本最小化的假设，根据不确定环境中人们出行时的路径选择行为过程，建立了OD对间任意中间节点至迄点的理想阻抗的动态用户最优分配的变分不等式模型，给出了求解该问题的嵌套对角化算法。对理想阻抗与瞬时阻抗的动态用户最优分配模型进行了比较：在理想动态用户最优状态下，同一OD对间同时出发、选择不同路径的出行者，其旅行时间相等而且最小。在瞬时动态用户最优状态下，同一OD对间同时出发、选择不同路径的出行者，其旅行时间可能不同。并用一个数值算例比较了这两类模型的差别。
第3章，随机、时变的交通流分布，偶发的交通事故等因素导致了路径随机的车辆旅行时间，也决定了现实城市交通网络中只存在随机最短路。这使得人们的决策行为变得极其复杂而无法找到最优路径。实证研究发现：人们在城市交通中的车辆择路行为符合展望理论提出的人们在不确定环境下的决策行为特征：①参考点依赖原则；②损失规避原则(对损失的规避程度大于对同等收益量的追求
With the increasing intensification of market competition at the information age, the value of time is also increased. Many enterprises realize that punctual serveice is an important measure to improve the ability of market competition, which indicates the level of serveice. On the contrary, the condition of transportation in urban is uncertainty, such as time-dependent traffic flow, occasionally happened incident, and unexpected traffic jam. All these facts decide travel time on route is radom. There only exists stochastic shortest route (SSR) from the origin to the destination in the urban taffic networks with many origins and many destinations. So, different travelers will have different behaviors in routing choice which, including route choice and departure time choice, will change with travel importance, time to be used for route, traveler's familiarity to the networks and the range of travel time. As an important approach to realize travel rationalization, research on vehicle routing choice under uncertainty will decrease traffic jam, protect urban envornment, reduce travel cost, improve operation efficiency and enhance customer satisfaction comprehensively. Since SSR problem tightly connect theory of Operations Research with practice of production, which was named as one of the most successful areas in Operations Research in the past decades. Up to the date, few researchs have been made on the connection between SSR choice and travelers' behaviors in urban traffic under uncertainty, and many dissatisfactory items await amelioration and modification. In this dissertation, a series of vehicle routing choice under uncertainty are analyzed thoroughly.
The main contents of this dissertation are as follows:
In chapter 1, based on summarizing relative references, we retrospecte domestic and foreign research on vehicle routing choice, point out shortcomings of research on this problem and find some potential areas of research.
hi chapter 2, with assumption of travel cost minimized, the dynamic user optimal (DUO) assignment models based on the ideal and the instantaneous impedance is compared. According to the travelers' routing behavior, this paper formulates an ideal DUO assignment model using the variational inequality approach. The presented model complies with the DUO equilibrium condition, in which for each origin- destination
引文
[1] Adlakha V G. An improved conditional Monte Carlo technique for stochastic shortest route problem [J]. Management Science, 1986, 32(10): 1360-1367
[2] Adler J L, Recker W W, McNally M G In-laboratory experiments to analysis en-route driver behavior under ATIS [P]. Report Number: UCI-ITS-WP-93-3, 1993,University of California, Irvine, and Institute of Transportation Research.
[3] Adler J L. McNally M.G In laboratory experiment-ts to investigate driver behavior under advanced traveler information systems [J]. Transportation Research C, 1994, 2(3): 149-164.
[4] Adler J L. investigating the learning effects of route choice guidance and traffic advisories on route choice behavior [J]. Transportation Research C, 2001,9(10): 1-14
[5] Alexopoulos C. State space partitioning methods for stochastic shortest path problems [J]. Networks, 1997,30(1): 9-21
[6] Bates J, Polak J, Jones P, Cook A. The valuation of reliability for personal travel [J]. Transportation Research E, 2001(37): 191-229.
[7] Bard J F, Bennett J E. Adlakha V G.A reduction and path preference in stochastic acyclic networks [J]. Management Science, 1991,37(10): 195-215
[8] Beckmann M, McGuire C B, Winsten C. Studies in the Economics of Transportation [M]. Yule University Press, New Haven, Connecticut, 1956.
[9] Bell D E. Regret in Decision Making Under Uncertainty [J], Operations Research, 1982, 30(5): 961-981.
[10] Bell D E. Disappointment in Decision Making Under Uncertainty [J], Operations Research, 1985, 33(1): 1-27
[11] BenAkiva M, Lerman S R.Disaggregate travel and mobility choice models and measures of accessibility [C]. Proceedings, 1978, 3rd International Conference on Behavioral Travel modeling, Adelaide, Australia.
[12] Berger J O. Statistical decision theory and Bayesian analysis [M]. Second edition, New York: Springer Verlag, 1985
[13] Bernstein D, Friesz T L, Tobin R L, Wie B W. A variational control formulation of the simultaneous route and departure-time choice equilibrium problem [P]. Proceedings, 1993, the 12th International Symposium on Transportation and Traffic Theory (edited by Daganzo C F): 107-126.
[14] Bonsall P. Analyzing and modeling the influence of roadside variable message displays on drivers' route choice in world transportation research [P]. Proceedings of the 7th WCTR, 2000, 1: 1-25
[15] Bonsall P W, Parry T. Drivers'requirements for route guidance [P]. Proceedings of the Third International Conference, 1990, in road traffic control, 1-5.
[16] Boyce D E, Ran B, LeBlanc L J. Solving an instantaneous dynamic user optimal choice model [J]. Transportation Science, 1995, 29: 128-142.
[17] Caplice C, Mahrnassani H S. Aspects of commuting behavior: preferred arrival time, use of information and switching propensity [J]. Transportation Research A, 1992, 26(5): 409-418.
[18] Chen P S, Mahmassani H S. Dynamic interactive simulator for studying commuter behavior under real-time traffic information supply strategies [J]. Transportation Research Record, 1993, 1413: 12-21.
[19] Chen T Y, Chang H L, Tzeng G H. Using a weight-assessing model to identify route choice criteria and information effects [J]. Transportation Research A, 2001, 35: 197-224.
[20] Carey M. A constraint qualification for dynamic traffic assignment [J]. Transportation Science, 1986, 20(1): 55-58.
[21] Carey M.Optimal time-varying flows on congestion networks [J]. Operation Research, 1987, 35(1): 58-69.
[22] Carey M.Nonconvexity of the dynamic traffic assignment problem [J]. Transportation Research B, 1992, 26(2): 127-133.
[23] Charnes A, Cooper W W. Chance-constrained programming [J]. Management Science, 1959, 6:73-79
[24] Carlson N R. Physiology of behavior [M]. Allyn and Bacon, Newton, M A, 1986
[25] Chanas S, Delgado M, Verdegay J L, Vila M A. Fuzzy optimal flow on imprecise structure [J]. European Journal of Operational Research, 1995, 83: 568-580
[26] Charness A, Cooper W, Thompson G. Critical path analyses via chance constrained and stochastic programming [J]. Operations Research, 1964, 12: 460-470
[27] Charles M H, Patrick J K, Donald R L. Travel configuration on consumer trip-chained store choice [J]. Journal of Consumer Research, 2004, 31(2): 241-248
[28] Chen H K, Hsueh C E A model and a algorithm for the dynamic user-optimal route choice problem [J]. Transportation Research B, 1998, 32(4): 219-234.
[29] Cherkassky B V, Andrew V G, Radzik T. Shortest paths algorithms: Theory and experimental evaluation [J]. Mathematical Programming, 1996, 73: 129-174
[30] Corea G.A., Kulkami V.G. Shortest paths in stochastic networks with arc lengths having discret distributions [J]. Networks, 1993, 23(3): 175-183
[31] DaganzoC F, Sheffi Y. On stochastic models of traffic assignment [J]. Transportation Science, 1977, 11: 253-274.
[32] Daganzo C F. The cell transmission model: a simple dynamic representation of highway traffic. Transportation Research B, 1994, 28 (4): 269-287
[33] Daganzo C F. The cell transmission model, Part Ⅱ: network traffic [J]. Transportation Research B, 1995, 29(2): 79-93.
[34] Daganzo C F. Reversibility of the time-dependent shortest path problem [J]. Transportation Research B, 2002, (36): 665-668.
[35] Danzig G B. Liner Programming under Uncertainty [J]. Management Science, 1955, 1:197-206
[36] David Levison. The value of advanced traveler information systems for route choice [J]. Transportation Research C, 2003 (11): 75-87.
[37] De Palma A, Meyer G M, Papageorgiou Y Y. Rational choice under an imperfect ability to choose [J]. America Economic Review, 1994, 84:419-440
[38] Dia H. An agent-based approach to modeling driver route choice behavior under the influence of real-time information [J]. Transportation Research C, 2002, 10: 331-349.
[39] Dial R B. A probabilistic multipath traffic assignment algorithm, which obviates path enumeration [J]. Transportation Research, 1971, 5:83-111.
[40] Dijkstra E W. Anote on two problems in connection with graphs [J]. Numerische Mathrnatik, 1959 (1): 269-271.
[41] Drissi-Kaitouni O.A variational inequality formulation of the dynamic traffic assignment problem [J]. European Journal of Operational Research, 1993, 71: 188-204.
[42] Duffell J R, Kalombaris A.Empirical studies of car driver route choice in herfordshire [J]. Trffic Engineering and Control, 1988, 29(7/8): 398-408.
[43] Ridwan M. Fuzzy preference based traffic assignment problem [J]. Transportation Research C, 2004, 12:209-233
[44] Dubois D, Prade H. Fuzzy set and systems: Theory and applications [M]. AcademicPress, New York, 1980
[45] Dubois D, Prade H. Fuzzy set and systems [J]. Fuzzy Set and & Systems, 1980, 3:37-48
[46] Dyer J S, Fishburn P C, Wallenius J, etal. Multiple Criteria Decision-making, Multi-attribute Utility Theory: the Next Ten Years [J]. Management Science, 1992, 38(5): 645-653
[47] Eiger A Mirchandani P, Soroush A. Path preferences and optimal paths in probabilistic networks [J]. Transportation Science, 1985, 19:75-84
[48] Eisele W, Rillet L R. A statistical comparison of travel estimates obtained from intelligent transportation systems and instrumented test vehicles [P]. Presented at the 81st Annual Meeting of Transportation Research Board, Washington D C, January, 2002.
[49] Elkjaer M. Stochastic budget simulation [J]. Intemational Journal of Project Management, 2000, 18(2): 139-147.
[50] Fisk C. Some developments in equilibrium traffic assignment [J]. Transportation Research B, 1980, 14: 243-255.
[51] Frank H. Shortest paths in networks in probabilistic graphs [J]. Operations Research, 1969, 17:583-599
[52] Friesz T L, Luque F J, Tobin R L, Wie B W. Dynamic network traffic assignment considered as a continuous time optimal control problem [J]. Operation Research, 1989, 37: 893-901.
[53] Friesz T L, Bemstein D, Smith T E, Tobin R L, Wie B W .A variational inequality formulation of the dynamicnetworks user equilibrium problem [J]. Operation Research, 1993, 41(1): 179-191.
[54] Funikawa N. A parametric total order on fuzzy numbers and fuzzy shortest routes problem [J]. Optimization, 1994, 30: 367-377
[55] Gendreau, Michel, Laporte, Gilbert, Sequin, Rene. Stochastic vehicle routing [J]. European Journal of Operational Research, January 6, 1996(1): 3-12.
[56] Hall R.W. The fastest path through a net works with Radom time-dependent travel times [J]. Transportation Science, 1986, 20(3): 182-188
[57] Harrison J M, Pich M T. Two-monument analysis of open queueing networks with general workstation capabilities [J]. Operations Research, November- December, 1996,44(6): 936-950.
[58] Heydecker B G, Addison J D. An exact expression of dynamic traffic assignment [P]. Proceedings, 1996, the 13th International Symposium on Transportation and Traffic Theory (edited by Daganzo C F): 359-384.
[59] Huang H J, Lam W H K. Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues [J]. Transportation Research B, 2002,36(3): 253-273.
[60] Huang H J, Lin X Q. A multi-class dynamic user equilibrium route and departure time choice problem in queuing networks with advanced traveler information [J]. Journal of mathematical modeling and algorithms, 2003(2): 349-377.
[61] Huchingson R, McNees R, Dudek C.Survey of motorist route-select criteria [J]. Transportation Research Record, 1977, 643: 45-48.
[62] Iida Y, Uchida T, Uno N. Dynamics of route choice behavior considering traveler experience: an experiment analysis[C]. 6e Conference International Sur Les Comportments De Deplacement, Chateau, Bonne Entente, Quebec, 1991,1:316-332.
[63] Ioachim I, Desrosiers J and Soumis F et al. Fleet Assignment and Routing with Schedule Synchronization Constrains [J]. European Journal of Operational Research, 1999,119: 75-90
[64] Jaillet P. Shortest path problem with node failures [J]. Networks, 1989, 22: 589-605
[65] Jan O, Horowitz A J, Peng Z R. Using GPS data to understand variations in path choice [P]. Paper presented at the TRB 79th Annual Meeting, Washington, D C, 2000
[66] Jayakrishnan R.In-vehicle information systems for network traffic control: a simulation framework to study alternative guidance strategies. Ph D. dissertation, 1992, Austin, University of Texas.
[67] Jeffery D J. Route guidance and in-vehicle information systems [A]. P W Bonsai, M Bell. Information Techonology Applications in Transport[C]. Utrecn: VUN Press, 1986, 319-351
[68] Jiang M L, Morikawa T. Theoretical analysis on the variation of value of travel time savings [J]. Transportation Research A, 2004, 38: 551-571.
[69] Kahneman D, Tversky A. Prospect Theory: An Analysis of Decision under Risk [J], Econometrica, 1979, 47(2): 263-291
[70] Kanafani A, A1-Deek H. A simple model for route guidance benefits [J]. Transportation Research Record, 1991, 1111: 126-134.
[71] Kaufman D E, Smith R L, Wunderlich K E. User-equilibrium properties of fixed points in dynamic traffic assignment [J]. Transportation Research C, 1998, 6(1): 1-16.
[72] Khattak A J, Schofer J L, Koppelman F S.A commuters'enroute diversion and return decisions: IVHS design implications [P]. Proceedings of the International Conference on traffic behavior, 1991, Quebec City, Quebec, Canada.
[73] Khattak A J, Koppelman F S, Schofer J L. Stated preferences for investigating commuters' diversion propensity [J]. Transportation 20, 1993:107-127
[74] King G F. Driver perorman in highway tasks [J]. Transportation Research Record. 1986, 1093: 1-11.
[75] King G F, Mast T S. Excess travel: cause, extent, and consequences [J]. Transportation Research B. 1987, 25(4): 191-201.
[76] Klein C M. Fuzzy shorstest path problem [J]. Fuzzy Set and & Systems, 1991, 39:27-41
[77] Korhonen P. Moskowitz H, Wallenius J. Multiple Criteria Decision Support —A Review [J]. European Joumal of Operational Research, 1992, 63(3): 361-375.
[78] Kulkami V.G. Shortest paths in networks with exponentially distributed arc lengths [J]. Networks, 1986, 16:255-274
[79] Kuwahara M, Akamatsu T. Dynamic equilibrium assignment with queues for a one-to-many OD pattern [P]. Proceedings, 1993, the 12th International Symposium on Transportation and Traffic Theory: 185-204.
[80] Kuwahara M, Akamatsu T.Decomposition of reactive dynamic assignment with queues for a many-to-many origin-destination pattern [J]. Transportation Research B, 1997,31(1): 1-10.
[81] LamT C, Small K A. The value of time and reliability: measurement from a value pricing experiment [J]. Transportation Research E, 2001, 37: 231-251.
[82] Lam W H K, Huang H J. Dynamic user optimal traffic assignment model for many to one travel demand [J]. Transportation Research B, 1995, 29(4): 243-259
[83] Lam W H K, Zhou J, Sheng Z H. A capacity restraint transit assignment with elastic line frequency [J]. Transportation Research B, 2002,36(10): 919-938.
[84] LeBlance L J, Morlok E K, Piersskalla W P. An efficient approach to solving the road network equilibrium traffic assignment problem [J] Transportation Research B, 1975,9: 309-318.
[85] Leonid E. On dynamics of traffic queues in a road networks with route choice based on real time traffic information [J]. Transportation Research C, 2003, 11: 161-183.
[86] Lin K C, Chern S. The fuzzy shorstest path problem and its most vital arcs [J]. Fuzzy Set and & Systems, 1993, 58: 343-353
[87] Liu H X, Recker W, Chen A.Uncovering the contribution of travel time reliability to dynamic route choice using real-time loop data [J]. Transportation Research A, 2004,38: 435-453
[88] Lo H K, Szeto W Y. A methodology for sustainable traveler information services [J]. Transportation Research B, 2002,36(2): 113-130.
[89] Lo H K, Yung Y K.Network with degradable links capacity analysis and design [J]. Transportation Research B, 2003, 37(4): 345-363.
[90] Loomes G, Sugden R. Regret theory: An alternative theory of rational choice under uncertainty [J], Economic Journal, 1982,92(December): 805-824.
[91] Loui R. Optimal paths in graphs with stochastic or multidimensional weights [J]. Communications of the ACM, 1983,26: 670-676
[92] Luque F J, Friesz T L. Dynamic traffic assignment considered as a continuous time optimal control problem. 1980, Presented at the TIMS/ORSA Joint National Meeting, Washington, D C.
[93] Mahamassani H S, Peeta S, Hu T Y, Ziliaskopoulos. Dynamic traffic assignment with multiple user classes for real-time ATIS/ATMS applications [A]. Large Urban System, U.S. Federal Highway Administration, Washington, D C, 1992, 91-114.
[94] Mahamassani H S, Peeta S. Network performance under system optimal and user equilibrium Dynamic assignment: implications for ATIS [J]. Transportation Research Record,1993, 1408:83-93.
[95] Mcfadden D, Reid F. Aggregate travel demand forecasting fi'om disaggregate behavioral models [J]. Transportation Research Record, 1975, 534: 24-37.
[96] Merchant D K, Nemhauser G L. A model and an algorithm for the dynamic traffic assignment [J]. Transportation Science, 1978a, 12: 183-199.
[97] Merchant D K, Nemhauser G L.Optimality conditions for a dynamic traffic assignment model [J]. Transportation Science, 1978b, 12: 200-207.
[98] Michael H A. The performance of route modification and demand stabilization strategies in stochastic vehicle routing [J]. Transportation Research B: Methodological, November, 1998(8): 551-566.
[99] Mirchandani P, Soroush H. Optimal paths in probabilistic networks: a case with temporary preferences [J]. Computer & Operations Research, 1985, 12(12): 365-381
[100] Miller-Hooks E, Mahmassani H. Least possible time paths in stochastic, time-varying networks [J]. Computer & Operations Research, 1998, 25(12): 1107-1125
[101] Miller-Hooks E, Mahrnassani H. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks [J]. European Journal of Operational Research, 2003(146): 67-82
[102] Moskowitz H, Prechel P V, Yang A. Multi-criteria Robust Interactive Decision Analysis (MCRID) for Optimizing Public Policies [J]. European Journal of Operational Research, 1992, 56(2): 219-236.
[103] Nakayama S, Kitamura R. A route choice model with inductive leaming [P]. Paper presented at the TRB 79th Annual Meeting, Washington, D C, 2000.
[104] Okada S, Gen M. Fuzzy multiple choice knapsack problem [J]. Fuzzy Set and & Systems, 1994, 67:71-80
[105] Ohtsubo Y. Minimizing risk models in stochastic shorstest path problems [J]. Mathematical methods Operations Research, 2003, 57: 79-88
[106] Paletta G A multi-period traveling salesman problem heuristic algorithms [ J] . Computer & Operations Research. 1992, 18(8): 789-795
[107] Papastavrou J D, Rajagopalan S and Kleywegt A J.The Dynamic and Stochastic Knapsack Problem with Deadlines [J]. Management Science, 1996, 42(12): 1707-1718
[108] Park D, Rillet L R. Forecasting multi-period freeway link travel time using modular neural networks [J]. Transportation Research Record, 1998, 1617: 163-170.
[109] Pattanamekar P. Dynamic and stochastic shorstest path in transportation networks with two components of travel time uncertainty [J]. Transportation Research C, 2003,11:331-354
[110] Payne J, Bettman J, Johnson E. Adaptive strategy in decision making [J]. Journal of Experimental Psychology: Learning, Memory and Cognition, 1988, 14:534-552
[111] Philips A. Delay performance in stochastic processing networks with priority service [J]. Operations Research Letters, September, 2003(5): 390-400.
[112] Polychronopoulos G H. Stochastic shortest path problems with recouse [J]. Networks, 1996,27(2): 133-143
[113] Prashker J N. Direct analysis of the perceived importance of attributes of reliability of travel modes in urban travel [J]. Transportation, 1979, 8: 329-346.
[114] Pretolani D. A directed hypergraph model for Radom time dependent shortest paths [J]. European Journal of Operational Research, 2000,123: 315-324
[115] Psaraftis H, Tsitssiklis J. Dynamic shortest paths in acyclic networks with Markovian arc cost. Operations Research, 1993(41): 91-101
[116] Pursula M, Talvitie A.Urban route choice modeling with multinomial logit models[C]. World Conference on Transportation Research, 1992, vol6, Lyon.
[117] Ran B, Boyce, D E. Modeling dynamic transportation networks: an intelligent transportation system oriented approach [M]. Springer, Heidelbeg, 1996. Heidelberg.
[118] Ran B, Boyce D E, LeBlanc L J.A new class of instantaneous dynamic user-optimal traffic assignment models [J]. Operation Research, 1993, 41(1): 192-202.
[119] Ran B, Hall W R, Boyce D E. A link-based variational inequality model for dynamic departure time/route choice [J]. Transportation Research B, 1996, 30(1): 31-46.
[120] Salo A A. Interactive Decision Aiding for Group Decision Support [J]. European Journal of Operational Research, 1995, 84(1): 134-139.
[121] Sheffi Y. Urban transportation networks: equilibrium analysis with mathematical programming methods [M]. Englewood Cliffs, New Jersey: Pentice-Hall, 1985.
[122] Sgal C, Pritsker A, Solberg J. The stochastic shortest route problem [J]. Operations Research, 1980, 28:1122-1129
[123] Shi H. Time work tradeoffs of the single source shortest path [J]. Journal of algorithms, 1999, 30(1): 19-32
[124] Smith M J. Existence, uniqueness and stability of traffic equilibria [J]. Transportation Research B, 1979, 13: 295-304.
[125] Smith M J. A new dynamic traffic and existence and ealaulation of dynamic user equilibria on congestion capacity-constrained road networks[J]. Transportation Research B, 1993, 27: 49-63.
[126] Smith M J, Wisten M B. A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium [A]. Annals of Operation Research, 1995, 60: 59-79.
[127] Tavares L V, Ferreira J A, Silva J C. On the optimal management of project risk [J]. European Journal of Operational Research. 1998, 107(3): 451-469.
[128] Taylor K A. A regret theory approach to assessing consumer satisfaction [J]. Marketing Letters, 1997, 8: 229-238.
[129] Thoroup M. Flouts, integers and single source shortest path [J]. Journal of algorithms, 2000, 35(2): 189-201
[130] Tsiors M, Mittal V. Regret: A model of its antecedents and consequences in decision making [J]. Journal of Consumer Research, 2000, 26:401-417
[131] Tsuji H, Takahashi R, Yarnamoto. A stochastic approach estimating the effectiveness of e route guidance system and its related parameters [J]. Transportation Science, 1985, 19(4): 333-351.
[132] Tversky A and Kahneman D. Loss Aversion in Riskless Choice: A Reference-Dependent Model [J], The Quarterly Journal of Economics, 1991, 106:4, 1039-1061
[133] Vythoulkas P C, Koutsopoulos H N. Modeling discrete choice behavior using concepts from fuzzy set theory, approximates reasoning and networks [J]. Transportation Research C, 2003, 11: 5-73
[134] Wachs M.Relationships between drivers'attitudes toward alternative routes and driver and route characteristics [J]. Highway Research Record, 1967, 197: 70-87.
[135] Wardrop J G.Some theoretical of road traffic research. Proceedings of Institute of Civil Engineers [M], 1952, Ⅱ (1): 325-378.
[136] Wellman M R Path planning under time dependent uncertainty [C]. Proceedings of the 11st conference on uncertainty in artificial intelligence, Montreal, Quebec, Canada, 1995:18-20
[137] Wie B W, Friesz T L, Tobin R L. Dynamic user optimal traffic assignment on congested multi-destination networks [J]. Transportation Research B, 1990, 24(6): 431-442.
[138] Wie B W, Tobin R L, Friesz T L. The augment Lagrangian method for solving dynamic network traffic assignment models in discrete time [J]. Transportation Science, 1994, 28(3): 205-220.
[139] Wie B W, Tobin R L, Friesz T L, Bernstein D.A discrete time, nested cost operator approach to the dynamic network user equilibrium [J]. Transportation Science,1995, 29: 79-92.
[140] Yagar S. Dynamic traffic assignment by individual path minimization and queuing [J]. Transportation Research, 1971, 5:179-196.
[141] Yager R R. Decision making using minimization of regret [J]. International Journal of Approximate reasoning, 2004, 36:109-128
[142] Yang H, Kitamura R, Jovanis P P, Vaughn K M. Exploration of route choice behavior with advanced traveler information system using neural networks concepts [J]. Transportation,1993, 20(2): 199-223.
[143] Yang B Y, Miller h E. Adaptive routing considering delays due to signal operations [J]. Transportation Research B, 2004, 38: 385-413.
[144] Zeelenberg M, Petiers R. Beyond valence in consumer dissatisfaction: A review and new findings on behavior responses to regret and disappointment in failed services [J]. Journal of Business Research, 2004, 57:445-455
[145] Zhi-chun Li, Hai-jun Huang. Modeling Heterogenous Drivers' Response to Route Guidance and Parking Information Systems in Stochastic and Time-Dependent Networks. Working Paper, BeiJing University of Aeronautics and Astronautics, 2006.
[146] Ziliaskopoulos A, Mahmassani H.Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications [J].Transportation Research Record, 1993, 1408:94-100
[147] 杜振财，王丽，荣建．期望车头间距的混沌模型[J]．公路交通科技，2005，22(5)：24-27．
[148] 冯蔚东，陈剑，贺国光，刘豹．交通流路线选择行为演化模型[J]．系统工程理论与实践，2002，3：72-79．
[149] 高自友，任华玲．城市动态交通流分配模型与算法[M]．2005，北京：人民交通出版社．
[150] 葛颖恩，杨佩昆．路径选择和交叉口控制组合问题评析[J]．公路交通科技，1998，15()：33-37．
[151] 韩超，宋苏，王成洪．一种改进的短时交通流多步自适应预测算法[J]．公路交通科技，2005，22(1)：115-118．
[152] 贺国光，冯蔚东．ITS与自组织理论[J]．公路交通科技，1998，15(3)：8-12．
[153] 贺国光，徐岩宁．车辆线路引导系统的行驶时间预测模型研究[J]．中国公路学报，1998，11(3)：79-86．
[154] 贺国光，李宇，马寿峰．基于数学模型的短时交通流预测方法探讨[J]．系统工程理论与实践，2000，12：51-56．
[155] 贺国光，王东山．仿真交通流混沌现象的传播特性研究[J]．土木工程学报，2001，37(1)：70-73．
[156] 贺国光，马寿峰．交通诱导系统智能化方案及其仿真研究[J]．系统工程学报，200，17(4)：323-328．
[157] 贺国光，马寿峰，冯蔚东．对交通流分形问题的初步研究[J]．中国公路学报，2002，15(4)：82-85．
[158] 贺国光，冯蔚东．路线选择行为的分支模型[J]．土木工程学报，2003，36(1)：21-25．
[159] 贺国光，万兴义，王东山．基于跟驰模型的交通流混沌研究[J]．系统工程，2003，21(2)：50-55．
[160] 贺国光，冯蔚东．基于R／S分析研究交通流的长程相关性[J]．系统工程学报，2004，19(2)：166-169．
[161] 黄海军．运量分布与运量配流组合模型的研究．北京航空航天大学管理学院，博士论文，1992．
[162] 黄海军．城市交通网络平衡分析：理论与实践[M]．北京：人民交通出版社，1994
[163] 黄海军，徐刚．对Fisk随机均衡配流模型的研究[J]．系统工程，1994，12(4)：45-53．
[164] 黄海军．动态平衡运量配流问题的及其稳态伴随解算法[J]．自动化学报，1994，20(6)：668-677．
[165] 黄海军，吴文祥．交通事故信息分布的有效性分析[J]．系统工程理论方法应用，2001，10(4)：298-301．
[166] 黄海军，吴文祥．交通信息对交通行为影响的评价模型[J]．系统工程理论与实践，2002a，10：81-83
[167] 黄海军，吴文祥．交通信息对交通行为影响的评价模型[J]．系统工程理论方法应用，2002b，10：12-16
[168] 黄海军，王惠文，高自友．动态交通分配研究进展[C]．交通科学的理论于实践，上海会议．
[169] 黄海军．交通行为建模-问题与机会[J]．交通运输系统工程与信息，2002，2(1)：24-29．
[170] 黄海军．城市交通动态网络建模与交通行为研究[J]．管理学报，2005，2(1)：18-22．
[171] 黄海军，罔琼，杨海，高自友．高峰期内公交车均衡乘车行为与制度安排[J]．管理科学学报，2005，8(6)：1-9
[172] 黄中祥，贺国光，马寿峰．对交通系统不确定性的思考[J]．长沙交通学院学报，2002，18(4)：77-81．
[173] 江景波等．网络技术原理及应用[M]．上海：同济大学出版社，1990．
[174] 李捷萍，大城市交通：问题与对策论TDM的作用[J]．城市交通，2002，10：81-83
[175] 李帮义，姚恩瑜．关于最短路问题的一个双目标优化问题[J]．运筹学学报，2001(4)：68-71
[176] 林岚，居民出行与城市交通难题，Horizon & Horizonkey, 2005, 7, 20http://www.horizonkey.com
[177] 刘宝碇，赵瑞清．随机规划与模糊规划[M]．北京：清华大学出版社，1998：74-94
[178] 刘灿齐．车流在交叉口分流向延误的最短路径及算法[J]．同济大学学报，2002，30(1)：52-56
[179] 陆化普，史其信，殷亚峰．动态交通分配理论的回顾与展望[J]．公路交通科技，1996，13(2)：34-43．
[180] 刘宝碇，赵瑞清．随机规划与模糊规划[M]．北京：清华大学出版社，1998：74-94
[181] 刘静，关伟．交通流预测方法综述[J]．2004，21(3)：84-87
[182] 李志纯，黄海军．随机交通分配中有效路径的确定方法[J]．交通运输系统工程与信息，2004，3(1)：28-32．
[183] 李志纯，黄海军．先进的出行者信息系统对出行者选择行为的影响研究[J]．公路交通科技，2005，22(2)：95-99．
[184] 况漠．驾驶员路线选择行为分析[J]．交通运输系统工程与信息，2003，3(3)：58-62．
[185] 李帮义，何勇，姚恩瑜．点带约束成本的最短路问题[J]．高校应用数学学报A，2000，15(1)：93-96
[186] 李振龙．诱导条件下驾驶员路径选择行为的演化博弈分析[J]．交通运输系统工程与信息，2003，3(2)：23-27．
[187] 林震，杨浩．交通信息服务条件下的出行选择分析[J]．中国公路学报，2003，16(1)：87-90．
[188] 梁颖，陈艳艳，任福田．城市路网畅通可靠性分析[J]．公路交通科技，2005，22(12)：105-108．
[189] 马卫民，徐青川．局内军车调度的时间优化及其竞争策略[J]．系统工程学报，2002，17(5)：395-400．
[190] 马寿峰，李艳君，贺国光．城市交通控制与诱导协调模式的系统分析[J]．管理科学学报，2003，6(3)：71-78．
[191] 马寿峰，卜军锋，张安训．交通诱导中系统最优于用户最优的博弈协调[J]．系统工程学报，2005，20(1)：30-37．
[192] 潘文敏．从网络采样数据直接推导起终点矩阵[J]．西安公路学院学报，1983，3：71-84．
[193] 齐东元等．点边带约束成本的最短路问题及其算法[J]．东南大学学报，2001(1)：112-114
[194] 任华玲，高自友．瞬时动念用户最优问题的统—模型及算法研究[J]．土木工程学报，2003，36(7)：95-99．
[195] 四兵锋，高自友，林兴强．停车诱导信息系统条件下的城市交通网络SUE配流模型及算法[J]．公路交通科技，2006，23(1)：120-124．
[196] 石玉峰．战时随机运输时间路径优化研究[J]．系统工程理论与实践，2005，25(4)：133-136．
[197] 苏永云，宴克非，黄翔等．车辆导航系统的动态最短路径搜索算法研究[J]．系统工程，2000，18(4)：32-37．
[198] 苏永云，宴克非，杨晓光等．VNS中动态行程时间与多端动态最短路算法[J]．中国公路学报，2001，14(1)：97-99．
[199] 苏兵，徐渝．不可恢复道路堵塞路径选择问题及其算法[J]．运筹与管理，2005，14(3)：1-4．
[200] 苏兵，徐寅峰．运输工程中路径突发堵塞事件的对策研究[J]．预测，2005，24(2)：76-80．
[201] 谭国真，高文．时间依赖的网络中最小时间路径算法[J]．计算机学报，2002．2：1-6
[202] 谭国真，柳亚玲，高文．随机时间依赖网络的K期望最短路[J]．计算机学报，2003，3：324-331．
[203] 谈晓洁，周晶，盛昭翰．城市交通拥挤及疏导决策分析[J]．管理工程学报，2003，17(1)：56-60．
[204] 唐铁桥，黄海军．不同交通流的统一连续模型[J]．交通运输系统工程与信息，2004a，4(3)：50-54．
[205] 唐铁桥，黄海军．两车道交通流模型与数值计算[J]．科学通报，2004b，49(19)：1937-1943．
[206] 唐铁桥，黄海军．用燕尾突变理来论讨论交通流预测[J]．数学研究，2005，38(1)：112-116．
[207] 田琼，黄海军，杨海．瓶颈处停车换乘logit随机均衡选择模型[J]．管理科学学报，2005，8(1)：1-6
[208] 王东山，贺国光．交通混沌研究综述与展望[J]．土木工程学报，2003，36(1)：68-74．
[209] 王小平，曹立明．遗传算法-理论、应用与软件实现[M]．西安：西安交通大 学出版社，2002．
[210] 吴文祥，黄海军．平行路径网络中信息对交通行为的影响研究[J]．管理科学学报，2003，6(2)：12-16．
[211] 吴大艳，谭惠丽，孔令江等．三车道元胞自动机交通流模型研究[J]．系统工程学报，2005，20(4)：393-397．
[212] 夏冰，董菁，张佐．周相似特性下的交通流预测模型研究[J]．公路交通科技，2003，20(2)：73-76．
[213] 熊轶，黄海军，李志纯．交通信息系统作用下的随机用户均衡模型与演进[J]．交通运输系统工程与信息，2003，3(8)：81-83．
[214] 徐启华，杨瑞．支持向量机在交通流量实时预测中的应用[J]．公路交通科技，2005，22(12)：131-134．
[215] 杨兆升，谷远利．实时动态交通流预测模型研究[J]．公路交通科技，1998，15(3)：4-7．
[216] 杨兆升，李全喜．基于城市交通控制系统的动态车辆路线选择的方法[J]．公路交通科技，1999，16(1)：13-16．
[217] 杨兆升，初连禹．动态路径诱导系统的研究进展[J]．公路交通科技，2000，17(1)：34-38．
[218] 杨清华，贺国光，马寿峰．对动态交通分配的反思[J]．系统工程，2000，18(1)：49-54．
[219] 易汉文．由合理路径阻抗推求区间出行阻抗[J]．系统工程，1994，13(4)：61-64．
[220] 于雷，陈旭梅，耿彦斌等．基于小波分解的智能交通数据集成方法[J]．清华大学学报，2004，44(6)：793-796．
[221] 袁振洲．动态交通分配中道路阻抗模型的研究[J]．中国公路学报，2002，15(3)：92-95．
[222] 张国强，宴克非．城市道路网络交通特性仿真模型及最短路径算法[J]．交通运输工程学报，2002，3(3)：60-62．
[223] 张丽萍，柴跃廷．车辆路径问题的改进遗传算法[J]．系统工程理论与实践，2002，22(8)：79-84．
[224] 张杨，黄庆，卜祥智．随机旅行时间局内车辆路径问题的模型及算法[J]．管理工程学报，2006，20(3)：82-85．
[225] 张义华，何仁斌，王伟．改进L随机路径选择模型及其算法实现[J]．重庆大学学报，2002，25(12)：95-97．
[226] 张智勇，荣建，任福田等．车辆跟驰时间序列实测数据采集方法研究[J]．公路交通科技，2004，21(12)：96-99．
[227] 郑英力，翟润平，马社强．交通流元胞自动机模型综述[J]．公路交通科技，2006，23(1)：110-115．
[228] 周晶，黄园高．具有弹性需求收费道路的定价策略分析[J]．系统工程学报，2005，20(1)：19-22．
[229] 朱中，杨兆升．实时交通流量人工神经网络预测方法[J]．中国公路学报，1998，11(4)：89-92．
[230] 朱志军，徐寅峰，刘春草．局内车辆选线问题和竞争策略分析[J]．系统工程学报，2003，18(4)：324-330．
[231] 朱兴文，贾磊，丁续东等．城市交通网络中的路径优化算法[J]．山东大学学报，2005，35(1)：74-77．
[2] Adler J L, Recker W W, McNally M G In-laboratory experiments to analysis en-route driver behavior under ATIS [P]. Report Number: UCI-ITS-WP-93-3, 1993,University of California, Irvine, and Institute of Transportation Research.
[3] Adler J L. McNally M.G In laboratory experiment-ts to investigate driver behavior under advanced traveler information systems [J]. Transportation Research C, 1994, 2(3): 149-164.
[4] Adler J L. investigating the learning effects of route choice guidance and traffic advisories on route choice behavior [J]. Transportation Research C, 2001,9(10): 1-14
[5] Alexopoulos C. State space partitioning methods for stochastic shortest path problems [J]. Networks, 1997,30(1): 9-21
[6] Bates J, Polak J, Jones P, Cook A. The valuation of reliability for personal travel [J]. Transportation Research E, 2001(37): 191-229.
[7] Bard J F, Bennett J E. Adlakha V G.A reduction and path preference in stochastic acyclic networks [J]. Management Science, 1991,37(10): 195-215
[8] Beckmann M, McGuire C B, Winsten C. Studies in the Economics of Transportation [M]. Yule University Press, New Haven, Connecticut, 1956.
[9] Bell D E. Regret in Decision Making Under Uncertainty [J], Operations Research, 1982, 30(5): 961-981.
[10] Bell D E. Disappointment in Decision Making Under Uncertainty [J], Operations Research, 1985, 33(1): 1-27
[11] BenAkiva M, Lerman S R.Disaggregate travel and mobility choice models and measures of accessibility [C]. Proceedings, 1978, 3rd International Conference on Behavioral Travel modeling, Adelaide, Australia.
[12] Berger J O. Statistical decision theory and Bayesian analysis [M]. Second edition, New York: Springer Verlag, 1985
[13] Bernstein D, Friesz T L, Tobin R L, Wie B W. A variational control formulation of the simultaneous route and departure-time choice equilibrium problem [P]. Proceedings, 1993, the 12th International Symposium on Transportation and Traffic Theory (edited by Daganzo C F): 107-126.
[14] Bonsall P. Analyzing and modeling the influence of roadside variable message displays on drivers' route choice in world transportation research [P]. Proceedings of the 7th WCTR, 2000, 1: 1-25
[15] Bonsall P W, Parry T. Drivers'requirements for route guidance [P]. Proceedings of the Third International Conference, 1990, in road traffic control, 1-5.
[16] Boyce D E, Ran B, LeBlanc L J. Solving an instantaneous dynamic user optimal choice model [J]. Transportation Science, 1995, 29: 128-142.
[17] Caplice C, Mahrnassani H S. Aspects of commuting behavior: preferred arrival time, use of information and switching propensity [J]. Transportation Research A, 1992, 26(5): 409-418.
[18] Chen P S, Mahmassani H S. Dynamic interactive simulator for studying commuter behavior under real-time traffic information supply strategies [J]. Transportation Research Record, 1993, 1413: 12-21.
[19] Chen T Y, Chang H L, Tzeng G H. Using a weight-assessing model to identify route choice criteria and information effects [J]. Transportation Research A, 2001, 35: 197-224.
[20] Carey M. A constraint qualification for dynamic traffic assignment [J]. Transportation Science, 1986, 20(1): 55-58.
[21] Carey M.Optimal time-varying flows on congestion networks [J]. Operation Research, 1987, 35(1): 58-69.
[22] Carey M.Nonconvexity of the dynamic traffic assignment problem [J]. Transportation Research B, 1992, 26(2): 127-133.
[23] Charnes A, Cooper W W. Chance-constrained programming [J]. Management Science, 1959, 6:73-79
[24] Carlson N R. Physiology of behavior [M]. Allyn and Bacon, Newton, M A, 1986
[25] Chanas S, Delgado M, Verdegay J L, Vila M A. Fuzzy optimal flow on imprecise structure [J]. European Journal of Operational Research, 1995, 83: 568-580
[26] Charness A, Cooper W, Thompson G. Critical path analyses via chance constrained and stochastic programming [J]. Operations Research, 1964, 12: 460-470
[27] Charles M H, Patrick J K, Donald R L. Travel configuration on consumer trip-chained store choice [J]. Journal of Consumer Research, 2004, 31(2): 241-248
[28] Chen H K, Hsueh C E A model and a algorithm for the dynamic user-optimal route choice problem [J]. Transportation Research B, 1998, 32(4): 219-234.
[29] Cherkassky B V, Andrew V G, Radzik T. Shortest paths algorithms: Theory and experimental evaluation [J]. Mathematical Programming, 1996, 73: 129-174
[30] Corea G.A., Kulkami V.G. Shortest paths in stochastic networks with arc lengths having discret distributions [J]. Networks, 1993, 23(3): 175-183
[31] DaganzoC F, Sheffi Y. On stochastic models of traffic assignment [J]. Transportation Science, 1977, 11: 253-274.
[32] Daganzo C F. The cell transmission model: a simple dynamic representation of highway traffic. Transportation Research B, 1994, 28 (4): 269-287
[33] Daganzo C F. The cell transmission model, Part Ⅱ: network traffic [J]. Transportation Research B, 1995, 29(2): 79-93.
[34] Daganzo C F. Reversibility of the time-dependent shortest path problem [J]. Transportation Research B, 2002, (36): 665-668.
[35] Danzig G B. Liner Programming under Uncertainty [J]. Management Science, 1955, 1:197-206
[36] David Levison. The value of advanced traveler information systems for route choice [J]. Transportation Research C, 2003 (11): 75-87.
[37] De Palma A, Meyer G M, Papageorgiou Y Y. Rational choice under an imperfect ability to choose [J]. America Economic Review, 1994, 84:419-440
[38] Dia H. An agent-based approach to modeling driver route choice behavior under the influence of real-time information [J]. Transportation Research C, 2002, 10: 331-349.
[39] Dial R B. A probabilistic multipath traffic assignment algorithm, which obviates path enumeration [J]. Transportation Research, 1971, 5:83-111.
[40] Dijkstra E W. Anote on two problems in connection with graphs [J]. Numerische Mathrnatik, 1959 (1): 269-271.
[41] Drissi-Kaitouni O.A variational inequality formulation of the dynamic traffic assignment problem [J]. European Journal of Operational Research, 1993, 71: 188-204.
[42] Duffell J R, Kalombaris A.Empirical studies of car driver route choice in herfordshire [J]. Trffic Engineering and Control, 1988, 29(7/8): 398-408.
[43] Ridwan M. Fuzzy preference based traffic assignment problem [J]. Transportation Research C, 2004, 12:209-233
[44] Dubois D, Prade H. Fuzzy set and systems: Theory and applications [M]. AcademicPress, New York, 1980
[45] Dubois D, Prade H. Fuzzy set and systems [J]. Fuzzy Set and & Systems, 1980, 3:37-48
[46] Dyer J S, Fishburn P C, Wallenius J, etal. Multiple Criteria Decision-making, Multi-attribute Utility Theory: the Next Ten Years [J]. Management Science, 1992, 38(5): 645-653
[47] Eiger A Mirchandani P, Soroush A. Path preferences and optimal paths in probabilistic networks [J]. Transportation Science, 1985, 19:75-84
[48] Eisele W, Rillet L R. A statistical comparison of travel estimates obtained from intelligent transportation systems and instrumented test vehicles [P]. Presented at the 81st Annual Meeting of Transportation Research Board, Washington D C, January, 2002.
[49] Elkjaer M. Stochastic budget simulation [J]. Intemational Journal of Project Management, 2000, 18(2): 139-147.
[50] Fisk C. Some developments in equilibrium traffic assignment [J]. Transportation Research B, 1980, 14: 243-255.
[51] Frank H. Shortest paths in networks in probabilistic graphs [J]. Operations Research, 1969, 17:583-599
[52] Friesz T L, Luque F J, Tobin R L, Wie B W. Dynamic network traffic assignment considered as a continuous time optimal control problem [J]. Operation Research, 1989, 37: 893-901.
[53] Friesz T L, Bemstein D, Smith T E, Tobin R L, Wie B W .A variational inequality formulation of the dynamicnetworks user equilibrium problem [J]. Operation Research, 1993, 41(1): 179-191.
[54] Funikawa N. A parametric total order on fuzzy numbers and fuzzy shortest routes problem [J]. Optimization, 1994, 30: 367-377
[55] Gendreau, Michel, Laporte, Gilbert, Sequin, Rene. Stochastic vehicle routing [J]. European Journal of Operational Research, January 6, 1996(1): 3-12.
[56] Hall R.W. The fastest path through a net works with Radom time-dependent travel times [J]. Transportation Science, 1986, 20(3): 182-188
[57] Harrison J M, Pich M T. Two-monument analysis of open queueing networks with general workstation capabilities [J]. Operations Research, November- December, 1996,44(6): 936-950.
[58] Heydecker B G, Addison J D. An exact expression of dynamic traffic assignment [P]. Proceedings, 1996, the 13th International Symposium on Transportation and Traffic Theory (edited by Daganzo C F): 359-384.
[59] Huang H J, Lam W H K. Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues [J]. Transportation Research B, 2002,36(3): 253-273.
[60] Huang H J, Lin X Q. A multi-class dynamic user equilibrium route and departure time choice problem in queuing networks with advanced traveler information [J]. Journal of mathematical modeling and algorithms, 2003(2): 349-377.
[61] Huchingson R, McNees R, Dudek C.Survey of motorist route-select criteria [J]. Transportation Research Record, 1977, 643: 45-48.
[62] Iida Y, Uchida T, Uno N. Dynamics of route choice behavior considering traveler experience: an experiment analysis[C]. 6e Conference International Sur Les Comportments De Deplacement, Chateau, Bonne Entente, Quebec, 1991,1:316-332.
[63] Ioachim I, Desrosiers J and Soumis F et al. Fleet Assignment and Routing with Schedule Synchronization Constrains [J]. European Journal of Operational Research, 1999,119: 75-90
[64] Jaillet P. Shortest path problem with node failures [J]. Networks, 1989, 22: 589-605
[65] Jan O, Horowitz A J, Peng Z R. Using GPS data to understand variations in path choice [P]. Paper presented at the TRB 79th Annual Meeting, Washington, D C, 2000
[66] Jayakrishnan R.In-vehicle information systems for network traffic control: a simulation framework to study alternative guidance strategies. Ph D. dissertation, 1992, Austin, University of Texas.
[67] Jeffery D J. Route guidance and in-vehicle information systems [A]. P W Bonsai, M Bell. Information Techonology Applications in Transport[C]. Utrecn: VUN Press, 1986, 319-351
[68] Jiang M L, Morikawa T. Theoretical analysis on the variation of value of travel time savings [J]. Transportation Research A, 2004, 38: 551-571.
[69] Kahneman D, Tversky A. Prospect Theory: An Analysis of Decision under Risk [J], Econometrica, 1979, 47(2): 263-291
[70] Kanafani A, A1-Deek H. A simple model for route guidance benefits [J]. Transportation Research Record, 1991, 1111: 126-134.
[71] Kaufman D E, Smith R L, Wunderlich K E. User-equilibrium properties of fixed points in dynamic traffic assignment [J]. Transportation Research C, 1998, 6(1): 1-16.
[72] Khattak A J, Schofer J L, Koppelman F S.A commuters'enroute diversion and return decisions: IVHS design implications [P]. Proceedings of the International Conference on traffic behavior, 1991, Quebec City, Quebec, Canada.
[73] Khattak A J, Koppelman F S, Schofer J L. Stated preferences for investigating commuters' diversion propensity [J]. Transportation 20, 1993:107-127
[74] King G F. Driver perorman in highway tasks [J]. Transportation Research Record. 1986, 1093: 1-11.
[75] King G F, Mast T S. Excess travel: cause, extent, and consequences [J]. Transportation Research B. 1987, 25(4): 191-201.
[76] Klein C M. Fuzzy shorstest path problem [J]. Fuzzy Set and & Systems, 1991, 39:27-41
[77] Korhonen P. Moskowitz H, Wallenius J. Multiple Criteria Decision Support —A Review [J]. European Joumal of Operational Research, 1992, 63(3): 361-375.
[78] Kulkami V.G. Shortest paths in networks with exponentially distributed arc lengths [J]. Networks, 1986, 16:255-274
[79] Kuwahara M, Akamatsu T. Dynamic equilibrium assignment with queues for a one-to-many OD pattern [P]. Proceedings, 1993, the 12th International Symposium on Transportation and Traffic Theory: 185-204.
[80] Kuwahara M, Akamatsu T.Decomposition of reactive dynamic assignment with queues for a many-to-many origin-destination pattern [J]. Transportation Research B, 1997,31(1): 1-10.
[81] LamT C, Small K A. The value of time and reliability: measurement from a value pricing experiment [J]. Transportation Research E, 2001, 37: 231-251.
[82] Lam W H K, Huang H J. Dynamic user optimal traffic assignment model for many to one travel demand [J]. Transportation Research B, 1995, 29(4): 243-259
[83] Lam W H K, Zhou J, Sheng Z H. A capacity restraint transit assignment with elastic line frequency [J]. Transportation Research B, 2002,36(10): 919-938.
[84] LeBlance L J, Morlok E K, Piersskalla W P. An efficient approach to solving the road network equilibrium traffic assignment problem [J] Transportation Research B, 1975,9: 309-318.
[85] Leonid E. On dynamics of traffic queues in a road networks with route choice based on real time traffic information [J]. Transportation Research C, 2003, 11: 161-183.
[86] Lin K C, Chern S. The fuzzy shorstest path problem and its most vital arcs [J]. Fuzzy Set and & Systems, 1993, 58: 343-353
[87] Liu H X, Recker W, Chen A.Uncovering the contribution of travel time reliability to dynamic route choice using real-time loop data [J]. Transportation Research A, 2004,38: 435-453
[88] Lo H K, Szeto W Y. A methodology for sustainable traveler information services [J]. Transportation Research B, 2002,36(2): 113-130.
[89] Lo H K, Yung Y K.Network with degradable links capacity analysis and design [J]. Transportation Research B, 2003, 37(4): 345-363.
[90] Loomes G, Sugden R. Regret theory: An alternative theory of rational choice under uncertainty [J], Economic Journal, 1982,92(December): 805-824.
[91] Loui R. Optimal paths in graphs with stochastic or multidimensional weights [J]. Communications of the ACM, 1983,26: 670-676
[92] Luque F J, Friesz T L. Dynamic traffic assignment considered as a continuous time optimal control problem. 1980, Presented at the TIMS/ORSA Joint National Meeting, Washington, D C.
[93] Mahamassani H S, Peeta S, Hu T Y, Ziliaskopoulos. Dynamic traffic assignment with multiple user classes for real-time ATIS/ATMS applications [A]. Large Urban System, U.S. Federal Highway Administration, Washington, D C, 1992, 91-114.
[94] Mahamassani H S, Peeta S. Network performance under system optimal and user equilibrium Dynamic assignment: implications for ATIS [J]. Transportation Research Record,1993, 1408:83-93.
[95] Mcfadden D, Reid F. Aggregate travel demand forecasting fi'om disaggregate behavioral models [J]. Transportation Research Record, 1975, 534: 24-37.
[96] Merchant D K, Nemhauser G L. A model and an algorithm for the dynamic traffic assignment [J]. Transportation Science, 1978a, 12: 183-199.
[97] Merchant D K, Nemhauser G L.Optimality conditions for a dynamic traffic assignment model [J]. Transportation Science, 1978b, 12: 200-207.
[98] Michael H A. The performance of route modification and demand stabilization strategies in stochastic vehicle routing [J]. Transportation Research B: Methodological, November, 1998(8): 551-566.
[99] Mirchandani P, Soroush H. Optimal paths in probabilistic networks: a case with temporary preferences [J]. Computer & Operations Research, 1985, 12(12): 365-381
[100] Miller-Hooks E, Mahmassani H. Least possible time paths in stochastic, time-varying networks [J]. Computer & Operations Research, 1998, 25(12): 1107-1125
[101] Miller-Hooks E, Mahrnassani H. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks [J]. European Journal of Operational Research, 2003(146): 67-82
[102] Moskowitz H, Prechel P V, Yang A. Multi-criteria Robust Interactive Decision Analysis (MCRID) for Optimizing Public Policies [J]. European Journal of Operational Research, 1992, 56(2): 219-236.
[103] Nakayama S, Kitamura R. A route choice model with inductive leaming [P]. Paper presented at the TRB 79th Annual Meeting, Washington, D C, 2000.
[104] Okada S, Gen M. Fuzzy multiple choice knapsack problem [J]. Fuzzy Set and & Systems, 1994, 67:71-80
[105] Ohtsubo Y. Minimizing risk models in stochastic shorstest path problems [J]. Mathematical methods Operations Research, 2003, 57: 79-88
[106] Paletta G A multi-period traveling salesman problem heuristic algorithms [ J] . Computer & Operations Research. 1992, 18(8): 789-795
[107] Papastavrou J D, Rajagopalan S and Kleywegt A J.The Dynamic and Stochastic Knapsack Problem with Deadlines [J]. Management Science, 1996, 42(12): 1707-1718
[108] Park D, Rillet L R. Forecasting multi-period freeway link travel time using modular neural networks [J]. Transportation Research Record, 1998, 1617: 163-170.
[109] Pattanamekar P. Dynamic and stochastic shorstest path in transportation networks with two components of travel time uncertainty [J]. Transportation Research C, 2003,11:331-354
[110] Payne J, Bettman J, Johnson E. Adaptive strategy in decision making [J]. Journal of Experimental Psychology: Learning, Memory and Cognition, 1988, 14:534-552
[111] Philips A. Delay performance in stochastic processing networks with priority service [J]. Operations Research Letters, September, 2003(5): 390-400.
[112] Polychronopoulos G H. Stochastic shortest path problems with recouse [J]. Networks, 1996,27(2): 133-143
[113] Prashker J N. Direct analysis of the perceived importance of attributes of reliability of travel modes in urban travel [J]. Transportation, 1979, 8: 329-346.
[114] Pretolani D. A directed hypergraph model for Radom time dependent shortest paths [J]. European Journal of Operational Research, 2000,123: 315-324
[115] Psaraftis H, Tsitssiklis J. Dynamic shortest paths in acyclic networks with Markovian arc cost. Operations Research, 1993(41): 91-101
[116] Pursula M, Talvitie A.Urban route choice modeling with multinomial logit models[C]. World Conference on Transportation Research, 1992, vol6, Lyon.
[117] Ran B, Boyce, D E. Modeling dynamic transportation networks: an intelligent transportation system oriented approach [M]. Springer, Heidelbeg, 1996. Heidelberg.
[118] Ran B, Boyce D E, LeBlanc L J.A new class of instantaneous dynamic user-optimal traffic assignment models [J]. Operation Research, 1993, 41(1): 192-202.
[119] Ran B, Hall W R, Boyce D E. A link-based variational inequality model for dynamic departure time/route choice [J]. Transportation Research B, 1996, 30(1): 31-46.
[120] Salo A A. Interactive Decision Aiding for Group Decision Support [J]. European Journal of Operational Research, 1995, 84(1): 134-139.
[121] Sheffi Y. Urban transportation networks: equilibrium analysis with mathematical programming methods [M]. Englewood Cliffs, New Jersey: Pentice-Hall, 1985.
[122] Sgal C, Pritsker A, Solberg J. The stochastic shortest route problem [J]. Operations Research, 1980, 28:1122-1129
[123] Shi H. Time work tradeoffs of the single source shortest path [J]. Journal of algorithms, 1999, 30(1): 19-32
[124] Smith M J. Existence, uniqueness and stability of traffic equilibria [J]. Transportation Research B, 1979, 13: 295-304.
[125] Smith M J. A new dynamic traffic and existence and ealaulation of dynamic user equilibria on congestion capacity-constrained road networks[J]. Transportation Research B, 1993, 27: 49-63.
[126] Smith M J, Wisten M B. A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium [A]. Annals of Operation Research, 1995, 60: 59-79.
[127] Tavares L V, Ferreira J A, Silva J C. On the optimal management of project risk [J]. European Journal of Operational Research. 1998, 107(3): 451-469.
[128] Taylor K A. A regret theory approach to assessing consumer satisfaction [J]. Marketing Letters, 1997, 8: 229-238.
[129] Thoroup M. Flouts, integers and single source shortest path [J]. Journal of algorithms, 2000, 35(2): 189-201
[130] Tsiors M, Mittal V. Regret: A model of its antecedents and consequences in decision making [J]. Journal of Consumer Research, 2000, 26:401-417
[131] Tsuji H, Takahashi R, Yarnamoto. A stochastic approach estimating the effectiveness of e route guidance system and its related parameters [J]. Transportation Science, 1985, 19(4): 333-351.
[132] Tversky A and Kahneman D. Loss Aversion in Riskless Choice: A Reference-Dependent Model [J], The Quarterly Journal of Economics, 1991, 106:4, 1039-1061
[133] Vythoulkas P C, Koutsopoulos H N. Modeling discrete choice behavior using concepts from fuzzy set theory, approximates reasoning and networks [J]. Transportation Research C, 2003, 11: 5-73
[134] Wachs M.Relationships between drivers'attitudes toward alternative routes and driver and route characteristics [J]. Highway Research Record, 1967, 197: 70-87.
[135] Wardrop J G.Some theoretical of road traffic research. Proceedings of Institute of Civil Engineers [M], 1952, Ⅱ (1): 325-378.
[136] Wellman M R Path planning under time dependent uncertainty [C]. Proceedings of the 11st conference on uncertainty in artificial intelligence, Montreal, Quebec, Canada, 1995:18-20
[137] Wie B W, Friesz T L, Tobin R L. Dynamic user optimal traffic assignment on congested multi-destination networks [J]. Transportation Research B, 1990, 24(6): 431-442.
[138] Wie B W, Tobin R L, Friesz T L. The augment Lagrangian method for solving dynamic network traffic assignment models in discrete time [J]. Transportation Science, 1994, 28(3): 205-220.
[139] Wie B W, Tobin R L, Friesz T L, Bernstein D.A discrete time, nested cost operator approach to the dynamic network user equilibrium [J]. Transportation Science,1995, 29: 79-92.
[140] Yagar S. Dynamic traffic assignment by individual path minimization and queuing [J]. Transportation Research, 1971, 5:179-196.
[141] Yager R R. Decision making using minimization of regret [J]. International Journal of Approximate reasoning, 2004, 36:109-128
[142] Yang H, Kitamura R, Jovanis P P, Vaughn K M. Exploration of route choice behavior with advanced traveler information system using neural networks concepts [J]. Transportation,1993, 20(2): 199-223.
[143] Yang B Y, Miller h E. Adaptive routing considering delays due to signal operations [J]. Transportation Research B, 2004, 38: 385-413.
[144] Zeelenberg M, Petiers R. Beyond valence in consumer dissatisfaction: A review and new findings on behavior responses to regret and disappointment in failed services [J]. Journal of Business Research, 2004, 57:445-455
[145] Zhi-chun Li, Hai-jun Huang. Modeling Heterogenous Drivers' Response to Route Guidance and Parking Information Systems in Stochastic and Time-Dependent Networks. Working Paper, BeiJing University of Aeronautics and Astronautics, 2006.
[146] Ziliaskopoulos A, Mahmassani H.Time-dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications [J].Transportation Research Record, 1993, 1408:94-100
[147] 杜振财，王丽，荣建．期望车头间距的混沌模型[J]．公路交通科技，2005，22(5)：24-27．
[148] 冯蔚东，陈剑，贺国光，刘豹．交通流路线选择行为演化模型[J]．系统工程理论与实践，2002，3：72-79．
[149] 高自友，任华玲．城市动态交通流分配模型与算法[M]．2005，北京：人民交通出版社．
[150] 葛颖恩，杨佩昆．路径选择和交叉口控制组合问题评析[J]．公路交通科技，1998，15()：33-37．
[151] 韩超，宋苏，王成洪．一种改进的短时交通流多步自适应预测算法[J]．公路交通科技，2005，22(1)：115-118．
[152] 贺国光，冯蔚东．ITS与自组织理论[J]．公路交通科技，1998，15(3)：8-12．
[153] 贺国光，徐岩宁．车辆线路引导系统的行驶时间预测模型研究[J]．中国公路学报，1998，11(3)：79-86．
[154] 贺国光，李宇，马寿峰．基于数学模型的短时交通流预测方法探讨[J]．系统工程理论与实践，2000，12：51-56．
[155] 贺国光，王东山．仿真交通流混沌现象的传播特性研究[J]．土木工程学报，2001，37(1)：70-73．
[156] 贺国光，马寿峰．交通诱导系统智能化方案及其仿真研究[J]．系统工程学报，200，17(4)：323-328．
[157] 贺国光，马寿峰，冯蔚东．对交通流分形问题的初步研究[J]．中国公路学报，2002，15(4)：82-85．
[158] 贺国光，冯蔚东．路线选择行为的分支模型[J]．土木工程学报，2003，36(1)：21-25．
[159] 贺国光，万兴义，王东山．基于跟驰模型的交通流混沌研究[J]．系统工程，2003，21(2)：50-55．
[160] 贺国光，冯蔚东．基于R／S分析研究交通流的长程相关性[J]．系统工程学报，2004，19(2)：166-169．
[161] 黄海军．运量分布与运量配流组合模型的研究．北京航空航天大学管理学院，博士论文，1992．
[162] 黄海军．城市交通网络平衡分析：理论与实践[M]．北京：人民交通出版社，1994
[163] 黄海军，徐刚．对Fisk随机均衡配流模型的研究[J]．系统工程，1994，12(4)：45-53．
[164] 黄海军．动态平衡运量配流问题的及其稳态伴随解算法[J]．自动化学报，1994，20(6)：668-677．
[165] 黄海军，吴文祥．交通事故信息分布的有效性分析[J]．系统工程理论方法应用，2001，10(4)：298-301．
[166] 黄海军，吴文祥．交通信息对交通行为影响的评价模型[J]．系统工程理论与实践，2002a，10：81-83
[167] 黄海军，吴文祥．交通信息对交通行为影响的评价模型[J]．系统工程理论方法应用，2002b，10：12-16
[168] 黄海军，王惠文，高自友．动态交通分配研究进展[C]．交通科学的理论于实践，上海会议．
[169] 黄海军．交通行为建模-问题与机会[J]．交通运输系统工程与信息，2002，2(1)：24-29．
[170] 黄海军．城市交通动态网络建模与交通行为研究[J]．管理学报，2005，2(1)：18-22．
[171] 黄海军，罔琼，杨海，高自友．高峰期内公交车均衡乘车行为与制度安排[J]．管理科学学报，2005，8(6)：1-9
[172] 黄中祥，贺国光，马寿峰．对交通系统不确定性的思考[J]．长沙交通学院学报，2002，18(4)：77-81．
[173] 江景波等．网络技术原理及应用[M]．上海：同济大学出版社，1990．
[174] 李捷萍，大城市交通：问题与对策论TDM的作用[J]．城市交通，2002，10：81-83
[175] 李帮义，姚恩瑜．关于最短路问题的一个双目标优化问题[J]．运筹学学报，2001(4)：68-71
[176] 林岚，居民出行与城市交通难题，Horizon & Horizonkey, 2005, 7, 20http://www.horizonkey.com
[177] 刘宝碇，赵瑞清．随机规划与模糊规划[M]．北京：清华大学出版社，1998：74-94
[178] 刘灿齐．车流在交叉口分流向延误的最短路径及算法[J]．同济大学学报，2002，30(1)：52-56
[179] 陆化普，史其信，殷亚峰．动态交通分配理论的回顾与展望[J]．公路交通科技，1996，13(2)：34-43．
[180] 刘宝碇，赵瑞清．随机规划与模糊规划[M]．北京：清华大学出版社，1998：74-94
[181] 刘静，关伟．交通流预测方法综述[J]．2004，21(3)：84-87
[182] 李志纯，黄海军．随机交通分配中有效路径的确定方法[J]．交通运输系统工程与信息，2004，3(1)：28-32．
[183] 李志纯，黄海军．先进的出行者信息系统对出行者选择行为的影响研究[J]．公路交通科技，2005，22(2)：95-99．
[184] 况漠．驾驶员路线选择行为分析[J]．交通运输系统工程与信息，2003，3(3)：58-62．
[185] 李帮义，何勇，姚恩瑜．点带约束成本的最短路问题[J]．高校应用数学学报A，2000，15(1)：93-96
[186] 李振龙．诱导条件下驾驶员路径选择行为的演化博弈分析[J]．交通运输系统工程与信息，2003，3(2)：23-27．
[187] 林震，杨浩．交通信息服务条件下的出行选择分析[J]．中国公路学报，2003，16(1)：87-90．
[188] 梁颖，陈艳艳，任福田．城市路网畅通可靠性分析[J]．公路交通科技，2005，22(12)：105-108．
[189] 马卫民，徐青川．局内军车调度的时间优化及其竞争策略[J]．系统工程学报，2002，17(5)：395-400．
[190] 马寿峰，李艳君，贺国光．城市交通控制与诱导协调模式的系统分析[J]．管理科学学报，2003，6(3)：71-78．
[191] 马寿峰，卜军锋，张安训．交通诱导中系统最优于用户最优的博弈协调[J]．系统工程学报，2005，20(1)：30-37．
[192] 潘文敏．从网络采样数据直接推导起终点矩阵[J]．西安公路学院学报，1983，3：71-84．
[193] 齐东元等．点边带约束成本的最短路问题及其算法[J]．东南大学学报，2001(1)：112-114
[194] 任华玲，高自友．瞬时动念用户最优问题的统—模型及算法研究[J]．土木工程学报，2003，36(7)：95-99．
[195] 四兵锋，高自友，林兴强．停车诱导信息系统条件下的城市交通网络SUE配流模型及算法[J]．公路交通科技，2006，23(1)：120-124．
[196] 石玉峰．战时随机运输时间路径优化研究[J]．系统工程理论与实践，2005，25(4)：133-136．
[197] 苏永云，宴克非，黄翔等．车辆导航系统的动态最短路径搜索算法研究[J]．系统工程，2000，18(4)：32-37．
[198] 苏永云，宴克非，杨晓光等．VNS中动态行程时间与多端动态最短路算法[J]．中国公路学报，2001，14(1)：97-99．
[199] 苏兵，徐渝．不可恢复道路堵塞路径选择问题及其算法[J]．运筹与管理，2005，14(3)：1-4．
[200] 苏兵，徐寅峰．运输工程中路径突发堵塞事件的对策研究[J]．预测，2005，24(2)：76-80．
[201] 谭国真，高文．时间依赖的网络中最小时间路径算法[J]．计算机学报，2002．2：1-6
[202] 谭国真，柳亚玲，高文．随机时间依赖网络的K期望最短路[J]．计算机学报，2003，3：324-331．
[203] 谈晓洁，周晶，盛昭翰．城市交通拥挤及疏导决策分析[J]．管理工程学报，2003，17(1)：56-60．
[204] 唐铁桥，黄海军．不同交通流的统一连续模型[J]．交通运输系统工程与信息，2004a，4(3)：50-54．
[205] 唐铁桥，黄海军．两车道交通流模型与数值计算[J]．科学通报，2004b，49(19)：1937-1943．
[206] 唐铁桥，黄海军．用燕尾突变理来论讨论交通流预测[J]．数学研究，2005，38(1)：112-116．
[207] 田琼，黄海军，杨海．瓶颈处停车换乘logit随机均衡选择模型[J]．管理科学学报，2005，8(1)：1-6
[208] 王东山，贺国光．交通混沌研究综述与展望[J]．土木工程学报，2003，36(1)：68-74．
[209] 王小平，曹立明．遗传算法-理论、应用与软件实现[M]．西安：西安交通大 学出版社，2002．
[210] 吴文祥，黄海军．平行路径网络中信息对交通行为的影响研究[J]．管理科学学报，2003，6(2)：12-16．
[211] 吴大艳，谭惠丽，孔令江等．三车道元胞自动机交通流模型研究[J]．系统工程学报，2005，20(4)：393-397．
[212] 夏冰，董菁，张佐．周相似特性下的交通流预测模型研究[J]．公路交通科技，2003，20(2)：73-76．
[213] 熊轶，黄海军，李志纯．交通信息系统作用下的随机用户均衡模型与演进[J]．交通运输系统工程与信息，2003，3(8)：81-83．
[214] 徐启华，杨瑞．支持向量机在交通流量实时预测中的应用[J]．公路交通科技，2005，22(12)：131-134．
[215] 杨兆升，谷远利．实时动态交通流预测模型研究[J]．公路交通科技，1998，15(3)：4-7．
[216] 杨兆升，李全喜．基于城市交通控制系统的动态车辆路线选择的方法[J]．公路交通科技，1999，16(1)：13-16．
[217] 杨兆升，初连禹．动态路径诱导系统的研究进展[J]．公路交通科技，2000，17(1)：34-38．
[218] 杨清华，贺国光，马寿峰．对动态交通分配的反思[J]．系统工程，2000，18(1)：49-54．
[219] 易汉文．由合理路径阻抗推求区间出行阻抗[J]．系统工程，1994，13(4)：61-64．
[220] 于雷，陈旭梅，耿彦斌等．基于小波分解的智能交通数据集成方法[J]．清华大学学报，2004，44(6)：793-796．
[221] 袁振洲．动态交通分配中道路阻抗模型的研究[J]．中国公路学报，2002，15(3)：92-95．
[222] 张国强，宴克非．城市道路网络交通特性仿真模型及最短路径算法[J]．交通运输工程学报，2002，3(3)：60-62．
[223] 张丽萍，柴跃廷．车辆路径问题的改进遗传算法[J]．系统工程理论与实践，2002，22(8)：79-84．
[224] 张杨，黄庆，卜祥智．随机旅行时间局内车辆路径问题的模型及算法[J]．管理工程学报，2006，20(3)：82-85．
[225] 张义华，何仁斌，王伟．改进L随机路径选择模型及其算法实现[J]．重庆大学学报，2002，25(12)：95-97．
[226] 张智勇，荣建，任福田等．车辆跟驰时间序列实测数据采集方法研究[J]．公路交通科技，2004，21(12)：96-99．
[227] 郑英力，翟润平，马社强．交通流元胞自动机模型综述[J]．公路交通科技，2006，23(1)：110-115．
[228] 周晶，黄园高．具有弹性需求收费道路的定价策略分析[J]．系统工程学报，2005，20(1)：19-22．
[229] 朱中，杨兆升．实时交通流量人工神经网络预测方法[J]．中国公路学报，1998，11(4)：89-92．
[230] 朱志军，徐寅峰，刘春草．局内车辆选线问题和竞争策略分析[J]．系统工程学报，2003，18(4)：324-330．
[231] 朱兴文，贾磊，丁续东等．城市交通网络中的路径优化算法[J]．山东大学学报，2005，35(1)：74-77．