نوع مقاله : یادداشت فنی
نویسندگان
1 دانشکده مهندسی عمران - دانشگاه صنعتی شریف
2 دانشکده مهندسی عمران - دانشگاه تهران
چکیده
کلیدواژهها
عنوان مقاله [English]
نویسندگان [English]
Although there are some efficient methods for solving traffic assignment problems (TAP), these methods do not consider link and node capacity constraints. Explicit consideration of these constraints in TAP causes each linearized sub-problem to be converted to a minimal cost, multi-commodity flow problem that is too difficult to solve. In this paper, a new iterative algorithm is introduced to solve the TAP with node capacity constraints. The algorithm is based on implicitly considering the node capacity constraints by means of adding a dynamic penalty function (DPF) to the link travel times. Each iteration of the algorithm is reduced to an unconstrained assignment, followed by updating the penalty functions. The unconstraint assignment is carried out using the linearization method that has been derived from the complementary formulation of TAP. The computational results of the algorithm on some well known networks and a real network, are also presented.
کلیدواژهها [English]
)