Multi-commodity traffic assignment by continuum approximation of network flow with variable demand

Multi-commodity traffic assignment by continuum approximation of network flow with variable demand

0.00 Avg rating0 Votes
Article ID: iaor19993024
Country: United Kingdom
Volume: 32B
Issue: 8
Start Page Number: 567
End Page Number: 581
Publication Date: Nov 1998
Journal: Transportation Research. Part B: Methodological
Authors:
Keywords: programming: network
Abstract:

Consider a city with several highly compact central business districts (CBD), and the commuters' destinations from each of them are dispersed over the whole city. Since at a particular location inside the city the traffic movements from different CBDs share the same space and do not cancel out each other as in conventional fluid flow problems albeit travelling in different directions, the traffic flows from a CBD to the destinations over the city are considered as one commodity. The interaction of the traffic flows among different commodities is governed by a cost–flow relationship. The case of variable demand is considered. The primal formulation of the continuum equilibrium model is given and proved to satisfy the user optimal conditions, and the dual formulation of the problem and its complementary conditions are also discussed. A finite element method is then employed to solve the continuum problem. A numerical example is given to illustrate the effectiveness of the proposed method.

Reviews

Required fields are marked *. Your email address will not be published.