An efficient method to compute traffic assignment problems with elastic demands

Transportation Science

Volumn 42, Issue 2, 2008, Pages 249-260

  Babonneau, Frédéric ^a   Vial, Jean Philippe ^b,c  

^a UNIVERSITY OF CHILE   (Chile)

^b ORDECSYS   (Switzerland)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

Analytic center cutting plane method; Elastic demand; Traffic assignment

Indexed keywords

COMBINATORIAL OPTIMIZATION; FUNCTIONS; OPTIMIZATION; TRAFFIC CONGESTION; TRAFFIC CONTROL;

ANALYTIC CENTER CUTTING PLANE METHOD; CONGESTION FUNCTIONS; DEMAND FUNCTION; ELASTIC DEMAND; NUMERICAL EXPERIMENTS; OPTIMIZATION PROBLEMS; TRAFFIC ASSIGNMENT; TRAFFIC ASSIGNMENT PROBLEM;

PROBLEM SOLVING;

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

References (31)

1. Babonneau, F., J.-P. Vial. 2005. ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Technical report, HEC/Logilab, University of Geneva, Geneva, Math. Programming. Forthcoming.
2. Babonneau, F., O. du Merle, J.-P. Vial. 2006. Solving large scale linear multicommodity flow problems with an active set strategy and proximal-ACCPM. Oper. Res. 54 (1) 184-197.
3. Bar-Gera, H. 2002. Origin-based algorithm for traffic assignment problem. Transportation Sci. 36 (4) 398-417.
4. Bertsekas, D. P., R. G. Gallager. 1987. Data Networks. Prentice-Hall, Englewood Cliffs, NJ.
5. Brandon, J., A. Rabinowicz, H. Slavin. 2005. Experiments with alternative traffic assignment methods. Presentation, Transportation Research Board's Conference for Planning Applications, April 25-28, Portland, OR, Transportation Research Board, National Academy of Sciences, Washington, D. C.
6. Castro, J., L. Montero, D. Rosas. 2002. Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem. Technical report, Statistics and Operations Research Department, Universitat Politecnica de Catalunya, Barcelona, Spain.
7. Chardaire, P., A. Lisser. 2002. Simplex and interior point specialized algorithms for solving non-oriented multicommodity flow problems. Oper. Res. 50 (2) 260-276.
8. Dafermos, S. C., F. T. Sparrow. 1969. The traffic assignment problem for a general network. J. Res. National Bureau Standards 73B 91-118.
9. Daneva, M., P. O. Lindberg. 2004. The stiff is moving-Conjugate direction Frank-Wolfe methods with applications to traffic assignment. Technical report, Department of Mathematics, Linköping University, Linköping, Sweden.
10. Dial, R. B. 2006. A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumeration. Transportation Res. Part B 40 917-936.
11. Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numer. Math. 1 269-271.
12. du Merle, O., J.-L. Goffin, J.-Ph. Vial. 1998. On improvements to the analytic center cutting plane method. Computational optimization and applications. Comput. Optim. Appl. 11 37-52.
13. Florian, M., S. Nguyen. 1974. A method for computing network equilibrium with elastic demands. Transportation Sci. 8 321-332.
14. Frangioni, A., G. Gallo. 1999. A bundle type dual-ascent approach to linear multicommodity min-cost flow problems. Informs J. Comput. 11 (4) 370-393.
15. Fukushima, M. 1984. On the dual approach to the traffic assignment problem. Transportation Res. 18B 235-245.
16. Gartner, N. H. 1980a. Optimal traffic assignment with elastic demands: A review. Part I. Analysis framework. Transportation Sci. 14 (2) 174-191.
17. Gartner, N. H. 1980b. Optimal traffic assignment with elastic demands: A review. Part II. Algorithmic approaches. Transportation Sci. 14 (2) 192-208.
18. Goffin, J.-L., A. Haurie, J.-P. Vial. 1992. Decomposition and nondifferentiable optimization with the projective algorithm. Management Sci. 38 284-302.
19. Goffin, J. L., J. Gondzio, R. Sarkissian, J. P. Vial. 1996. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Programming 76 131-154.
20. Hearn, D. W., M. B. Yildirim. 2002. A toll pricing framework for traffic assignment problems with elastic demand. Appl Optim. 63 135-143.
21. Josefsson, M., M. Patriksson. 2007. Sensitivity analysis of separable traffic equilibrium equilibria, with application to bilevel optimization in network design. Transportation Res. Part B 41 (1) 4-31.
22. Kelley, J. E. 1960. The cutting plane method for solving convex programs. J. SIAM 8 703-712.
23. Larsson, T., M. Patriksson. 1995. An augmented Lagrangean dual algorithm for link capacity side constrained traffic assignment problems. Transportation Res. 29B 433-455.
24. Larsson, T., D. Yuan. 2004. An augmented Lagrangian algorithm for large scale multicommodity routing. Comput. Optim. Appl. 27 (2) 187-215.
25. Leblanc, L. 1973. Mathematical programming algorithms for large scale network equilibrium and network design problems. Unpublished doctoral dissertation, IE/MD Department, Northwestern University, Evanston, IL.
26. Leblanc, L. J., K. Farhangian. 1982. Efficient algorithms for solving elastic demand traffic assignment problems and mode splitassignment problems. Transportation Sci. 15 (4) 306-317.
27. Lemaréchal, C. 1977. Bundle methods in nonsmooth optimization. C. Lemaréchal, R. Mifflin, eds. Nonsmooth Optimization (IIASA Proc. Ser., Vol. 3.), Laxenburg, Austria, Pergamon Press, Oxford, UK, 79-102.
28. Mahey, P., A. Ouorou, L. Leblanc, J. Chifflet. 1998. A new proximal decomposition algorithm for routing in telecommunication networks. Networks 31 (4) 227-238.
29. Ouorou, A., P. Mahey, J.-P. Vial. 2000. A survey of algorithms for convex multicommodity flow problems. Management Sci. 46 126-147.
30. Patriksson, M. 1994. The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, The Netherlands.
31. Wardrop, J. G. 1952. Some theorical aspects of road traffic research. Proc. Inst. Civil Engineers, Part 2. Springer-Verlag, Berlin, 325-378.