Traveling Salesman Problem with Path Dependent Costs —Generalization of One-Dimensional Search with Traveling Costs
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.
Unable to display preview. Download preview PDF.
- Cao, B., and Uebe, G., “Solving Transportation Problem with Nonlinear Side Constraints with Tabu Search,” Dicussion Paper in Statitics and Quantitative Economics, No. 46, Armed Forces University Hamburg, 1991.Google Scholar
- Kikuta, K., “A One-Dimensional Search with Traveling Cost,” Journal of the Operations Research Society of Japan 33, No.3, 262–276, (1990).Google Scholar
- Lawler, E.L., Lanstra, J.K., and Rimooy Kan, A.H.G. (eds.), “The Traveling Salesman,” John Wiley & Sons. Ltd, (1985).Google Scholar
- Widmer, M., “Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach,” Journal of Operational Research Society 42, No.1, 75–82, (1991).Google Scholar