Traveling Salesman Problem with Path Dependent Costs —Generalization of One-Dimensional Search with Traveling Costs

  • Buyang Cao
  • Klaus Rinderle
Conference paper


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.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    de Werra, D., and Hertz, A., “Tabu Search Techniques: a Tutorial and an Application to Neural Network,” OR Spektrum 11, 131–141, (1989).CrossRefGoogle Scholar
  3. [3]
    Frieze, A.M., Galbiat G., and Maffioli, F., “On the Worst-Case Performance of Some Algorithm for the Asymmetric Traveling Salesman Problem,” Networks 12, 23–39, (1982).CrossRefGoogle Scholar
  4. [4]
    Glover, F., “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computer and Operations Research 13, No.5, 533–549, (1986).CrossRefGoogle Scholar
  5. [5]
    Glover, F., “Tabu Search — Part I,” ORSA Journal on Computing 1, No.3, 190–206, (1989).CrossRefGoogle Scholar
  6. [6]
    Gluss, B., “Approximately Optimal One-Dimensional Search Policies in Which Search Costs Vary with Through Time,” Naval Research Logistics Quarterly 8, 277–283, (1961).CrossRefGoogle Scholar
  7. [7]
    Kanellakis, P. and Papadimitriou, C.H., “Local Search for the Asymmetric Traveling Salesman Problem,” Operations Research 28, No.5, 1086–1099, (1980).CrossRefGoogle Scholar
  8. [8]
    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
  9. [9]
    Lawler, E.L., Lanstra, J.K., and Rimooy Kan, A.H.G. (eds.), “The Traveling Salesman,” John Wiley & Sons. Ltd, (1985).Google Scholar
  10. [10]
    Malek, M., Guruswamy, M., Pandy M., and Qwens, H., “Serial and Parallel Simulated Annealing and Tabu Search Algorithms for the Traveling Salesman Problem,” Annals of Operations Research 21, 59–84, (1989)CrossRefGoogle Scholar
  11. [11]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Buyang Cao
    • 1
  • Klaus Rinderle
    • 1
  1. 1.Informatik 5University of the Federal Armed Forces MunichNeubibergGermany

Personalised recommendations