# Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem
## 5 Heuristics for the MD-GmTSP
### Initial Solution: Construction Phase
(2022) [PERSON]; [PERSON]; [PERSON] An algorithm for task allocation and planning for a heterogeneous multi-robot system to minimize the last task completion time. _Sensors_**2022**, _22_, 5637. [CrossRef]
* [PERSON] and [PERSON] (2022) [PERSON]; [PERSON] A Meta Heuristic Genetic Algorithm for Multi-Depot Routing in Autonomous Bridge Inspection. In Proceedings of the 2022 IEEE Symposium Series on Computational Intelligence (SSCI), Singapore, 4-7 December 2022; pp. 1194-1201. * [PERSON] et al. (2023) [PERSON]; [PERSON]; [PERSON] Learn to Solve the Min-max Multiple Traveling Salesmen Problem with Reinforcement Learning. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, London, UK, 29 May-2 June 2023; pp. 878-886. * [PERSON] et al. (1976) [PERSON]; [PERSON]; [PERSON] Approximation algorithms for some routing problems. In Proceedings of the 17 th Annual Symposium on Foundations of Computer Science (sfcs 1976), Houston, TX, USA, 25-27 October 1976; pp. 216-227. [CrossRef]* _[PERSON] et al. (2010)_ [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] 3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. _Optim. Lett._**2010**, \(6\), 141-152. [CrossRef]
* _[PERSON] et al. (2021)_ [PERSON]; [PERSON] [PERSON]; [PERSON]*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding. In Proceedings of the International Conference on Automated Planning and Scheduling, Guangzhou, China, 7-12 June 2021; Volume 31, pp. 85-93. * _[PERSON] et al. (2007)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Solving Min-Max Multi-Depot Vehicle Routing Problem. In _Proceedings of the Lectures on Global Optimization (Volume 55 in the Series Fields Institute Communications)_; American Mathematical Society: Providence, RI, USA, 2007. * _[PERSON] et al. (2013)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] An ant colony optimization technique for solving Min-max Multi-Depot Vehicle Routing Problem. _Swarm Evol. Comput._**2013**, _13_, 63-73. [CrossRef]
* _[PERSON] et al. (2019)_ [PERSON]; [PERSON] Mission-oriented ant-team ACO for min-max MTSP. _Appl. Soft Comput._**2019**, _76_, 436-444. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Min-max Path Planning of Multiple UAVs for Autonomous Inspection. In Proceedings of the 2020 International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China, 21-23 October 2020; pp. 1058-1063. [CrossRef]
* _[PERSON] et al. (2015)_ [PERSON]; [PERSON]; [PERSON] The min-max multi-depot vehicle routing problem: Heuristics and computational results. _J. Oper. Res. Soc._**2015**, _66_, 1430-1441. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Market Approach to Length Constrained Min-Max Multiple Depot Multiple Traveling Salesman Problem. In Proceedings of the 2020 American Control Conference (ACC), Denver, CO, USA, 1-3 July 2020; pp. 138-143. [CrossRef]
* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON] Min-Max Tours for Task Allocation to Heterogeneous Agents. In Proceedings of the 2018 IEEE Conference on Decision and Control (CDC), Miami Beach, FL, USA, 17-19 December 2018; pp. 1706-1711. [CrossRef]
* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON] Min-Max Path Planning Algorithms for Heterogeneous, Autonomous Underwater Vehicles. In Proceedings of the 2018 IEEE/OES Autonomous Underwater Vehicle Workshop (AUV), Porto, Portugal, 6-9 November 2018; pp. 1-6. [CrossRef]
* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Energy-Efficient Min-Max Planning of Heterogeneous Tasks with Multiple UAVs. In Proceedings of the 2018 IEEE 24 th International Conference on Parallel and Distributed Systems (ICPADS), Singapore, 11-13 December 2018; pp. 339-346. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Approximation Algorithms for the Min-Max Cycle Cover Problem With Neighborhoods. _IEEE/ACM Trans. Netw._**2020**, _28_, 1845-1858.