.png){kind=icon}
.png){kind=icon}
Return
An efficient method to compute traffic assignment problems with elastic demands
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.1070.0208.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose to use a variant of the analytic center cutting plane method to solve this problem. We test the method on TAP instances with the Bureau of Public Roads congestion function and different demand functions (constant elasticity and linear). The results of the numerical experiments show that it is possible to solve large instances with high accuracy.
Keywords:
traffic assignment
elastic demand
analytic center cutting plane method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K