Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium
Published Online:1 May 2001https://doi.org/10.1287/trsc.35.2.107.10133
References
- Cyclic flow, Markov process and stochastic traffic assignment. Transportation Res. (1996) 30B:369–386Google Scholar
- Statistical properties of mathematical programming models of stochastic network equilibrium. J. Regional Sci. (1988) 28:511–530Crossref, Google Scholar
- Network loading versus equilibrium estimation of the stochastic route choice model: Maximum likelihood and least squares revisited. J. Regional Sci. (1990) 30:89–103Crossref, Google Scholar
- Estimation of an origin-destination table using a method on shortest augmenting paths. Transportation Res. (1994) 28B:77–89Crossref, Google Scholar
- Nonlinear Programming: Theory and Algorithms (1993) (John Wiley & Sons, Inc, New York) Google Scholar
- Variance and covariance for origin-destination flows when estimated by log-linear models. Transportation Res. (1984) 18B:497–507Google Scholar
- The estimation of origin-destination matrices by constrained generalized least squares. Transportation Res. (1991) 25B:13–22Crossref, Google Scholar
- Alternatives of Dial's logit assignment algorithm. Transportation Res. (1995) 29B:287–295Crossref, Google Scholar
- MEUSE: An origin-destination matrix estimator that exploits structure. Transportation Res. (1995) 29B:47–60Crossref, Google Scholar
- Estimation of origin-destination matrices from traffic counts using multiobjective programming formulations. Transportation Res. (1989) 23B:257–269Crossref, Google Scholar
- Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator. Transportation Res. (1984) 18B:289–299Crossref, Google Scholar
- A unified framework for estimating or updating matrices from traffic counts. Transportation Res. (1988) 18B:189–299Google Scholar
- Some statistical problems in connection with traffic assignment. Transportation Res. (1977) 11:385–389Crossref, Google Scholar
- On stochastic models of traffic assignment. Transportation Sci. (1977) 11:253–274Link, Google Scholar
- Exact local solution of the continuous network design problem via stochastic user equilibrium assignment. Transportation Res. (1994) 28B:61–75Crossref, Google Scholar
- A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Res. (1971) 5:83–111Crossref, Google Scholar
- A note on the maximum likelihood calibration on Dial's assignment method. Transportation Res. (1977) 11:67–68Crossref, Google Scholar
- Some developments in equilibrium traffic assignment. Transportation Res. (1980) 14B:243–255Crossref, Google Scholar
- A note on trip matrix estimation from traffic count data. Transportation Res. (1983) 17B:245–250Crossref, Google Scholar
- On combining maximum entropy trip matrix estimation with user optimal assignment. Transportation Res. (1988) 22B:69–79Crossref, Google Scholar
- Trip matrix estimation from link traffic counts: The congested network case. Transportation Res. (1989) 23B:331–336Crossref, Google Scholar
- Practical Methods of Optimization. Vol. 1. Unconstrained Optimization; Vol. 2 Constrained Optimization (1980) (John Wiley and Sons, New York) Google Scholar
- A coordinate descent method for the bi-level O-D matrix adjustment problem. Internat. Trans. Oper. Res. (1995) 2:165–179Crossref, Google Scholar
- A successive quadratic programming algorithm with global and superlinear convergence properties. Math. Programming (1986) 35:253–264Crossref, Google Scholar
- Practical Optimization (1981) (Academic Press, London, U.K.) Google Scholar
- Estimation of an origin-destination trip table based on observed link volumes and turning movements—volume 1. (1980) . technical report, FHWA/RD-8-034. FHWAGoogle Scholar
- A comparative performance evaluation of 27 nonlinear programming codes. Comput. (1983) 30:335–340Crossref, Google Scholar
- Selection of a trip table which reproduces observed link flows. Transportation Res. (1982) 16B:83–88Crossref, Google Scholar
- Estimation of a trip table and the θ parameter in a stochastic network. Transportation Res. (1996) 30A:287–305Google Scholar
- Inference on trip matrices from observations on link volumes: A Bayesian statistical approach. Transportation Res. (1983) 17B:435–447Crossref, Google Scholar
- A regression formulation of the matrix estimation problem. Transportation Sci. (1985) 19:278–292Link, Google Scholar
- Estimating an OD matrix from network data: A network equilibrium approach. (1977) (Publication 87, CRT, University of Montreal, Montreal, Canada) Google Scholar
- , Florian M. Estimating origin-destination matrices from observed flows. Transportation Planning Models (1984) (Elsevier Science Publishers, Amsterdam, The Netherlands) 363–380Google Scholar
- Algorithms for nonlinear constraints that use Lagrangian functions. Math. Programming (1978) 12:241–254Crossref, Google Scholar
- , Bachem A., Grotschel M., Korte B. Variable metric methods for constrained optimization. Mathematical Programming: The State of the Art (1983) (Springer-Verlag)288–311Crossref, Google Scholar
- A recursive quadratic programming algorithm that uses differentiable penalty functions. Math. Programming (1986) 35:265–278Crossref, Google Scholar
- Calibration of Dial's assignment method. Transportation Sci. (1974) 8:117–125Link, Google Scholar
- Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods (1985) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
- The convergence of equilibrium algorithms with predetermined step size. Transportation Sci. (1982) 16:45–55Link, Google Scholar
- A linear programming approach for synthesizing origin-destination trip tables from link traffic volumes. Transportation Res. (1994) 28B:213–233Crossref, Google Scholar
- A maximum likelihood model for estimating origin-destination matrices. Transportation Res. (1987) 21B:395–412Crossref, Google Scholar
- Estimation of trip tables from observed link volumes. Transportation Res. Record (1979) 730:1–6Google Scholar
- Selected node-pair analysis in Dial's assignment algorithm. Transportation Res. (1981) 15B:65–68Crossref, Google Scholar
- The most likely trip matrix estimated from traffic counts. Transportation Res. (1980) 14B:281–293Crossref, Google Scholar
- Estimating time-dependent trip matrices from traffic counts. Proc. 9th International Symposium on Transportation and Traffic Theory (1984) (Delft University, The Netherlands) 397–411Google Scholar
- Heuristic algorithms for the bilevel origin-destination matrix estimation problem. Transportation Res. (1995) 29B:231–242Crossref, Google Scholar
- , Hensher D., King J., Oum T. A sensitivity analysis based algorithm for the congested origin-destination matrix estimation problem. Proc. 7th World Conference on Transport Research, Vol. 2 (1996) (Sydney, Australia)99–106Modeling Transport SystemsGoogle Scholar
- The equilibrium-based origin-destination matrix estimation problem. Transportation Res. (1994) 28B:23–33Crossref, Google Scholar
- Estimation of origin-destination matrices from link traffic counts in congested networks. Transportation Res. (1992) 26B:417–434Crossref, Google Scholar

