Abstract
In this paper are described and tested three heuristic algorithms for finding the solution to highly complex land-use models that incorporate the effects of traffic congestion. Two of the algorithms are modifications of Evans's algorithm for elastic-demand traffic assignment. The third algorithm is a variation of incremental assignment that is closely related to Frank—Wolfe decomposition. These algorithms are applied to an elaborate implementation of the Lowry—Garin model of land use. Tests of these algorithms show that they all converge toward a predetermined, precise solution, and they do so at a rate that is similar to Frank-Wolfe decomposition.
Sign-in/Register to access full text options 
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
