Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
