Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial Intelligence and Soft Computing

ICAISC 2018: Artificial Intelligence and Soft Computing pp 544–556Cite as

Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10842))

Abstract

In this paper, a new temporal extension of Traveling Salesman Problem (TSP) – as an old optimization problem – is proposed. This proposal stems from a need to elucidate TSP not only as an optimization problem, but also as a potentially paradigmatic problem for the subject specification of temporal planning. This new Temporal Traveling Salesman Problem is described in two ways – in the graph-based depiction and in terms of logic to be interpreted later by the so-called fibred semantics.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Applegate, D., Bixby, M., Chvatal, V., Cook, W.: The traveling salesman problem, Edinburgh (2006). ISBN 0-691-12993-2

    Google Scholar 

  2. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)

    MATH  Google Scholar 

  3. Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  4. Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  5. Flood, M.M.: The travelling-salesman’s problem. Oper. Res. 5, 61–75 (1957)

    Google Scholar 

  6. Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. J. ACM 38, 935–962 (1991)

    Article  MathSciNet  Google Scholar 

  7. Heller, I.: The travelling salesman’s problem. In: Proceedings of the Second Symposium in Linear Programming, vol. 1, pp. 27–29 (1955)

    Google Scholar 

  8. Jobczyk, K., Ligeza, A.: Fuzzy-temporal approach to the handling of temporal interval relations and preferences. In: Proceeding of INISTA, pp. 1–8 (2015)

    Google Scholar 

  9. Jobczyk, K., Ligeza, A.: A general method of the hybrid controller construction for temporal planing with preferences. In: Proceeding of FedCSIS, pp. 61–70 (2016)

    Google Scholar 

  10. Jobczyk, K., Ligeza, A.: Multi-valued halpern-shoham logic for temporal allen’s relations and preferences. In: Proceedings of the Annual International Conference of Fuzzy Systems (FuzzIEEE) (2016, page to appear)

    Google Scholar 

  11. Jobczyk, K., Ligeza, A.: Dynamic epistemic preferential logic of action. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2017. LNCS (LNAI), vol. 10246, pp. 243–254. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59060-8_23

    Chapter  Google Scholar 

  12. Kaplan, H., Lewenstein, L., Shafrir, N., Sviridenko, M.: Approximation algorithms for assymetric TSP by decomposing directed regular multigraphs. In: Proceedings of 44th IEEE Symposium on Foundation of Computer Science, pp. 56–65 (2004)

    Google Scholar 

  13. Lomuscio, A., Michaliszyn, J.: An epistemic halpern-shoham logic. In: Proceedings of IJCAI-2013, pp. 1010–1016 (2013)

    Google Scholar 

  14. Menger, K.: Das botenproblem. Ergebnisse eines Mathematisches Kolloquiums 2, 11–12 (1932)

    Google Scholar 

  15. Papadimitriou, C.: The euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)

    Article  MathSciNet  Google Scholar 

  16. Rubinstein, S., Hassin, R.: Better approximations for max TSP. Inf. Process. Lett. 75(4), 181–186 (2000)

    Article  MathSciNet  Google Scholar 

  17. Steinerberger, S.: New new bounds for the traveling salesman constant. Adv. Appl. Probab. 47, 27–36 (2015)

    Article  MathSciNet  Google Scholar 

  18. Vidal, T., Craining, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attrobute vehicle routing problem. Eur. J. Oper. Res. 234, 658–673 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Caen Normandy, Caen, France

    Krystian Jobczyk

  2. AGH University of Science and Technology, Kraków, Poland

    Krystian Jobczyk, Piotr Wiśniewski & Antoni Ligȩza

Authors
  1. Krystian Jobczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Wiśniewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antoni Ligȩza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Krystian Jobczyk .

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Częstochowa, Poland

    Leszek Rutkowski

  2. Częstochowa University of Technology, Częstochowa, Poland

    Rafał Scherer

  3. Częstochowa University of Technology, Częstochowa, Poland

    Marcin Korytkowski

  4. University of Alberta, Edmonton, AB, Canada

    Witold Pedrycz

  5. AGH University of Science and Technology, Kraków, Poland

    Ryszard Tadeusiewicz

  6. University of Louisville, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jobczyk, K., Wiśniewski, P., Ligȩza, A. (2018). Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science(), vol 10842. Springer, Cham. https://doi.org/10.1007/978-3-319-91262-2_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91262-2_48

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91261-5

  • Online ISBN: 978-3-319-91262-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation