A METHOD OF OPTIMUM ROUTE REGENERATION

Abstract

A method for facilitating the rapid regeneration of optimum routes has been presented. This method will generally result in minimum storage and minimum regeneration time while initially presenting a rather large computational problem. One alternative and complementary methodology previously developed involves a covering technique both for the identification of connectivity information, considered by Hoelzeman and Mickle, and error detection and correction, considered by Wang, Mickle and Hoelzeman. By way of contrast, this alternative requires less initial computation while in general requiring more computer storage and longer regeneration times than the method presented in this paper. The method formulated herein represents a significant advance in the state‐of‐the‐art of applied routing problems.

Citation

MICKLE, M.H. (1975), "A METHOD OF OPTIMUM ROUTE REGENERATION", Kybernetes, Vol. 4 No. 4, pp. 197-203. https://doi.org/10.1108/eb005394