A transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem

A Comparative Study between Optimization and Market-Based Approaches to Multi-Robot Task Allocation

“…The author of this work proposed an auction-based approach to solve the MRTA problem after formulating the problem as an instance of the mTSP. In [8], a set of heterogeneous UAVs is required to be used in surveillance mission, where a set of targets should be observed by these UAVs. The problem can be considered a MRTA problem and can be modeled as a heterogeneous multiple depot, multiple UAV routing problem which is a another variation of the mTSP.…”

“…The mutation operators used in the proposed algorithms are ← Minimum ( ) (6) for ← 1 to do (7) if < 25% then (8) = 20% (9) else if < 50% > 25% then (10) = 30% (11) else if < 75% > 50% then (12) = 40% (13) else (14) = 50% (15) end (16) ℎ ← crossover (The minimum 10% of ) (17) ℎ ← mutation (The maximum 90% of ) (18) ← The minimum of (ii) order crossover.…”

Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs

“…Particularly for the military or military-related applications of TSP, e.g., [2,10,11,13,15,19], many uncertain factors could exist in the route that is planned for a military manned or unmanned aerial vehicle to visit or monitor a series of targets and then to return to the base. When the traveling time of one or more arcs in the selected route is much longer than expected due to bad weather condition or enemy's presence and interference, the resources to support the mission (e.g.…”

Evolutionary Algorithms Based on the Automata Theory for the Multi-Objective Optimization of Combinatorial Problems

“…In this field it is possible to find a lot of problems denominated NP-Hard, that is mean that the problem does not have a solution in Polynomial Time. For instance, problems such as Multi-depot vehicle routing problem (Lim & Wang, 2005), delivery and pickup vehicle routing problem with time windows (Wang & Lang, 2008), multi-depot vehicle routing problem with weight-related costs (Fung et al, 2009), Railway Traveling Salesman Problem (Hu & Raidl, 2008), Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem (Oberlin et al, 2009) and Traveling Salesman with Multi-agent (Wang & Xu, 2009) are categorized as NP-Hard problems.…”