# Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem
## 5 Heuristics for the MD-GmTSP
### Initial Solution: Construction Phase
Overall, the learning based methods work well for smaller instances, while the GVNS based approaches perform better for large instances. Future work can address factors related to planning paths in the presence of obstacles and uncertainties in the position of targets. Methodology, A.N. and S.R. ; Software, A.N. ; Investigation, S.R. ; Writing--original draft, A.N. ; Writing--review & editing, S.R. All authors have read and agreed to the published version of the manuscript. This research received no external funding. **Institutional Review Board Statement:** Not applicable. **Informed Consent Statement:** Not applicable. **Data Availability Statement:** The data used in this study are openly available at [[http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/](http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/)]([http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/](http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/)). Refer to [40]. **Conflicts of Interest:** The authors declare no conflict of interest. ## References

* (1) [PERSON]; [PERSON]; [PERSON]; [PERSON] Erratum: The traveling salesman problem: A guided tour of combinatorial optimization. _J. Oper. Res. Soc._**1986**, _37_, 655-655. [CrossRef]
* (2) [PERSON] The traveling salesman problem: An overview of exact and approximate algorithms. _Eur. J. Oper. Res._**1992**, _59_, 231-247. [CrossRef]
* (3) [PERSON]; [PERSON]; [PERSON], Path Planning for Special Robotic Operations. In _Robot Design: From Theory to Service Applications_; [PERSON]; [PERSON], Eds. ; Springer International Publishing: Cham, Switzerland, 2023; pp. 69-95. [CrossRef]
* (4) [PERSON] Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming. _Transp. Res. Part C Emerg. Technol._**2018**[PERSON] _91_, 1-14. [CrossRef]
* (5) [PERSON]; [PERSON]; [PERSON] A two-stage approach for routing multiple unmanned aerial vehicles with stochastic fuel consumption. _Sensors_**2018**, _18_[PERSON] 3756[PERSON] [CrossRef] [PubMed]
* (6) [PERSON]; [PERSON]; [PERSON] A cloud based disaster management system. _J. Sens. Actuator Netw._**2020**, \(9\), 6. [CrossRef]
* (7) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem. In _Field and Service Robotics_; [PERSON], [PERSON]; Springer: Singapore, 2021; pp. 277-290. * (8) [PERSON] [PERSON]; [PERSON]; [PERSON] Mix-opt: A new route operator for optimal coverage path planning for a fleet in an agricultural environment. _Expert Syst. Appl._**2016**, _54_, 364-378. [CrossRef]
* (9) [PERSON]; [PERSON]; [PERSON] A heuristic distributed task allocation method for multivehicle multitask problems and its application to search and [PERSON] scenario. _IEEE Trans. Cybern._**2015**, _46_, 902-915. [CrossRef]
* (10) [PERSON]; [PERSON]; [PERSON] An Integrated Traveling Salesman and Coverage Path Planning Problem for Unmanned Aircraft Systems. _IEEE Control Syst. Lett._**2019**, \(3\), 67-72. [CrossRef]
* (11) [PERSON]; [PERSON]; [PERSON] An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team. _IEEE Robot. Autom. Lett._**2020**, \(5\), 2146-2153. [CrossRef]
* (12) [PERSON] Printing press scheduling for multi-edition periodicals. _Manag. Sci._**1970**, _16_, B-373. [CrossRef]
* (13) [PERSON]; [PERSON] The design of the global navigation satellite system surveying networks using genetic algorithms. _Eng. Appl. Artif. Intell._**2004**, _17_, 111-122. [CrossRef]
* (14) [PERSON]; [PERSON]; [PERSON]; [PERSON] Computer-assisted school bus scheduling. _Manag. Sci._**1972**, _18_, B-279. [CrossRef]
* (15) [PERSON]; [PERSON] Dynamic mission planning for multiple mobile robots. In Proceedings of the IEEE International Conference on Robotics and Automation, Minneapolis, MN, USA, 22-28 April 1996; Volume 3, pp. 2396-2401.