Fetching the paper…
Reading the bibliography…
This paper introduces a new formulation that finds the optimum for the Moving-Target Traveling Salesman Problem (MT-TSP), which seeks to find a shortest path for an agent, that starts at a depot, visits a set of moving targets exactly once within their assigned time-windows, and returns to the depot.
B. L. Brumitt and A. Stentz, “Dynamic mission planning for multiple mobile robots,” in Proceedings of IEEE International Conference on Robotics and Automation , vol. 3. IEEE, 1996, pp. 2396–2401
1996
Earlier work this paper cites.
J. L. Ryan, T. G. Bailey, J. T. Moore, and W. B. Carlton, “Reactive tabu search in unmanned aerial reconnaissance simulations,” in 1998 Winter Simulation Conference. Proceedings (Cat. No. 98CH36274) , vol. 1. IEEE, 1998, pp. 873–879
1998
Earlier work this paper cites.
P. Chalasani and R. Motwani, “Approximating capacitated routing and delivery problems,” SIAM Journal on Computing , vol. 28, no. 6, pp. 2133–2149, 1999
1999
Earlier work this paper cites.
M. Hammar and B. J. Nilsson, “Approximation results for kinetic variants of tsp,” in Automata, Languages and Programming: 26th International Colloquium, ICALP’99 Prague, Czech Republic, July 11–15, 1999 Proceedings 26 . Springer, 1999, pp. 392–401
1999
Earlier work this paper cites.
Z. Yu, L. Jinhai, G. Guochang, Z. Rubo, and Y. Haiyan, “An implementation of evolutionary computation for path planning of cooperative mobile robots,” in Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No. 02EX527) , vol. 3. IEEE, 2002, pp. 1798–1802
2002
Earlier work this paper cites.
C. S. Helvig, G. Robins, and A. Zelikovsky, “The moving-target traveling salesman problem,” Journal of Algorithms , vol. 49, no. 1, pp. 153–174, 2003
2003
Earlier work this paper cites.
H. A. Saleh and R. Chelouah, “The design of the global navigation satellite system surveying networks using genetic algorithms,” Engineering Applications of Artificial Intelligence , vol. 17, no. 1, pp. 111–122, 2004
2004
Earlier work this paper cites.
Q. Jiang, R. Sarker, and H. Abbass, “Tracking moving targets and the non-stationary traveling salesman problem,” Complexity International , vol. 11, no. 2005, pp. 171–179, 2005
2005
Earlier work this paper cites.
J.-M. Bourjolly, O. Gurtuna, and A. Lyngvi, “On-orbit servicing: a time-dependent, moving-target traveling salesman problem,” International Transactions in Operational Research , vol. 13, no. 5, pp. 461–481, 2006
2006
Earlier work this paper cites.
D. Marlow, P. Kilby, and G. Mercer, “The travelling salesman problem in maritime surveillance–techniques, algorithms and analysis,” in Proceedings of the international congress on modelling and simulation , 2007, pp. 684–690
2007
Earlier work this paper cites.
P. Oberlin, S. Rathinam, and S. Darbha, “Today’s traveling salesman problem,” IEEE robotics & automation magazine , vol. 17, no. 4, pp. 70–77, 2010
2010
Cited alongside, same era.
B. Englot, T. Sahai, and I. Cohen, “Efficient tracking and pursuit of moving targets by heuristic solution of the traveling salesman problem,” in 52nd ieee conference on decision and control . IEEE, 2013, pp. 3433–3438
2013
Cited alongside, same era.
N. S. Choubey, “Moving target travelling salesman problem using genetic algorithm,” International Journal of Computer Applications , vol. 70, no. 2, 2013
2013
Cited alongside, same era.
W. Zhao, Q. Meng, and P. W. Chung, “A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and rescue scenario,” IEEE transactions on cybernetics , vol. 46, no. 4, pp. 902–915, 2015
2015
Cited alongside, same era.
U. Ucar and S. K. Işleyen, “A meta-heuristic solution approach for the destruction of moving targets through air operations.” International Journal of Industrial Engineering , vol. 26, no. 6, 2019
2019
Later among the works it cites.
O. Cheikhrouhou, A. Koubâa, and A. Zarrad, “A cloud based disaster management system,” Journal of Sensor and Actuator Networks , vol. 9, no. 1, p. 6, 2020
2020
Later among the works it cites.
M. Hassoun, S. Shoval, E. Simchon, and L. Yedidsion, “The single line moving target traveling salesman problem with release times,” Annals of Operations Research , vol. 289, pp. 449–458, 2020
2020
Later among the works it cites.
C. D. Smith, “Assessment of genetic algorithm based assignment strategies for unmanned systems using the multiple traveling salesman problem with moving targets,” 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Groba, A. Sartal, and X. H. Vázquez, “Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices,” Computers & Operations Research , vol. 56, pp. 22–32, 2015
2015
Cited alongside, same era.
J. Conesa-Muñoz, G. Pajares, and A. Ribeiro, “Mix-opt: A new route operator for optimal coverage path planning for a fleet in an agricultural environment,” Expert Systems with Applications , vol. 54, pp. 364–378, 2016
2016
Cited alongside, same era.
Y. Liu and R. Bucknall, “Efficient multi-task allocation and path planning for unmanned surface vehicle in support of ocean operations,” Neurocomputing , vol. 275, pp. 1550–1566, 2018
2018
Cited alongside, same era.
A. M. Ham, “Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming,” Transportation Research Part C: Emerging Technologies , vol. 91, pp. 1–14, 2018
2018
Cited alongside, same era.
S. Venkatachalam, K. Sundar, and S. Rathinam, “A two-stage approach for routing multiple unmanned aerial vehicles with stochastic fuel consumption,” Sensors , vol. 18, no. 11, p. 3756, 2018
2018
Cited alongside, same era.
R. S. de Moraes and E. P. de Freitas, “Experimental analysis of heuristic solutions for the moving target traveling salesman problem applied to a moving targets monitoring system,” Expert Systems with Applications , vol. 136, pp. 392–409, 2019
2019
Cited alongside, same era.
A. Stieber and A. Fügenschuh, “Dealing with time in the multiple traveling salespersons problem with moving targets,” Central European Journal of Operations Research , vol. 30, no. 3, pp. 991–1017, 2022
2022
Later among the works it cites.
Y. Wang and N. Wang, “Moving-target travelling salesman problem for a helicopter patrolling suspicious boats in antipiracy escort operations,” Expert Systems with Applications , vol. 213, p. 118986, 2023
2023
Later among the works it cites.
A. Maskooki and M. Kallio, “A bi-criteria moving-target travelling salesman problem under uncertainty,” European Journal of Operational Research , 2023
2023
Later among the works it cites.
Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” 2023. [Online]. Available: https://www.gurobi.com
2023
Later among the works it cites.
T. Marcucci, J. Umenberger, P. Parrilo, and R. Tedrake, “Shortest paths in graphs of convex sets,” SIAM Journal on Optimization , vol. 34, no. 1, pp. 507–532, 2024
2024
Closest in time.