Solving traffic assignment with capacity constraints arc using a fine function

Traffic assignment literature, assuming Namhdvdbvdn possible arcs network capacity, in ways such as how Frank - Wolfe capabilities have solved this problem efficient. Because these methods Khtyshdh Zyrmsylhy equivalent shortest path between origin by destination. But in fact possible arcs network capacity is limited and to achieve realistic results from the volume of traffic flow arc, considering the limited capacity of parentheses is required. Explicitly consider the issue of allocation of these restrictions caused traffic into Zyrmsylhy Khtyshdh Chndkalayy current issue is the minimum cost solution makes it difficult. Alternatively considering capacity constraints implied parentheses form, function and use of fines is sensitive to network capacity Bhnhvy possible arcs that adding thisfunction to observe the functions of travel time due parentheses parentheses capacity is limited. In this article the appropriate penalty function for this purpose proposed, and its efficiency in solving traffic assignment with capacity constraints by solving some examples are studied. The results of this method with other methods considering capacity constraints, such as using the internal penalty function method) IPF (Lagrange coefficients and incremental) ALM (, Word has been compared. The result also use this method to a real network of Mashhad, as a real example, where the lights tips leading to the possible arcs with capacity constraints are considered, is presented.