New algorithmic alternatives for the O-D matrix adjustment problem on traffic networks

European Journal of Operational Research

Volumn 175, Issue 3, 2006, Pages 1484-1500

  Codina, Esteve ^a   García, Ricardo ^b   Marín, Angel ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

^c UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Bilevel programming; Non differentiable programming; O D matrix adjustment; Traffic Networks; Transportation

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; HEURISTIC METHODS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

BILEVEL PROGRAMMING; NON-DIFFERENTIABLE PROGRAMMING; O-D MATRIX ADJUSTMENT; TRAFFIC NETWORKS;

NETWORK PROTOCOLS;

EID: 33749014928     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.058     Document Type: Article

References (32)

1. Ashok K., and Ben-Akiva M. Alternate approaches for real-time estimation and prediction of time-dependent origin-destination flows. Transportation Science 34 (2000)
2. Barceló J. A survey of some mathematical programming models in transportation. Top 5 1 (1997) 1-40
3. Cascetta E., Inaudi D., and Marquis G. Dynamic estimators of origin-destination matrices using traffic counts. Transportation Science 27 (1993) 363-373
4. Castillo E., Conejo A., Pedregal P., García R., and Alguacil N. Building and solving mathematical programming models in engineering and science, Pure and Applied Series (PAMS) (2002), John Wiley & Sons, NY, USA
5. Y. Chen, Bilevel programming problems: Analysis, algorithms and applications, Ph. D. dissertation, Départament d'lnformatique et de Recherche Opérationelle, Université de Montréal, 1994.
6. E. Codina, J. Barceló, Adjustment of O-D trip matrices from traffic counts: An algorithmic approach based on conjugate directions, in: Proceedings of the 8th Euro Working Group on Transportation, Rome, 2000, pp. 427-432.
7. Codina E., and Montero L. A method to approximate the steepest descent direction of the O-D matrix adjustment problem. Proceedings of the 4th Triennial Symposium on Transportation Analysis Conference, Açores, Portugal (2001) 537-542
8. E. Codina, Consistency of an approximation to the upper level objective function gradients in the O-D demand adjustment problem, Research Report DR/2002-01, Departament d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya, Spain, 2002.
9. Florian M., and Chen Y. A coordinate descent method for the bi-level O/D matrix adjustment problem. International Transactions on Operations Research 2 2 (1995)
10. Fourer R., Gay D.M., and Kernighan B.W. AMPL: A modelling language for mathematical programming (1993), Scientific Press
11. Friesz R.L., Chao H.J., Mehta N.J., and Tobin R.L. Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints. Mathematical Programming 48 (1990) 265-284
12. R. García, A. Marín, A bilevel programming approach for estimation of origin-destination matrix and calibration of parameters of a network equilibrium model with combined modes, Proceedings of the 6th Euro Working Group on Transportation, Gothenburg, 1998.
13. R. García, Metodología para el diseño de redes de transports y para la elaboración de algoritmos en programaciń convexa diferenciable, Ph.D. dissertation, Departamento de Matemática Aplicada y Estadística, Universidad Politécnica de Madrid, Spain, 2001.
14. Gartner N.H. Optimal traffic assignments with elastic demands: A review. Part II: Algorithmic approaches. Transportation Science 14 (1980) 192-208
15. Hearn D.W., Lawphongpanich S., and Ventura J.A. Restricted simplicial decomposition: Computation and extensions. Mathematical Programming Study 31 (1987) 99-118
16. K. Jörnsten, S. Nguyen, On the estimation of a trip matrix from network data, Centre de Recherche sur les Transports de Montréal. Publication #153 (1979).
17. Kort B.W., and Bertsekas D.P. Combined primal-dual and penalty methods for convex programming. SIAM Journal on Control and Optimization 14 (1976) 268-294
18. Lemaire B. The proximal point algorithm. In: Penot J.P. (Ed). International Series of Numerical Mathematics 87 (1989), Birkhäuser-Verlag, Basel, Switzerland 73-87
19. Larsson T., and Patriksson M. Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transportation Science 26 (1992) 4-17
20. Martinet B. Regularisation d'inequations variationelles par approximations successives. Revue Française d'lnformatique et de Recherche Operationelle 4 R-3 (1970) 154-158
21. Martinet B. Determination approchee d'un point fixe d'une application pseudo-contractante. Comptes Rendues. Academic des Sciences, Paris 274 A (1972) 163-165
22. Nguyen S., and Dupis C. An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transportation Science 18 (1984) 185-202
23. Patriksson M. Partial linearization methods in nonlinear programming. Journal of Optimization Theory and Applications 78 (1993) 227-246
24. Patriksson M. A unified description of iterative algorithms for traffic equilibria. European Journal of Operational Research 71 (1993) 154-176
25. Rockafellar R.T. Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 14 (1976) 877-898
26. Spiess H. A maximum likelihood model for estimation of origin-destination matrices. Transportation Research B 21 (1987) 395-412
27. H. Spiess, A gradient approach for the O-D matrix adjustment problem, Centre de Recherche sur les Transports de Montréal, Publication 693, 1990.
28. Tobin R.L., and Friesz R.L. Sensitivity analysis for network equilibrium flows. Transportation Science 22 (1988) 242-250
29. Wolfe P. A method of conjugate subgradients for minimizing nondifferentiable optimization. Mathematical Programming Study 3 (1975) 145-173
30. Yang H., Iida Y., and Sasaki T. Estimation of origin-destination matrices from traffic counts on congested networks. Transportation Research B 26 6 (1992) 417-434
31. Yang H. Heuristic algorithms for the bilevel origin-destination matrix estimation problem. Transportation Research B 29 4 (1995) 231-242
32. N. van der Zijpp, Dynamic origin-destination matrix estimation on motorways networks, Ph.D. Thesis, Department of Civil Ingeneering, Delft University of Technology, 1996.