In the process of selecting two independent paths, a volume index is the ratio of capacity over travel time is determined for each path, and the best routeset is that which presents the largest sum of these indices. The reason to choose this index is because comparatively a path is better than other if it has larger capacity or a smaller travel time. Considering the possibility of existing independent n-paths between a pair of source and destination node in a network, the method determines a set of paths with the objective of maximize the summation of the ratio of each route. Besides, routes to different destinations points cannot have intersectionpoints as well, so its use minimizes the problem of accidents and permits a continuous traffic flow. Thus, the model is applied iteratively, allowing the removal of intersection points among the different routes. To solve this problem the model will be developing the following algorithm shown in Fig. 3.