Experimental analysis of heuristic solutions for the moving target traveling salesman problem applied to a moving targets monitoring system
作者：
Highlights：
• Crowd monitoring mapped as a Moving Target Traveling Salesman Problem instance.
• Design of a solution to address the analyzed problem.
• Experimental evaluation of different heuristics approaches to the analyzed problem.
• Discussions about the pros and cons of each approach.
• Conclusion in favor of Genetic Algorithm compared to the other heuristics.
摘要
•Crowd monitoring mapped as a Moving Target Traveling Salesman Problem instance.•Design of a solution to address the analyzed problem.•Experimental evaluation of different heuristics approaches to the analyzed problem.•Discussions about the pros and cons of each approach.•Conclusion in favor of Genetic Algorithm compared to the other heuristics.
论文关键词：Ant Colony Optimization,Genetic Algorithms,Simulated Annealing,Artificial intelligence,Moving target traveling salesman problem,Moving targets
论文评审过程：Received 27 September 2018, Revised 5 March 2019, Accepted 11 April 2019, Available online 12 April 2019, Version of Record 2 July 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.04.023
