Abstract
This paper describes recently developed nonlinear programming algorithms for certain large-scale congested network models. The techniques include Restricted Simplicial Decomposition (RSD) applied to the single commodity flow problem (RSDNET) and the standard traffic assignment problem (RSDTA), and the basic simplicial strategy applied to the network variational inequality problem (SDVI). Computational results are presented for each method, including tests conducted on large networks from real world models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baiberg I. and Binnenbaum N. (1983) Computer study of the percolation threshold in a two-dimensional anisotropic system of conducting sticks. Physical Review B 28, 3799–38l2.
Bertsekas D. P. (1982) Projected Newton methods for optimization problems with simple constraints. SIAM Journal of Control and Optimization 20, 221–246.
Bertsekas D. P. and Gafni E. M. (1982) Projection methods for variational inequalities with application to the traffic assignment problem. Math. Prog. Study 17, 139–159.
Collins M., Cooper L., Helgason R., Kennington J. and LeBlanc L. (1978) Solving the pipe network analysis problem using optimization techniques. Management Sci. 24, 747–760.
Dafermos S. (1980) Traffic equilibrium and variational inequalities. Transpn Sci. 14, 42–54.
Dembo R. (1983) NLPNET: User’s guide and system documentation. School of Organization and Management, Yale University, New Haven, CT, SOM Working Paper Series B #70.
Dembo R. and Tulowitzki U. (1983) Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms. School of Organization and Management, Yale University, New Haven, CT, SOM Working Paper Series B #65.
Florian M. and Nguyen S. (1976) An application and validation of equilibrium trip assignment methods. Transpn Sci. 10, 374–389.
Frank M. and Wolfe P. (1956) An algorithm for quadratic programming. NRLQ 3, 95–110.
Gill P. E., Murray W., Saunders M. A. and Wright M. H. (1983) User’s guide for SOL/NPSOL: a Fortran package for nonlinear programming. Department of Operations Research, Stanford University, California, Report SOL 83–12.
Guelat J. (1983) Algorithms pour le probleme d’affectation du traffic d’equilibre avec demandes fixes: Comparasons. Center de Recherche sur les Transports, Universite de Montreal, Montreal, Publication 299.
Hearn D. W. (1982) The gap function of a convex program. Opr. Res. Lett. 1, 67–71.
Hearn D. W., Lawphongpanich S. and Nguyen S. (1984) Convex programming formulations of the asymmetric traffic assignment problem. Transpn Res. 18B, 357–365.
Hearn D. W., Lawphongpanich S. and Ventura J. A. (1984) Restricted simplicial decomposition: computation and extensions. Univ. of Florida ISE Department Research Report 84–38. (To appear in Math. Prog. Studies.)
Hearn D. W., Lawphongpanich S. and Ventura J. A. (1985) Finiteness in restricted simplicial decomposition. Opr. Res. Lett. 4, 125–130.
Kennington J. L. and Helgason R. V. (1980) Algorithms for Network Programming. John Wiley & Sons, New York.
Lawphongpanich S. and Hearn D. W. (1984) Simplicial decomposition of the asymmetric traffic assignment problem. Transpn Res. 18B, 123–133.
Lawphongpanich S. and Hearn D. W. (1986) Restricted simplicial decomposition with application to the traffic assignment problem. Ricera Operativa 38, 97–120.
LeBlanc L. J., Morlok E. K. and Pierskalla W. P. (1974) An accurate and efficient approach to equilibrium traffic assignment on congested networks. Transportation Research Record 491, Interactive Graphics and Transportation Systems Planning, 12–33.
Marcotte, P. (1985) A new algorithm for solving variational inequalities with application to the traffic assignment problem. Math. Prog. 33, 339–351.
Mulvey J. M., Zenios S.A. and Ahlfeld D. P. (1985) Simplicial decomposition for convex generalized networks. Engineering Management Systems Program, Princeton University, Princeton, NJ, Report EES-85–8.
Nguyen S. and Dupuis C. (1984) An efficient method for computing traffic equilibria in a network with asymmetric transportation costs. Transpn Sci. 18, 185–202.
Pang J. S. and Yu C. S. (1984) Linearized simplicial decomposition for computing traffic equilibrium on networks. Networks 14, 427–428.
Schittkowski K. (1984) NLPQL: A Fortran subroutine for solving constrained nonlinear programming problems. Institut für Informatik, Universität Stuttgart, Germany, Report.
Smith M. (1979) Existence, uniqueness and stability of traffic equilibria. Transpn. Res. 13B, 295–304.
Steenbrink P. (1974) Optimization of Transport Networks. John Wiley & Sons, New York.
Ventura J. A. and Hearn D. W. (1984) Computing the effective resistance in a system of conducting sticks. Univ. of Florida ISE Department Research Report 84–43.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hearn, D.W., Lawphongpanich, S., Ventura, J.A. (1987). Optimization Algorithms for Congested Network Models. In: Odoni, A.R., Bianco, L., Szegö, G. (eds) Flow Control of Congested Networks. NATO ASI Series, vol 38. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-86726-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-86726-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-86728-6
Online ISBN: 978-3-642-86726-2
eBook Packages: Springer Book Archive