Fined methods used in dynamic traffic assignment with capacity constraints nodes

Traffic allocation issue, the issue of possible arcs in a stream distribution network Transport. To solve this problem, and the nodes in parentheses Haltykh Network has infinite capacity) for flow (be repetitive procedures Performance such as Frank Wolf exist. In these methods Khtyshdh Zyrmsylhy In each iteration, equivalent to the shortest path between pairs of origin issue Destination. But Haltkly, Kaman and capacity limited network nodes And considering explicitly these constraints causes the Zyrmsylhy Khtyshdh multi commodity flow problem with minimum cost and in turn The resulting solution is very difficult. One way to solve this problem considering Implied capacity constraints using a penalty function sensitive to capacity Is that adding this function Bhnhvy fine time to visit parentheses Compliance due to capacity constraints. Traffic assignment literature, application of results Fined functions for considering capacity constraints arc in real networks There is clear and well their performance, while such results for Considering the node capacity constraints have been reported. In this paper methods Penalty function in solving dynamic traffic assignment with capacity constraints The node capacity constraints arc of Bhmratb harder is is used for And network performance test for several different dimensions and a network Real dot.