REFERENCES¶
Akcelic (1982). Progress in Fuel Consumption Modelling for Urban Traffic Management. Australian Road Research Board Research Report ARR No. 124.
O. Balci, (1998). Verification, Validation and Testing, in: Handbook of Simulation: Principles, Methodology, Advances, Applications and Practice, Ed. by J. Banks, John Wiley, 1998.
J. Barceló and J. Casas (2002), Dynamic Network Simulation with AIMSUN, presented at the International Symposium on Transport Simulation, Yokohama, (also in: Simulation Approaches in Transportation Analysis: Recent Advances and Challenges, Edited by R. Kitamura and M. Kuwahara, Kluwer 2005).
M. Carey and Y.E. Ge, (2007), Comparison of methods for Path Flow Reassignment for Dynamic User Equilibrium, May 2007, School of management & Economics, Queen's University, Belfast, Northern Ireland.
E. Cascetta, (2001), Transportation Systems Engineering: Theory and Methods, Kluwer Academic Publishers
R.J. Cowan, (1975). Useful Headway Models. Transportation Research, Vol. 9, pp. 371-375
Anthony Chen, Der-Horng Lee, (1998) Path-Based Algorithms for a Large-Scale Traffic Equilibrium Problem: A Comparison of the Disaggregate Simplicial Decomposition and Gradient Projection Algorithms, Institute for Transportation Studies, University of California, Irvine.
Department of Transport, (1994), New Car Fuel Consumption: the official figures December 1994, UK DoT.
E.W. Dijkstra, (1959), A Note on Two Problems in Connection with Graphs, Numerische Mathematic, 1, 269-271.
L.J.A. Ferreira, (1982), Car Fuel Consumption in Urban Traffic: The Results of a Survey in Leeds using Instrumented Vehicles. ITS Working Paper Nº 162. Institute for Transportation Studies. University of Leeds.
M.Florian, M. Mahut and N. Tremblay (2001), A Hybrid Optimization-Mesoscopic Simulation Dynamic Traffic Assignment Model, Proceedings of the 2001 IEEE Intelligent Transport Systems Conference, Oakland, pp. 118-123.
M. Florian, M. Mahut and N. Tremblay, (2002), Application of a Simulation-Based Dynamic Traffic Assignment Model, presented at the International Symposium on Transport Simulation, Yokohama (also in: Simulation Approaches in Transportation Analysis, Edited by R. Kitamura and M. Kuwahara, Kluwer, 2005 pp 1-21)
M. Florian and D. Hearn, (1995), Network Equilibrium Models and Algorithms, Chapter 6 in: M.O. Ball et al., Eds., Handbooks in OR and MS, Vol.8, Elsevier Science B.V.
T. L. Friesz, D. Bernstein, T. E. Smith, R.L. Tobin and B.W. Wie, (1993), A Variational Inequality Formulation of the Dynamic Network User equilibrium Problem, Operations Research, Vol. 41, No. 1, 179-191.
D. Helbing, Péter Molnár, (1998), Social force model for pedestrian dynamics, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics 51(5).
J. Hughes, (1998). Aimsun Simulation of a Congested Auckland Freeway, Proceedings of the 6th EURO Working Group Meeting, Gothenburg.
P.G.Gipps, (1981). A behavioural car-following model for computer simulation. Transportation Research Board, Vol. 15-B, pp. 105-111.
P.G.Gipps, (1986a). A model for the structure of lane-changing decisions. Transportation Research - B. Vol. 20-B, No. 5, pp. 403-414.
P.G.Gipps, (1986b). MULTSIM: A Model for Simulating Vehicular Traffic on Multi-Lane Arterial Roads. Mathematics and Computers in Simulation, 28. 291-295.
B. N. Janson, (1991), Dynamic Assignment for Urban Road Networks, Transpn. Res. B, Vol. 25, Nos. 2/3, pp. 143-161.
J.P.C Kleijnen (1995), Theory and Methodology: Verification and Validation of Simulation Models, European Journal of Operational Research, Vol. 82, pp. 145-162.
Law, Averill M. and Kelton W. David, (1991) Simulation Modeling and Analysis. McGraw-Hill International Editions. Second Edition.
H.X. Liu, W. Ma, J.X. Ban and P. Michardani, (2005), Dynamic equilibrium Assignment with Microscopic Traffic Simulation, 8^th^ International IEEE Conference on Intelligent Transport Systems.
H.X. Liu, X. He, and B. He, (2007), Method of successive weighted averages (MSWA) and self-regulated averaging schemes for solving stochastic user equilibrium problem, Networks and Spatial Economics.
H. K. Lo and W.Y. Szeto, (2002), A cell-based variational inequality formulation of the dynamic user optimal assignment problem, Transportation Research Part B 36, 421-443.
Chung-Cheng Lu, Hani S. Mahmassani, Xuesong Zhou, “Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem” Transportation Research Part B: Methodological, Volume 43, Issue 3, 2009, Pages 345-364, ISSN 0191-2615
H, Mahmassani, (2001), Dynamic Network Traffic Assignment and Simulation Methodology for Advanced System Management Applications, Network and Spatial Economics, 1, 267-292.
M. Mahut, (1999a). Speed-maximizing car-following models based on safe stopping rules. Transportation Research Board, 78th Annual Meeting, January 10-14, 1999.
M.Mahut, (1999b). Behavioural Car Following Models. Report CRT-99-31. Centre for Research on Transportation. University of Montreal. Montreal, Canada.
Mahut, M.(2001) A Discrete Flow Model for Dynamic Network Loading , Ph.D. thesis, Department d'IRO and CRI, Université de Montréal.
M. Mahut, M. Florian, N. Tremblay, (2003a) Space-Time Queues and Dynamic Traffic Assignment: A Model, Algorithm and Applications, Transportation Research Board, 82nd Annual Meeting, 2003.
M. Mahut, M. Florian and N.Tremblay, (2003b), Traffic Simulation and Dynamic Assignment for Off-line Applications, presented at the 10th World Congress on Intelligent Transportation Systems, Madrid.
M. Mahut, M. Florian and N.Tremblay, (2004), INRO Consultants Inc., Montréal, QC and M. Campbell, D. Patman and Z. Krnic McDaniel, City of Calgary, Calgary, AB (2004) Calibration and Application of a Simulation based Dynamic Traffic Assignment Model, Transportation Research Record 1876, pp. 101-111. Available at:
http://trb.metapress.com/content/904777v2g0265267/
National Electrical Manufacturers Association, (2003), NEMA Standards Publication TS 2-2003 v02.06 Traffic Controller Assemblies with NTCIP Requirements.
M. Papageorgiou, I. Papamichail, Overview of traffic signal operation policies for ramp metering. Transportation Research Record no. 2047, 2008, pp. 28-36.
M. Papageorgiou, H Hadj-Salem, JM Blosseville. ALINEA: A Local Feedback Control Law for On-Ramp Metering Transportation Research Record no. 1320 , 1991, pp. 58-64.
S. Peeta,. and H. S Mahmassani, (1995), System Optimal and User Equilibrium Time-Dependent Traffic Assignment in Congested Networks. Annals of Operation Research, 60, 1995, pp. 81-113.
M. Pidd, (1992) Computer Simulation in Management Science, John Wiley.
QUARTET Deliverable Nº2 (1992), Assessment of current Tools for Environmental Assessment in QUARTET, DRIVE II Project V2018: QUARTET, September 1992.
B. Ran, and D. Boyce, (1996), Modeling Dynamic Transportation Networks, Springer-Verlag,.
H. Sbayti, C. Lu and H. S.. Mahmassani, (2007), Efficient Implementations of the Method of Successive Averages in Simulation-Based DTA Models for Large-Scale Network Applications, TRB 2007 Annual Meeting
Y. Sheffi, (1985). Urban transportation networks. Equilibrium analysis with mathematical programming methods, Prentice-Hall, Englewood Cliffs, NY.
M.J. Smith, (1993), A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks, Transportation Research Part B 27, 49-63.
H. Theil, (1966) H. Applied Economic Forecasting, North-Holland.
C.O. Tong and S.C. Wong, (2000), A predictive dynamic traffic assignment model in congested capacity-constrained road networks, Transportation Research Part B 34, 625-644.
H.R. Varia and S.L. Dhingra, (2004), Dynamic user equilibrium Traffic Assignment on Congested Multidestination Network, Journal of Transportation Engineering, Vol 130, No. 2, 211-221.
J.H. Wu (1991), A Study of Monotone Variational Inequalities and their Application to Network Equilibrium Problems, Ph. D. Thesis, Centre de Recherche sur les Transports, Université de Montréal, Publication #801.
J.H. Wu, Y. Chen and M. Florian (1998a), The Continuous Dynamic Network Loading Problem: A Mathematical Formulation and Solution Method, Trans. Res.-B, Vol. 32, No. 3, pp.173-187.
J.H. Wu, M. Florian, Y.W. Xu and J.M. Rubio-Ardanaz (1998b), A projection algorithm for the dynamic network equilibrium problem, Traffic and Transportation Studies, Proceedings of the ICTTS'98, pp. 379-390, Ed. By Zhaoxia Yang, Kelvin C.P. Wang and Baohua Mao, ASCE.
Luc Int Panis, Steven Broekx, Ronghui Liu (2006), Modelling instantaneous traffic emission and the influence of traffic speed limits.
M. S. Bazaraa, H.D. Sherali and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, John Wiley (1993)
M.G.H. Bell, The estimation of origin-destination matrices by constrained generalized least squares, Transportation research B, 25B, pp. 115-125 (1991).
M.G.H. Bell and Y. Iida, Transportation Network Analysis, John Wiley (1997).
M.C. Bliemer, M.P. Raadsen, E.S. Smits, B. Zhou, , M. G. Bell (2014). Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model. Transportation Research Part B: Methodological, 68, 363-384.
L.M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solutions of problems in convex programming, USSR Journal of Computational Mathematics and Mathematical Physics, 7(1), pp.191-204 (1967)
E. Cascetta, Estimation of origin-destination matrices from traffic counts and survey data: a generalised least squares estimator, Transportation research 18B, pp. 289-299, (1984).
E. Cascetta, Transportation Systems Engineering: Theory and Methods, Kluwer Academic Publishers (2001).
G. Chang and J. Wu, Recursive estimation of time-varying origin-destination flows from traffic counts in freeway corridors, Transportation Research B, Vol. 28B, No. 2, pp. 141-160, (1994).
E. Codina and J. Barceló, Adjustment of O-D matrices from observed volumes: an algorithmic approach based on conjugate gradients, European Journal of Operations Research, Vol. 155, pp. 535-557, (2004)
M. Daneva and P.O. Lindberg, A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment Problem, Operations research proceedings 2002, pp. 133-138
S. Dafermos, Traffic Equilibrium and Variational Inequalities, Transportation Science, 14, pp 42-54(1980).
S. Erlander and N.F. Stewart, The Gravity Model in Transportation Analysis: Theory and Extensions, VSP (1990).
C. Fisk and Boyce D., Alternative Variational Inequality Formulations of the Network Equilibrium, Transportation Science 17, pp 454-463 (1983).
M. Florian and S. Nguyen, An application and validation of Equilibrium trip assignment models, Transportation Science, Vol. 10, No. 4, pp. 374-390 (1976).
M. Florian, An Introduction to Network Models Used in Transportation Planning, in Transportation Planning Models, M. Florian (ed.) North-Holland pp 137-152 (1984).
M. Florian, Nonlinear Cost Network Models in Transportation Analysis, Mathematical Programming Study, 26 pp. 167-196 (1986).
M. Florian, J. Guelat and H. Spiess, An Efficient Implementation of the PARTAN Variant of the Linear approximation Method for the Network Equilibrium Problem, Networks 17 pp. 319-339 (1987).
M. Florian and D. Hearn, Network Equilibrium Models and Algorithms, Chapter 6 in: M.O. Ball et al., Eds., Handbooks in OR and MS, Vol.8, Elsevier Science B.V. (1995).
M. Florian and Y. Chen, A Coordinate Descent Method for the Bi-level O/D Matrix Adjustment Problem, International Transactions in Operations Research, Vol. 2, No. 2, pp. 165-175 (1995).
M. Frank and Wolfe P., An Algorithm for Quadratic Programming, Naval Researches Logistic Quarterly 3 pp 95-110 (1956). T. J. Fratar, Vehicular trip distribution by successive approximations, Traffic Quarterly, 8, pp. 53-65 (1954)
K.P. Furness, Time function iteration, Traffic Engineering and Control, 7 pp. 458-460 (1965)
D.W. Hearn, S.Lawphonpanich and J.A. Ventura, Restricted Simplicial Decomposition: Computation and Extensions, Mathematical Programming Study, 31 pp. 99-118 (1987).
S. Lawphonpanich and D.W. Hearn, Simplicial Decomposition of the Asymmetric Traffic Assignment Problem, Transportation Research 18B (1984) pp. 123-133.
L.J. LeBlanc, Morlok E.K.and Pierskalla W.P., An Efficient Approach for Solving the Road Network Equilibrium Traffic Assignment Problem, Transportation Research 5, pp 309-318 (1975).
T.L. Magnanti, Models and Algorithms for Predicting Urban Traffic Equilibrium, in: M. Florian, ed., Transportation Planning Models, North-Holland, pp 153-186 (1984).
L. Montero, E. Codina, J. Barceló and P. Barceló, Combining Macroscopic and Microscopic Approaches for Transportation Planning and Design of Road Networks, Transportation Research C 9 (2001) pp. 213-230.
N.L. Nihan and G.A Davis, Application of prediction-error minimization and maximum likelihood to estimate intersection O/D matrices from traffic counts, Transportation Science, 23, pp.77-90, (1989).
Y. Noriega, M. Florian, Multi-Class Demand Matrix Adjustment, CIRRELT-2007-50 (2007)
Y. Noriega, M. Florian, Some Enhancements of the Gradient Method for O-D Matrix Adjustment, CIRRELT-2009-04 (2009)
N. Oppenheim, Urban Travel Demand Modeling: from individual choices to general equilibrium, John Wiley and Sons, 1995.
J. Ortuzar and L. Willumsen, Modeling Transport, John Wiley (2001).
M. Patriksson, The traffic Assignment Problem: Models and Methods, VSP B.V. (1994).
A. Peterson, Origin-Destination Matrix Estimation from Traffic Counts, Linköping Studies in Science and Technology. Theses No. 1057, (2003).
Mark P.H. Raadsen, Michiel C.J. Bliemer, Michael G.H. Bell, An efficient and exact event-based algorithm for solving simplified first order dynamic network loading problems in continuous time.
Y. Sheffi, Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods, Prentice-Hall (1985).
M.J. Smith, Existence, Uniqueness and Stability of Traffic Equilibria, Transportation Research B, 1B, pp 295-304 (1979).
T.E. Smith, A cost-efficiency principle of spatial interaction behaviour, Regional Science and Urban Economics, 8, pp. 313-337 (1978).
H. Spiess, A Gradient Approach for the O/D Matrix Adjustment Problem, Publication No. 693, Centre de Recherche sur les Transports, Université de Montréal (1990).
H.Spiess, and M.Florian. Optimal Strategies: A New Assignment Model for Transit Networks, Transportation Research Part B, Vol 23B, Iss 2, pp 83-102) (1989)
Tampère C.M.J., Corthout R., Cattrysse D., Immers, L.H. (2011). A Generic Class of First Order Node Models for Dynamic Macroscopic Simulation of Traffic Flows. Transportation Research Part B: methodological. Volume 45B issue 1, 2011, pp289-309.
N.J. Van der Zijp and R. Hamerslag, Improved Kalman Filtering Approach for Estimating Origin-Destination Matrices for Freeway Corridors, Transportation Research Record 1443, pp.54-64, (1996).
H. J. van Zuylen and L.G. Willumsen, The most likely trip matrix estimated from traffic counts, Transportation Research 14B, pp. 281-293 (1980).
J.G. Wardrop, Some Theoretical Aspects of Road Traffic Research, Proc. Inst. Civil Engineers, Part II, pp. 325-378 (1952).
J.G. Wardrop, Some Theoretical Aspects of Road Traffic Research, Proc. Inst. Civil Engineers, Part II, pp. 325-378 (1952).
Ros-Roca, X., Montero, L., and Barcelo, J. (2020). Investigating the Quality of Spiess-Like and SPSA approaches for Dynamic OD Matrix Estimation. Transportmetrica A: Transport Science, (just-accepted), 1-43.