A Method for Computing Network Equilibrium with Elastic Demands
Explore this paper's citation graph
Summary
A new method for computing the equilibrium flows in a transportation network with elastic demands and congestion effects for a single class of users from the combination of a fixed demand assignment method and an application of Generalized Benders Decomposition is presented.
- Type
- article
- Published
- 1974-11-01
- Cited by
- 82
- References
- 14
- OpenAlex
- https://openalex.org/W1968206787
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:60627673
Keywords
Flow network, Mathematical optimization, Benders' decomposition, Computer science, Decomposition
References
- A RESEARCH PROGRAM FOR COMPARISON OF TRAFFIC ASSIGNMENT TECHNIQUES
- A transportation equilibrium model
- PRECISE DETERMINATION OF EQUILIBRIUM IN TRAVEL FORECASTING PROBLEMS USING NUMERICAL OPTIMIZATION TECHNIQUES
- BENEFIT ASSESSMENT FOR NETWORK TRAFFIC MODELS AND APPLICATION TO ROAD PRICING
- Traffic assignment problem for a general network
- Nonlinear programming : a unified approach
- Generalized Benders decomposition
- A Column Generation Algorithm for Optimal Traffic Assignment
- Nonlinear Programming
- The Traffic Assignment Problem for Multiclass-User Transportation Networks
- An Extended Traffic Assignment Model with Applications to Two-Way Traffic
- Studies in the Economics of Transportation.
- A note on two problems in connexion with graphs
- Some Theoretical Aspects of Road Traffic Research
Cited by
- MODELING OVERLAPPING AND HETEROGENEOUS PERCEPTION VARIANCE IN STOCHASTIC USER EQUILIBRIUM PROBLEM WITH WEIBIT ROUTE CHOICE MODEL
- A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model
- Evaluation of impacts of telecommuting in traffic assignment
- NETWORK EQUILIBRIUM MODELS OF URBAN LOCATION AND TRAVEL CHOICES: A RETROSPECTIVE SURVEY. IN: THE AUTOMOBILE
- A new look at static spatial price equilibrium models
- Accelerating Benders decomposition for network design
- A linearization and decomposition algorithm for computing urban traffic equilibria
- Network optimization : continuous and discrete models
- A new behavioral principle for urban transportation networks
- A Column Generation-based Algorithm for Multi-Class Dynamic User Equilibrium Problem
- Modeling equilibria in integrated transportation-land use models
- Multi-Criterion Dynamic Traffic Assignment Models and Algorithms for Road Pricing Applications with Heterogeneous Users
- Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP
- An Optimization Approach to Routing Aircraft
- Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem
- A Framework for Constructing Network Equilibrium Models of Urban Location
- An algorithm for the traffic assignment problem
- An optimum link improvement model with a computer algorithm
- Nonlinear programming on generalized networks
- An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
Related papers
- On using approximations of the Benders master problem
- A nested benders decomposition approach for telecommunication network planning
- Optimal solution of cellular manufacturing system design: Benders' decomposition approach
- An integrated model for logistics network design
- Comparing Research on Benders Decomposition and Branch-and-bound in Logistics Network Design
- Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure
- An algorithm for optimizing network flow capacity under economies of scale
- Maximum dynamic network flow interdiction problem: New formulation and solution procedures
- Branch and bound algorithm for transmission system expansion planning using a transportation model
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network