Abstarct The traditional urban traortation analysis has four steps containing 1-trip generation 2-trip distribution 3-mode choice 4-traffic assignment. The fourth step gives the flow on each link. The traffic assignment approach can be kashida; TEXT-ALIGN: justify; LINE-HEIGHT: normal; TEXT-KASHIDA: 0%; TEXT-INDENT: 0in; MARGIN: 0in 0in 0pt; unicode-bidi: embed; DIRECTION: ltr" The most well-known Link-based algorithm is Frank-Wolfe algorithm, whereas Newton algorithm serves as the most popular Path-base algorithm. The most well-known Link-based algorithm is Frank-Wolfe algorithm, whereas Newton algorithm serves as the most popular Path-base algorithm. In this paper, we primarily sought to code these two algorithms to form a computerized structure for saving the paths within the Newton algorithm. We subsequently compared the two algorithms in terms of speed and accuracy. The theory of using algorithm’s optimal solutions for the base network as initial answers of allocation algorithms are proposed for neighbour networks to reduce the number of iterations of Frank-Wolf algorithm and Newton algorithm.(Neighbour networks are new networks that have been created of widening or constructing new streets and roads.) Due to the simplicity of the calculating in the Frank-Wolfe algorithm, it was shown well suits the assignment problems with low accuracy. Nevertheless, given the low speed of this algorithm near the optimized solution, Newton algorithm could serve best particularly when assignment with high accuracy was required. Given the low speed of the Frank-Wolfe algorithm and the high complexity of the Newton algorithm, a combined algorithm is proposed within this paper to enable a more accurate solution of the traffic assignment problem. The proposed algorithm was shown to have a favorable performance on the Sioux Falls network. Using optimal solution of base network for neighbour networks, as an initial answer of mentioned algorithm, decrease the number of iterations and therefore, increase the speed of convergence