Traveling Salesman Problem with Path Dependent Costs —Generalization of One-Dimensional Search with Traveling Costs
Buyang Cao, Klaus Rinderle · 1993
In this paper we propose a generalized model of one-dimensional search problems dicussed in [6,8]. The one-dimensional search problem can be discribed as: given N neighboring cells in a straight line in one of them there is a hidden object to be found. The priori probabilities p i of the object being in the cells 1,..., N are given. At the beginning of the search the searcher stays at the base, called cell 0. Due to the geographical relationships between the different cells the costs (examination and. traveling costs) vary through the search.