كاربرد روش جريمه پويا در تخصيص ترافيك با محدوديت ظرفيت گره

DYNAMIC PENALTY FUNCTION METHOD FOR SOLVING TRAFFIC ASSIGNMENT PROBLEMS WITH NODE CAPACITY CONSTRAINTS

Although there are some efficient methods for solving traffic assignment problems (TAP), these methods do not consider link and node capacity constraints. Ex¬plicit consideration of these constraints in TAP causes each linearized sub-problem to be converted to a mini¬mal cost, multi-commodity flow problem that is too dif¬ficult to solve. In this paper, a new iterative algorithm is introduced to solve the TAP with node capacity con¬straints. The algorithm is based on implicitly consider¬ing 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 car¬ried 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 pre¬sented.