Abstract
The multiple weapons to multiple targets assignment problem can be seen as a multiple traveling salesmen problem with moving targets (MTSPMT), where the weapons play the role of the salesmen, and the cities to be visited are the targets. Approaches in the literature for the MTSPMT include complexity results and approximation algorithms, where additional restrictions on the targets’ trajectories and velocities are imposed. Our approach is based on a discretization of time, which leads to large-scale integer linear programming problems, that need to be solved in very short time. Our computational studies on a set of test problems demonstrate, that exact algorithms are able to solve instances of moderate size and that they improve solutions from a fast and simple first come, first served heuristic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fügenschuh, A.: Parametrized greedy heuristics in theory and practice. In: Aguilera, M., Blum, C., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Second International Workshop, HM 2005, Barcelona, pp. 21–31 (2005)
Fügenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, R.W.K., Nemhauser, G. (eds.) Handbook on Discrete Optimization. Series Handbooks in Operations Research and Management Science, vol. 12, pp. 69–122. Elsevier, Amsterdam (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman and Company, New York (1979)
Gavish, B., Graves, S.: The traveling salesman problem and related problems. In: Technical Report, OR 078–78, Operations Research Center, Massachusetts Institute of Technology, Cambridge (1978)
Helvig, C., Robins, G., Zelikovsky, A.: Moving-target TSP and related problems. In: Bilardi, A.P.G., Italiano, G.F., Pucci, G. (eds.) Proceedings of the European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1461, pp. 453–464. Springer Verlag, Berlin (1998)
Helvig, C., Robins, G., Zelikovsky, A.: The moving-target traveling salesman problem. J. Algorithms 49(1), 153–174 (2003)
IBM ILOG CPLEX: http://www.ibm.com/software/integration/optimization/cplex/ (2013). Accessed 21 Feb 2014
Jiang, Q., Sarker, R., Abbass, H.: Tracking moving targets and the non-stationary traveling salesman problem. Complex. Int. 11, 171–179 (2005)
Jindal, P., Kumar, A., Kumar, S.: Multiple target intercepting traveling salesman problem. Int. J. Comput. Sci. Technol. 2(2), 327–331 (2011)
Knapp, M., Rothe, H.: Concept for simulating engagement strategies for C-RAM systems using laser weapons. In: Proceedings of the DMMS (2012)
Lawler, E., Lenstra, J., Rinnooy, A., Shmoys, D.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)
Liu, C.H.: The moving-target traveling salesman problem with resupply. In: Technical report, The National Chung Cheng University Library. http://ccur.lib.ccu.edu.tw/handle/987654321/7877 (2013)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer Verlag, Berlin (1994)
Zabinsky, Z.B., Smith, R.L., Mcdonald, J.F., Edwin, H., Kaufman, D.E.: Improving hit-and-run for global optimization. J. Glob. Optim. 3, 171–192 (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Stieber, A., Fügenschuh, A., Epp, M. et al. The multiple traveling salesmen problem with moving targets. Optim Lett 9, 1569–1583 (2015). https://doi.org/10.1007/s11590-014-0835-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0835-6