Increased Efficiency of Neighborhood Storage

Abstract

A technique called neighborhood storage has been developed previously to store and regenerate extensive lists of sequential steps of a decision process such as all the shortest routes in a transportation system. The original formulation can reduce the required storage by more than an order of magnitude over classical techniques. The purpose of this correspondence is to provide a more efficient technique through a modification of the means of selecting feasible intermediate vertices. The revisions for the more efficient storage technique are presented along with comparisons in terms of the original formulation as well as a classical technique.