The implementation of many real-time automated routing procedures is dependent on a method of rapidly obtaining optimum routes in a very short amount of time for networks having large numbers of vortices. A method for the rapid regeneration of optimum routes is formulated in this paper. The method initially requires the solution of a sot of simultaneous inequalities. The solution of the resulting simultaneous inequalities provides points in a real space of n dimensions that are used with a metric to facilitate the decision process in obtaining any optimum route.