Solving noisy, large-scale fixed-point problems and systems of nonlinear equations

Transportation Science

Volumn 40, Issue 1, 2006, Pages 44-63

  Bierlaire, Michel ^a   Crittin, Frank ^b  

^a EPFL   (Switzerland)

^b IDIAP RESEARCH INSTITUTE   (Switzerland)

Author keywords

Fixed point problems; Nonlinear equations; OD matrix estimation; Route guidance; Traffic networks

Indexed keywords

AIR TRAFFIC CONTROL; APPROXIMATION THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; NONLINEAR EQUATIONS; TRANSPORTATION ROUTES;

FIXED-POINT PROBLEMS; OD MATRIX ESTIMATION; ROUTE GUIDANCE; TRAFFIC NETWORKS;

AIR TRANSPORTATION;

EID: 33644601326     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1050.0119     Document Type: Article

References (70)

1. Arnott, R., A. de Palma, R. Lindsey. 1991. Does providing information to drivers reduce traffic congestion? Transportation Res. Part A 25(5) 309-318.
2. Ascher, U., R. D. Russell, eds. 1985. Numerical Boundary Value ODEs, Vol. 5 Progress in Science Computing. Birkhäuser, Boston, MA.
3. Astarita, V., AK. Er-Rafia, M. Florian, M. Mahut, S. Velan. 2001. Comparison of three methods for dynamic network loading. Transportation Res. Record 1771 179-190.
4. Banach, S. 1922. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundamenta Mathematicae 3 133-181.
5. Barbour, R., J. D. Fricker. 1994. Estimating an origin-destination table using a method based on shortest augmenting paths. Transportation Res. Part B 28(2) 77-89.
6. Bell, M. G. H. 1983. The estimation of an origin-destination matrix from traffic counts. Transportation Sci. 17(2) 198-217.
7. Bell, M. G. H. 1984. Log-linear models for the estimation of origin-destination matrices from traffic counts: An approximation. J. Volmuller, R. Hamerslag, eds. Proc. 9th Internat. Sympos. Transportation Traffic Theory, VNU Science Press, Utrecht, The Netherlands, 451-470.
8. Ben-Akiva, M., M. Bierlaire. 2003. Discrete choice models with applications to departure time and route choice. R. Hall, ed. Handbook of Transportation Science, 2nd ed. Kluwer Academic Press, Boston/Dordrecht/London, 7-37.
9. Ben-Akiva, M. E., A. de Palma, I. Kaysi. 1996. The impact of predictive information on guidance efficiency: An analytical approach. L. Bianco, P. Toth, eds. Advanced Methods in Transportation Analysis. Springer, Berlin, German, 413-432.
10. Ben-Akiva, M. E., M. Bierlaire, H. N. Koutsopoulos, R. G. Mishalani. 1998. DynaMIT: A simulation-based system for traffic prediction. Proc. DACCORD Short-Term Forecasting Workshop.
11. Ben-Akiva, M., M. Bierlaire, H. N. Koutsopoulos, R. Mishalani. 2002. Real-time simulation of traffic demand-supply interactions within DynaMIT. M. Gendreau, P. Marcotte, eds. Transportation and Network Analysis: Current Trends. Miscellenea in Honor of Michael Florian. Kluwer Academic Publishers, Boston/Dordrecht/London.
12. Bierlaire, M. 2002. The total demand scale: A new measure of quality for static and dynamic origin-destination trip tables. Transportation Res. Part B 36(9) 837-850.
13. Bierlaire, M., F. Crittin. 2003. Generalization of secant methods for solving systems of nonlinear equations. Proc. 3rd Swiss Transportation Res. Conf., Ascona, Switzerland.
14. Bierlaire, M., F. Crittin. 2004. An efficient algorithm for real-time estimation and prediction of dynamic OD tables. Oper. Res. 52(1) 116-127.
15. Bierlaire, M., P. L. Toint. 1995. MEUSE: An origin-destination estimator that exploits structure. Transportation Res. Part B 29(1) 47-60.
16. Bogle, I., J. Perkins. 1990. A new sparsity preserving quasi-Newton update for solving nonlinear equations. SLAM J. Sci. Statist. Computations 11 621-630.
17. Bottom, J. 2000. Consistent anticipatory route guidance. Doctoral dissertation, Massachusetts Institute of Technology, Cambridge, MA.
18. Bottom, J., M. Ben-Akiva, M. Bierlaire, I. Chabini, H. Koutsopoulos, Q. Yang. 1999. Investigation of route guidance generation issues by simulation with DynaMIT. A. Ceder, ed. Transportation and Traffic Theory. Proc. 14th ISTTT, Pergamon, New York, 577-600.
19. Broyden, C. G. 1965. A class of methods for solving nonlinear simultaneous equations. Math. Comput. 19 577-593.
20. Byrd, R., J. Nocedal, R. B. Schnabel. 1994. Representation of quasi-Newton matrices and their use in limited memory methods. Math. Programming 63 129-136.
21. Cantarella, G. E. 1997. A general fixed-point approach to multimode multi-user equilibrium assignment with elastic demand. Transportation Sci. 31(2) 107-128.
22. Cascetta, E. 1984. Estimation of trip matrices from traffic counts and survey data: A generalised least squares approach estimator. Transportation Res. Part B 18(4/5) 289-299.
23. Cascetta, E. 2001. Transportation Systems Engineering: Theory and Methods. Applied Optimization, Kluwer Academic Publishers, Dordrecht/Boston/ London.
24. Cascetta, E., M. Postorino. 2001. Fixed point approaches to the estimation of O/D matrices using traffic counts on congested networks. Transportation Sci. 35 134-147.
25. Choi, T. D., C. Kelley. 2000. Superlinear convergence and implicit filtering. SIAM J. Optim. 10.
26. Crittin, F. 2003. New algorithmic methods for real-time transportation problems. Doctoral dissertation 2877, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland.
27. Dennis, J. E., J. J. Moré. 1977. Quasi-Newton methods, motivation and theory. SIAM Rev. 19 46-89.
28. Dennis, J. E., R. B. Schnabel. 1996. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, Philadelphia, PA.
29. Dennis, J. E., H. F. Walker. 1985. Least-change sparse secant update methods with inaccurate secant conditions. SIAM J. Numerical Anal. 22(4) 760-778.
30. Dolan, E. D., J. J. Moré. 2002. Benchmarking optimization software with performance profiles. Math. Programming, Series A 91(2) 201-213.
31. Eaton, J. W. 1997. GNU octave: A high-level interactive language for numerical computations, www.octave.org.
32. Eyert, V. 1996. A comparative study on methods for convergence acceleration of iterative vector sequences. J. Computational Phys. 124 271-285.
33. Ford, J. A. 1999. A survey of multi-step quasi-Newton methods. Froc. Internat. Conf. Sci. Computations, Beirut, Lebanon.
34. Ford, J. A., I. A. Moghrabi. 1997. Alternating multi-step quasi-Newton methods for unconstrained optimization. J. Computational Appl. Math. 82 105-116.
35. Friedlander, A., M. A. Gomes-Ruggiero, D. N. Kozakevich, J. M. Martínez, S. A. Santos. 1997. Solving nonlinear systems of equations by means of quasi-Newton methods with a nonmonotone strategy. Optim. Methods Software 8 25-51.
36. Golub, G. H., C. F. Van Loan. 1989. Matrix Computations, 2nd ed. Johns Hopkins University Press, Baltimore, MA.
37. Gomes-Ruggiero, M., D. Kozakevich, J. Martinez. 1996. A numerical study on large-scale nonlinear solvers. Computers Math. Appl.; An Internat. J. 32 1-13.
38. Gomes-Ruggiero, M. A., J. M. Martinez, A. C. Moretti. 1992. Comparing algorithms for solving sparse nonlinear systems of equations. SIAM J. Sci. Statist. Comput. 13(2) 459-483.
39. Gragg, W., G. Stewart. 1976. A stable variant of the secant method for solving nonlinear equations. SIAM J. Numer. Anal. 13 889-903.
40. Hall, R. W. 1986. The fastest path through a network with random time-dependent travel times. Transportation Sci. 20(3) 182-188.
41. Hazelton, M. 2000. Estimation of origin-destination matrices from link flows on uncongested networks. Transportation Res. Part B 34(7) 549-566.
42. Johnson, D. 1988. Modified Broyden's method for accelerating convergence in self-conssistent calculations. Physical Rev. B 38(18) 12807-12813.
43. Kelley, C. T. 1995. Iterative Methods for Linear and Nonlinear Equations. Frontiers in Applied Mathematics, SIAM, Philadephia, PA.
44. Kelley, C. T. 2003. Solving Nonlinear Equations with Newton's Method. SIAM, Philadelphia, PA.
45. Li, G. 1989. Successive column correction algorithms for solving sparse non-linear systems of equations. Math. Programming 43 187-207.
46. Luksan, L. 1994. Inexact trust region method for large sparse systems of nonlinear equations. J. Optim. Theory Appl. 81(3) 569-590.
47. Luksan, L., J. Vlcek. 1998. Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations. Optim. Methods Software 8 185-199.
48. Mahmassani, H., T. Hu, S. Peeta, A. Ziliaskopoulos. 1993. Development and testing of dynamic traffic assignment and simulation procedures for ATIS/ATMS applications. Technical Report DTFH61-90-R-00074-FG, Center for Transportation Research, University of Texas, Austin, TX.
49. Martinez, J. M. 1979. Three new algorithms based on the sequantial secant method. BIT 19 236-243.
50. Martinez, J. M. 1984. A quasi-Newton method with modification of one column per iteration. Computing 33 353-362.
51. Martinez, J. M. 2000. Practical quasi-Newton methods for solving nonlinear systems. J. Computational Appl. Math. 124 97-122.
52. Martinez, J. M., M. C. Zambaldi. 1992. An inverse column-updating method for solving large-scale nonlinear systems of equations. Optim. Method Software 1.
53. Messmer, A., M. Papageorgiou. 1990. METANET: A macroscopic simulation program for motorway networks. Traffic Engrg, Control 31 466-170.
54. Moghrabi, I. 1993. Multi-step quasi-Newton methods for optimization. Doctoral dissertation, University of Essex, Essex, UK.
55. Moré, J. J., B. S. Garbow, K. E. Hillstrom. 1981. Testing unconstrained optimization software. ACM Trans. Math. Software 7(1) 17-41.
56. Nocedal, J., S. J. Wright. 1999. Numerical Optimization. Springer Series in Operations Research. Springer-Verlag, New York.
57. Ornstein, L. S., F. Zernike. 1914. Proc. Acad. Sci., Amsterdam, Vol. 17. 793.
58. Ortega, J. M., W. C. Rheinboldt. 1970. Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.
59. Paige, C. C., M. A. Saunders. 1982. LSQR: An algorithm for sparse linear equations and sparse least squares. ACM. Trans. Math. Software 8 43-71.
60. Patriksson, M. 1994. The Traffic Assignment Problem, Models and Methods. VSP, Utrecht, The Netherlands.
61. Robert, S. M., J. S. Shipman. 1976. On the closed form solution of Troesch's problem. J. Comput. Physics 21 291-304.
62. Roose, A., V. Kulla, M. Lomp, T. Meressoo. 1990. Test examples of systems of non-linear equations. Estonian Software Comput. Service Company, Tallin.
63. Saad, Y., M. Schultz. 1986. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Nurner. Anal. 7 856-869.
64. Spedicato, E., Z. Huang. 1997. Numerical experience with Newton-like methods for nonlinear algebraic systems. Comput. 58 69-99.
65. Spiess, H. 1987. A maximum likelihood model for estimating origin-destination matrices. Transportation Res. Part B 21(5) 395-412.
66. Toint, P. L. 1986. Numerical solution of large sets of algebraic nonlinear equations. Math. Comput. 46(173) 175-189.
67. Van Zuylen, H. J., L. G. Willumsen. 1980. The most likely trip matrix estimated from traffic counts. Transportation Res. Part B 14 281-293.
68. Vanderbilt, D., S. G. Louie. 1984. Total energies of diamond (111) surface reconstructions by a linear combination of atomic orbitals method. Physical Rev. B 30(10) 6118-6130.
69. Wolfe, P. 1959. The secant method for solving nonlinear equations. Comm. ACM 12 12-13.
70. Yang, Q., H. N. Koutsopoulos. 1997. A microscopic traffic simulator for evaluation of dynamic traffic management systems. Transportation Res. Part C 4(3) 113-129.