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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Applegate, D., Bixby, M., Chvatal, V., Cook, W.: The traveling salesman problem, Edinburgh (2006). ISBN 0-691-12993-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)
Dantzig, G., Ramser, J.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)
Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press, Cambridge (1995)
Flood, M.M.: The travelling-salesman’s problem. Oper. Res. 5, 61–75 (1957)
Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. J. ACM 38, 935–962 (1991)
Heller, I.: The travelling salesman’s problem. In: Proceedings of the Second Symposium in Linear Programming, vol. 1, pp. 27–29 (1955)
Jobczyk, K., Ligeza, A.: Fuzzy-temporal approach to the handling of temporal interval relations and preferences. In: Proceeding of INISTA, pp. 1–8 (2015)
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)
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)
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
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)
Lomuscio, A., Michaliszyn, J.: An epistemic halpern-shoham logic. In: Proceedings of IJCAI-2013, pp. 1010–1016 (2013)
Menger, K.: Das botenproblem. Ergebnisse eines Mathematisches Kolloquiums 2, 11–12 (1932)
Papadimitriou, C.: The euclidean traveling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)
Rubinstein, S., Hassin, R.: Better approximations for max TSP. Inf. Process. Lett. 75(4), 181–186 (2000)
Steinerberger, S.: New new bounds for the traveling salesman constant. Adv. Appl. Probab. 47, 27–36 (2015)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
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)