The Storage Cost of Indicating a Path
Hidehiko Yomono · Journal of the City Planning Institute of Japan · 1989
This paper proposes a method to evaluate the complexity of a path on a road network. First, an experimental model is proposed, which represents a hypo-thetical ability to trace and memorize*a path instead of a real person. Then paths on an actual road network are evaluated in according to the model. The path loaded with the minimal storage cost and a quasi, minimal, storage, tree are defined. Then the distances and the storage costs on this tree and on the short-est-distance-tree are computed. Finally, the expectation of the storage cost is examined on some random network models.