A computationally efficient iterative solution of the multidestination optimal dynamic routing problem

The dynamic routing problem for multiple destination networks is considered. The minimum time rather than total delay cost functional is employed. The problem is solved through an iterative link-by-link optimization. Each link capacity is optimally partitioned by examining the upper bounds for the evacuation time imposed through different capacity allocations for each origin/destination pair traffic. The computational complexity per iteration is polynomial in the number of network nodes. This is due to the examination of origin/destination pairs rather then destinations alone as in previous work where a similar approach led to exponential complexity. Sufficient conditions for the convergence of the iterative algorithm to the optimum are given. If these are not satisfied supplementary steps are described which conduct the algorithm to the desired solution. These involve exponential computational complexity.<
>