×

zbMATH — the first resource for mathematics

A heuristic for the OD matrix adjustment problem in a congested transport network. (English) Zbl 1341.90028
Summary: We study the Demand Adjustment Problem (DAP) associated to the urban traffic planning. The framework for the formulation of the DAP is mathematical programming with equilibrium constraints. In particular, if we consider the optimization problem equivalent to the equilibrium problem, the DAP becomes a bilevel optimization problem. In this work we present a descent scheme based on the approximation of the gradient of the objective function of DAP.

MSC:
90B20 Traffic problems in operations research
90C59 Approximation methods and heuristics in mathematical programming
90B10 Deterministic network models in operations research
90B06 Transportation, logistics and supply chain management
90B80 Discrete location and assignment
Software:
Scilab; CiudadSim
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bazaraa, M.; Sherali, H. D.; Shetty, C., Mathematical programming. Theory and Algorithms, (1993), John Wiley & Sons · Zbl 0774.90075
[2] Bell, M. G.H., The estimation of an origin-destination matrix from traffic counts, Transportation Science, 17, 198-217, (1983)
[3] Bianco, L.; Confessore, G.; Reverberi, P., A network based model for traffic sensor location with implications on o/d matrix estimates, Transportation Science, 35, 1, 49-60, (2001) · Zbl 1069.90503
[4] Bierlaire, M.; Toint, Ph. L., Meuse: an origin-destination matrix estimator that exploits structure, Transportation Research, Part B: Methodological, 29, 47-60, (1995)
[5] Bierlaire, M., The total demand scale: A new measure of quality for static and dynamic origin-destination trip tables, Transportation Research, Part B: Methodological, 36, 837-850, (2002)
[6] Brenninger-Göthe, M.; Jornsten, K. O.; Lundgren, J. T., Estimation of origin/destination matrices from traffic counts using multiobjective programming formulation, Transportation Research, 23B, 257-269, (1989)
[7] Carey, M.; Hendrickson, C.; Krishnaswami, S., A method for direct estimation of origin/destination trip matrices, Transportation Science, 14, 1, 32-49, (1981)
[8] Cascetta, E., Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator, Transportation Research, 18B, 289-299, (1984)
[9] Chen, Y.; Florian, M., OD demand adjustment problem with congestion: part I. model analysis and optimality conditions, Advanced methods in transportation analysis, 1-22, (1996), Springer-Verlag Berlin
[10] Clarke, F. H., Optimization and nonsmooth analysis, (1983), SIAM New York, United States · Zbl 0582.49001
[11] Codina, E.; Barceló, J., Adjustment of O-D trip matrices from traffic counts: an algorithmic approach based on conjugate directions, European of Operational Research, 155, 535-557, (2004) · Zbl 1045.90005
[12] Codina, E.; García, R.; Marín., New algorithmic alternatives for the O-D matrix adjustment problem on traffic networks, European of Operational Research, 175, 1484-1500, (2006) · Zbl 1142.90321
[13] Codina, E.; Montero, L., Approximation of the steepest descent direction for the O-D matrix adjustment problem, Annals Operational Research, 144, 329-362, (2006) · Zbl 1159.90331
[14] Dafermos, S.; Nagurney, A., Sensitivity analysis for the asymmetric network equilibrium problem, Mathematical Programming, 28, 174-184, (1984) · Zbl 0535.90038
[15] García-Ródenas, R.; Verastegui-Rayo, D., A column generation algorithm for the estimation of origin-destination matrices in congested traffic networks, European of Operational Research, 184, 860-878, (2008) · Zbl 1141.90013
[16] Lotito, P., Issues in the implementation of the DSD algorithm for the traffic assignment problem, European Journal of Operational Research, 175, 1577-1587, (2006) · Zbl 1142.90355
[17] Lotito, P.; Mancinelli, E.; Quadrat, J. P.; Wynter, L., The traffic assignment toolboxes of Scilab, (2003), INRIA - Rocquencourt
[18] Lundgren, J. T.; Peterson, A., A heuristic for the bilevel origin-destination matrix estimation problem, Transportation Research Part B: Methodological, 42, 4, 339-354, (2008)
[19] McNeil, S.; Hendrickson, C., A regression formulation of the matrix estimation problem, Transportation Science, 19, 3, 278-292, (1985)
[20] Nguyen, S., Estimating an O-D matrix from network data: A network equilibrium approach, (1977), Centre de recherche sur les transports (CRT), Université de Montréal Montréal, Canada, (Publication 87)
[21] Patriksson, M., Partial linearization methods in nonlinear programming, Journal of Optimization Theory and Applications, 78, 2, 227-246, (1993) · Zbl 0796.90058
[22] Patriksson, M., The traffic assignment problem. Models and methods, (1994), VSP BV Utrecht · Zbl 0828.90127
[23] Peterson, A. (2007). Linkoping studies in science and technology. The origin-destination matrix estimation problem-analysis and computations (Dissertations No. 1102).
[24] Sheffi, Y., Urban transportation networks: Equilibrium analysis with mathematical programming methods, (1985), Prentice Hall
[25] Spiess, H., A maximum-likelihood model for estimating origin-destination matrices, Transportation Research, 21B, 395-412, (1987)
[26] Spiess, H., A descent based approach for the OD matrix adjustment problem, (1990), Centre de recherche sur les transports (CRT), Université de Montréal Montréal, Canada, (Publication 693)
[27] Van Zuylen, H. J., The information minimization method: validity and applicability to transport planning, (Jansen, G. R.H., New developments in modelling travel demand and Urban Systems, (1978), Saxon, Farnborough)
[28] Van Zuylen, H.; Willumsen, L. G., The most likely trip matrix estimated from traffic counts, Transportation Research, 14B, 281-293, (1980)
[29] Willumsen, L. G., Simplified transport models based on traffic counts, Transportation, 10, 257-278, (1981)
[30] Yang, H.; Sasaki, T.; Iida, Y.; Asakura, Y., Estimation of origin-destination matrices from link traffic counts on congested networks, Transportation Research, 26B, 417-434, (1992)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.