Heuristics for Two Depot Heterogeneous Unmanned Vehicle Path Planning to Minimize Maximum Travel Cost

Abstract

A solution to the multiple depot heterogeneous traveling salesman problem with a min-max objective is in great demand with many potential applications of unmanned vehicles, as it is highly related to a reduction in the job completion time. As an initial idea for solving the min-max multiple depot heterogeneous traveling salesman problem, new heuristics for path planning problem of two heterogeneous unmanned vehicles are proposed in this article. Specifically, a task allocation and routing problem of two (structurally) heterogeneous unmanned vehicles that are located in distinctive depots and a set of targets to visit is considered. The unmanned vehicles, being heterogeneous, have different travel costs that are determined by their motion constraints. The objective is to find a tour for each vehicle such that each target location is visited at least once by one of the vehicles while the maximum travel cost is minimized. Two heuristics based on a primal-dual technique are proposed to solve the cases where the travel costs are symmetric and asymmetric. The computational results of the implementation have shown that the proposed algorithms produce feasible solutions of good quality within relatively short computation times.

1. Introduction

In most applications of monitoring of large environments, the utilization of multiple autonomous unmanned vehicles (UVs) is preferred to improve system efficiency. For example, unmanned aerial vehicles (UAVs) are widely used in crop management [1,2], traffic monitoring [3], and forest management [4,5]. Various types of multiple UVs are widely used in surveillance [6,7,8], search and rescue applications [9,10,11], and transportation [12]. In most of these applications, the fundamental subproblem to efficiently operating the multiple UV systems is finding paths for UVs such that each target is visited by one of the UVs at least once while minimizing the final job completion time. When the UVs involved in an application are not identical to each other, differing in either structure or function or both, and located in distinctive initial locations, the problem is known as the min-max Multiple Depot Heterogeneous Traveling Salesman Problem (MDHTSP). When there exists only one UV—the simplest case—the problem becomes a traveling salesman problem (TSP). Thus, min-max MDHTSP is a generalized TSP and NP-hard [13].

The use of multiple UVs is preferred, especially in large environments. To find an optimal solution for these large sized problems, a large amount of computational effort is required. However, in many applications, the exact location of the vehicles and targets may not be known at the time of operation due to the uncertainty or limited capabilities of the sensors mounted on UVs. The research for path planning under sensor related issues are actively on-going [14,15,16,17]. For these cases, especially involving multiple heterogeneous UVs, having a good suboptimal solution within a short computation time could result in a higher efficiency rather than having an optimal solution after several days of computations. The approaches presented in this paper has been developed for such cases. In this study, as an initial step for solving min-max MDHTSP, the algorithms are developed to solve a TSP for systems involving two structurally heterogeneous UVs while focused on task allocation, finding an optimal assignment of targets for each vehicle and their optimal sequence of visit, and on routing, finding an optimal path for each vehicle in a given sequence. The problem is known as the two depot heterogeneous traveling salesman problem (TDHTSP). Based on previous work [18], the algorithm has been extended for solving the min-max objective by iteratively running the primal-dual algorithm for min-sum TDHTSP with some modification. In addition, we have also considered the case when travel costs are asymmetric with the direction of edges.

As research on the MDHTSP and multiple depot heterogeneous vehicle routing problems (MDHVRP) has advanced from a single agent problem, a majority of the research in literature solves the problem for the total travel costs of all agents to be minimized (min-sum). However, minimizing the maximum travel cost is essential in practical applications because it is directly related to the workload balance between agents and the reduction of job completion time. Few publications have dealt with the min-max MDHTSP or min-max MDHVRP. Franceschelli et al. proposed gossip algorithms for a class of heterogeneous multi-vehicle task assignment and routing problems [19]. Prasad and Choi presented an approximation algorithm for dealing with a task allocation problem for heterogeneous agents starting from a single depot [20].

There are also a few publications that solved min-max multiple depot vehicle routing problems of homogeneous vehicles. Stodola developed an algorithm for a min-max MDVRP based on the Ant Colony Optimization theory [21]. In Reference [22], Wang et al. proposed a heuristic that used a linear program (LP)-based approach as an initial solution and improved in further iterations. Some studies addressed the min-sum MDHTSP. Sundar and Rathinam developed an exact algorithm based on a branch-and-cut method while considering both structural and functional heterogeneity in Reference [23]. The transformation method of generalized MDHATSP into an ATSP was proposed in Reference [24]. A special type of problem called close open multi-depot mixed vehicle routing problem was dealt with in Reference [25], and a new mixed integer programming model and a hybrid metaheuristic were presented. In

Table 1. An overview of the literature of related problems.

	Depots	Heterogeneity(s)	Heterogeneity(f)	Objective	Methodology	Cost
This Paper	Two	Yes	No	Min-Max	Primal-Dual	Symmetric and Asymmetric
[18]	two	Yes	No	min-sum	primal-dual	symmetric
[19]	multiple	Yes	No	min-max	gossip algorithm	symmetric
[20]	single	No	Yes	min-max	5-approx algo.	symmetric
[21]	multiple	No	No	min-max	ant colony opt.	symmetric
[22]	multiple	No	No	min-max	LP based heuristic	symmetric
[23]	multiple	Yes	Yes	min-sum	branch and cut	asymmetric
[24]	multiple	Yes	No	min-sum	transformation	asymmetric
[25]	multiple	No	Yes	min-sum	hybrid GA	symmetric

, a brief review of the related literature is presented. The categories “Heterogeneity(s)” and “Heterogeneity(f)” refer structural heterogeneity and functional heterogeneity, respectively.

As an initial step of solving min-max MDHTSP in time efficient manner, this paper made the following main contributions. First, the multiple depot heterogeneous traveling salesman problem that involves two heterogeneous vehicles is solved while considering cost symmetricity. Second, the primal-dual method [26] is applied for the min-max objective for the first time. The primal-dual method is an optimization technique that solves mixed integer program (MIP) problems with simple greedy algorithms. To apply primal-dual technique, the LP relaxation of MIP should be derived and its dual problem will be introduced. Then, by iteratively varying the dual variables, one can find an optimal or sub-optimal solution in time efficient manner. Lastly, relatively short computational time of the algorithm is shown through an implementation for different sizes of the problem.

The remainder of this paper is structured as follows: In Section 2, the problem is defined. In Section 3, a formulation of the TDHTSP where travel costs are symmetric is presented and a primal-dual based heuristic that solves the problem is proposed. In Section 4, the case where travel costs are asymmetric is considered. The proposed heuristics are implemented and the computational results are presented in Section 5. Section 6 consists some concluding remarks and future scope.

2. Problem Statement

As previously mentioned in Section 1, the Two Depot Heterogeneous Traveling Salesman Problem (TDHTSP) is considered in this article. Since only the structural heterogeneity is considered at this time, we assume that each vehicle has its own distinctive average running velocity and minimum turning radius. To handle this heterogeneity in an efficient manner, we assume that the faster vehicle has a smaller minimum turning radius compared to the slower vehicle. The faster vehicle is indexed as $r_1$ and the other one is indexed as $r_2$, such that $cos{t}_{ij}^1\le cos{t}_{ij}^2\forall (i,j)$, where $cos{t}_{ij}^k$ denotes the cost of traveling edge $(i,j)$ using $r_k$. We also assume that the triangle inequality is satisfied for both UVs. In this article, two separate algorithms are developed for the cases when the travel costs are symmetric and asymmetric. Initially, the UVs are located at their distinctive depots. Each vehicle starts the route at its depot, visits a set of assigned targets, and finishes the route by turning back to the depot. The objective of this TDHTSP is to find a route for each vehicle such that each target is visited only once by one of the UVs while the maximum final tour cost is minimized.

When a set of n targets is given, the parameters and decision variables used in formulations, and the variables used in pseudo-codes can be described as follows:

Parameters:

$R=\{r_1,r_2\}$	a set of UVs
$D=\{d_1,d_2\}$	a set of depots
$T=\{t_1,\cdots ,t_n\}$	a set of targets
$V_k=\{\left\{d_k\right\}\cup T\}$	a set of vertices for $r_k$
$E_k=\{(i,j),\forall i,j\in V_k\}$	a set of edges that connect all vertices in $V_k$
$C_k=\{cos{t}_{ij}^k,\forall (i,j)\in E_k\}$	a set of travel costs of all edges in $E_k$
${\delta }_k\left(S\right)$	the subset of the edges of $E_k$ that have one end in S and the other end in $V_k\backslash S$
${\delta }_k^{+}\left(S\right)$	the subset of the edges $(i,j)\in E_k$ such that $i\in V_k\backslash S$ and $j\in S$

Decision variables:

$x_{ij}^k$	the decision variable that represents whether edge $(i,j)$ is used for the tour of $r_k$
	$x_{ij}^k=\left\{\begin{array}{cc}1\hfill & \mathrm{if}\mathrm{edge}(i,j)\mathrm{is}\mathrm{traveled}\mathrm{by}{r}_k\hfill \\ 0\hfill & \mathrm{otherwise}\hfill \end{array}\right.$
$z_U$	the decision variable that represents partition of targets in T
	$z_U=\left\{\begin{array}{cc}1\hfill & \mathrm{if}\mathrm{set}U\mathrm{contains}\mathrm{all}\mathrm{the}\mathrm{vertices}\mathrm{not}\mathrm{visited}\mathrm{by}{r}_1\hfill \\ 0\hfill & \mathrm{otherwise}\hfill \end{array}\right.$
t	the maximum travel cost

Variables used in algorithm pseudo-codes:

$TourCos{t}_k$	the final tour cost of $r_k$ within a given partition of the targets
$Tou{r}_k$	the final tour of $r_k$ within a given partition of the targets
$F_k$	a set of edges in the forest corresponding to $r_k$
${\mathcal{C}}_k$	a set of connected components in $F_k$
$Y_k\left(C\right)$	the dual variable of a set C in ${\mathcal{C}}_k$, which keeps track of ${\sum }_{S\subseteq C}{Y}_k\left(S\right)$

$dua{l}_k\left(v\right)$	the dual variable of a set C where $v\in C$, which keeps track of ${\sum }_{C:u\in C}{Y}_k\left(C\right)$
$bound\left(C\right)$	the dual variable of a set C in ${\mathcal{C}}_2$, which keeps track of ${\sum }_{S\subseteq U}{Y}_2\left(S\right)$
$activ{e}_k\left(C\right)$	the activeness of set $C\in {\mathcal{C}}_k$. $activ{e}_k\left(C\right)=1$ only if C is active.
$Children\left(C\right)$	the subsets of set $C\in {\mathcal{C}}_1$ in ${\mathcal{C}}_2$

As the definitions of the parameters, ${\delta }_k\left(S\right)$ contains all the edges crossing S and outside S, while ${\delta }_k^{+}\left(S\right)$ contains all the incoming edges to S from outside S. Moreover, only one subset U of T is allowed to have $z_U=1$, as $z_U$ is set to 1 only if U contains all of the vertices visited by $r_2$.

3. TDHTSP with Symmetric Travel Costs

3.1. Problem Formulation

When the travel costs are symmetric, i.e., $cos{t}_{ij}^k=cos{t}_{ji}^k,\forall (i,j)\in E_k,k=1,2$, we can formulate an mixed integer program as follows:

$$\begin{array}{c}{C}_{I{P}_1}=mint\hfill \end{array}$$

(1)

$$\begin{array}{c}\hfill \mathrm{subject}\mathrm{to}\\ \hfill \sum _{(i,j)\in {\delta }_1\left(S\right)}{x}_{ij}^1\ge & 2-2\sum _{T\supseteq U\supseteq S}{z}_U\forall S\subseteq T,\hfill \end{array}$$

(2)

$$\begin{array}{cc}\hfill \sum _{(i,j)\in {\delta }_2\left(S\right)}{x}_{ij}^2\ge & 2\sum _{T\supseteq U\supseteq S}{z}_U\forall S\subseteq T,\hfill \end{array}$$

(3)

$$\begin{array}{cc}\hfill \sum _{e\in {\delta }_1\left(i\right)}{x}_{ij}^1=& 2-2\sum _{T\supseteq U\supseteq \left\{i\right\}}{z}_U\forall i\in T,\hfill \end{array}$$

(4)

$$\begin{array}{cc}\hfill \sum _{e\in {\delta }_2\left(i\right)}{x}_{ij}^2=& 2\sum _{T\supseteq U\supseteq \left\{i\right\}}{z}_U\forall i\in T,\hfill \end{array}$$

(5)

$$\begin{array}{cc}\hfill t\ge & \sum _{\{i,j\}\in E_k}cos{t}_{ij}^k{x}_{ij}^{k}k=1,2,\hfill \end{array}$$

(6)

$$\begin{array}{cc}\hfill x_{ij}^k\in & \{0,1\}\forall i,j\in T,k=1,2,\hfill \end{array}$$

(7)

$$\begin{array}{cc}\hfill x_{ij}^k\in & \{0,1,2\}\mathrm{for} i=d_k,\forall j\in T,k=1,2,\hfill \end{array}$$

(8)

$$\begin{array}{cc}\hfill z_U\in & \{0,1\}\forall U\subseteq T,\hfill \end{array}$$

(9)

$$\begin{array}{cc}\hfill t\ge & 0.\hfill \end{array}$$

(10)

In this formulation, Equations (2) and (3) are the edge constraints that if there is at least one vertex in S that is not connected to the other depot, at least two edges must be chosen from ${\delta }_k\left(S\right)$ for the tour of $r_k$ for any $S\subseteq T$. Equations (4) and (5) are the degree constraints of each target. Equation (6) represents that t is the maximum travel cost, and Equations (7)–(9) are the integer constraints of decision variables. Equation (10) is the nonnegative constraint of t. Now, by relaxing the degree constraints and integer constraints, an LP can be formulated as shown below:

$$\begin{array}{c}{C}_{L{P}_1}=mint\hfill \end{array}$$

(11)

$$\begin{array}{c}\hfill \mathrm{subject}\mathrm{to}\\ \hfill \sum _{(i,j)\in {\delta }_1\left(S\right)}{x}_{ij}^1\ge & 2-2\sum _{T\supseteq U\supseteq S}{z}_U\forall S\subseteq T,\hfill \end{array}$$

(12)

$$\begin{array}{cc}\hfill \sum _{(i,j)\in {\delta }_2\left(S\right)}{x}_{ij}^2\ge & 2\sum _{T\supseteq U\supseteq S}{z}_U\forall S\subseteq T,\hfill \end{array}$$

(13)

$$\begin{array}{cc}\hfill t\ge & \sum _{\{i,j\}\in E_k}cos{t}_{ij}^k{x}_{ij}^{k}k=1,2,\hfill \end{array}$$

(14)

$$\begin{array}{cc}\hfill x_{ij}^k\ge & 0\forall (i,j)\in E_k,k=1,2,\hfill \end{array}$$

(15)

$$\begin{array}{cc}\hfill z_U\ge & 0\forall U\subseteq T,\hfill \end{array}$$

(16)

$$\begin{array}{cc}\hfill t\ge & 0\hfill \end{array}$$

(17)

To obtain the dual problem of the LP above, we introduce the dual variables, $Y_1\left(S\right)$, $Y_2\left(S\right)$, and $W_k$ for Equations (12)–(14), respectively. Then, the following dual problem can be introduced.

$$\begin{array}{c}{C}_{dua{l}_1}=max2\sum _{S\subseteq T}{Y}_1\left(S\right)\hfill \end{array}$$

(18)

$$\begin{array}{c}\hfill \mathrm{subject}\mathrm{to}\\ \hfill \sum _{S:e\in {\delta }_1\left(S\right)}{Y}_1\left(S\right)\le & cos{t}_{ij}^1{W}_1\forall (i,j)\in E_1,\hfill \end{array}$$

(19)

$$\begin{array}{cc}\hfill \sum _{S:e\in {\delta }_2\left(S\right)}{Y}_2\left(S\right)\le & cos{t}_{ij}^2{W}_2\forall (i,j)\in E_2,\hfill \end{array}$$

(20)

$$\begin{array}{cc}\hfill \sum _{S\subseteq U}{Y}_1\left(S\right)& \le \sum _{S\subseteq U}{Y}_2\left(S\right)\forall U\subseteq T,\hfill \end{array}$$

(21)

$$\begin{array}{cc}\hfill W_1+W_2\le & 1\hfill \end{array}$$

(22)

$$\begin{array}{cc}\hfill Y_k\left(S\right)\ge & 0\forall S\subseteq T,k=1,2,\hfill \end{array}$$

(23)

$$\begin{array}{cc}\hfill W_k\ge & 0k=1,2.\hfill \end{array}$$

(24)

In the proposed heuristic, the dual variables $Y_1\left(S\right),Y_2\left(S\right)$ can be interpreted as the costs that each set of S is willing to pay to be connected to the corresponding depots. The dual variable $W_k$ can be interpreted as the weight that prioritizes one of the UVs, i.e., if $W_1>W_2$, the algorithm will give priority to $r_2$, and vice versa. By adjusting the values of $W_k$ while maintaining the cost condition of $W_{1}cos{t}_{ij}^1\le W_{2}cos{t}_{ij}^2\forall (i,j)$ to be satisfied all times, we may be able to decrease the maximum tour cost in the proposed algorithm. With a fixed $W_k$, we can obtain a heterogeneous spanning forest (HSF) that connects each vertex to one of the depots by using this dual problem. The obtained HSF is utilized as a target assignment, and the routes can be derived within the partitions using existing algorithms.

3.2. A Heuristic for the TDHTSP

The pseudo-codes of the heuristic for TDHTSP is presented in Algorithms 1 and 2. In Algorithm 1, to reduce the maximum travel cost, we iteratively run Algorithm 2 by varying the values of $W_1$ and $W_2$. As presented in Algorithm 1, we at first set $W_1$ and $W_2$ to be equal to 0.5. Based on the initial routing result, we increase or decrease $W_1$ with a small value $ϵ\le 0.1$ and set $W_2$ as $1-W_1$ so that the constraint in Equation (22) is tight all the time. With updated $W_k$ values, the routes are newly derived and we determine whether any reduction exists in t. Iteration stops when either the other vehicle has the maximum tour cost or there exists any violation in the cost condition of $W_{1}cos{t}_{ij}^1\le W_{2}cos{t}_{ij}^2\forall (i,j)$.

With fixed values for $W_1$ and $W_2$, we derive a task allocation for the UVs using the primal-dual heuristic that solves an HSF based on the dual problem in Equations (18)–(24) that is presented in Algorithm 2. Initially, each set contains one vertex and each tree $F_k$ is empty. The sets containing targets are active, and the sets containing depots are inactive. All dual variables are set to zero, and all vertices are unmarked. In the main loop, the algorithm consistently increases the dual variables of the active sets by an amount that makes one of dual constraints in Equations (19)–(21) tight. If one of the constraints in Equations (19) or (20) becomes tight, the corresponding edge is added to the tree $F_k$. The two sets connected through the newly added edge are now combined into a new set. If the new set does not contain the depot, it becomes an active set. Otherwise, the new set is deactivated. If $k=1$ and the new set contains $d_1$, all children (the subsets in ${\mathcal{C}}_2$) of the newly formed set are also deactivated. If one of the constraints in Equations (21) becomes tight, the corresponding set is deactivated and the vertices in the set are marked. The iteration terminates when all sets in ${\mathcal{C}}_1$ become inactive.

At this point, most primal-dual algorithms that solve min-sum TSPs perform reverse-deleting as pruning steps after the main loop is terminated because the edge added at the i-th iteration has a smaller cost than the edge added at the $(i+1)$-th iteration for any i in the loop. Deletion of the unnecessary edges in a reverse order would reduce the total sum of the travel costs. However, as we are dealing with a min-max problem, we need to consider the balance of workload. Thus, instead of reverse-deleting, we perform pruning steps we designed in the proposed heuristic. Once the main loop is terminated, we sort the targets into three partitions: $P_1,P_2$, and $P_c$. Each $P_k$ for $k=1,2$ contains the vertices that are only connected to $d_k$, while $P_c$ contains the vertices that are connected to both $d_1$ and $d_2$. For $P_1$ and $P_2$, we find the minimum spanning trees $T_1$ and $T_2$, respectively. If $P_k$ only contains its depot, $T_k$ is set to be empty. Then, we distribute the targets in $P_c$ to $P_1$ and $P_2$ depending on the current workload. Until all targets in $P_c$ are distributed, the algorithm finds edges $e_k$ for $k=1,2$ that connect any vertex in $P_k$ to one of the targets in $P_c$ with the minimum cost. Depending on the current total edge costs in $T_k$, the edge is added to the tree with a lower cost. The corresponding vertex is removed from $P_c$ and added to $P_k$. When $P_c$ becomes empty, each of the targets will be connected to only one of the depots in either $T_1$ or $T_2$. Once partitioning is finished, a tour for each partition can be found using existing algorithms, i.e., LKH [27] in our implementation. In Figure 1, the routes of each iteration of Algorithm 1 for an instance with 120 targets has been presented. Finally, proof of the feasibility of the proposed heuristic for TDHTSP and running time analysis are presented in Lemma 1.

Algorithm 1 A heuristic for min-max TDHTSP
1:	$W_1=W_2=0.5$;
2:	Determine a heterogeneous spanning forest using the proposed primal-dual heuristic.
3:	for$k=1,2$do
4:	Let the connected targets reachable from the depot be a partition and label it as $P_k$.
5:	end for
6:	For $k=1,2$, derive $TourCos{t}_k$ and $Tou{r}_k$ for $r_k$ within $P_k$ (using an existing routing algorithm).
7:	$G\leftarrow max\left(TourCos{t}_k\right)$
8:	if$TourCos{t}_1\ge TourCos{t}_2$then
9:	while $TourCos{t}_1\ge TourCos{t}_2$ do
10:	$W_1\leftarrow W_1+ϵ;W_2\leftarrow 1-W_1$
11:	Redetermine a target assignment using the proposed primal-dual heuristic and obtain the partitions $P_k^{\prime }$.
12:	for$k=1,2$ do
13:	Derive $TourCos{t}_k^{\prime }$ and $Tou{r}_k^{\prime }$ within $P_k^{\prime }$.
14:	end for
15:	if $Tou{r}^{\prime }$ is infeasible then
16:	break, {comment: $\because W_1\times cos{t}_{ij}^1>W_2\times cos{t}_{ij}^2$ for some $(i,j)$}
17:	else
18:	$G^{\prime }\leftarrow max\left(TourCos{t}_k^{\prime }\right)$
19:	if $G^{\prime }<G$ then
20:	$G\leftarrow G^{\prime }$
21:	for$k=1,2$ do
22:	$TourCos{t}_k\leftarrow TourCos{t}_k^{\prime };Tou{r}_k\leftarrow Tou{r}_k^{\prime }$
23:	end for
24:	end if
25:	end if
26:	end while
27:	else
28:	while $TourCos{t}_1\le TourCos{t}_2$ do
29:	$W_1\leftarrow W_1-ϵ;W_2\leftarrow 1-W_1$
30:	Redetermine a target assignment using the proposed primal-dual heuristic and obtain the partitions $P_k^{\prime }$.
31:	for $k=1,2$ do
32:	Derive $TourCos{t}_k^{\prime }$ and $Tou{r}_k^{\prime }$ within $P_k^{\prime }$.
33:	end for
34:	$G^{\prime }\leftarrow max\left(TourCos{t}_k^{\prime }\right)$
35:	if $G^{\prime }<G$ then
36:	$G\leftarrow G^{\prime }$
37:	for$k=1,2$ do
38:	$TourCos{t}_k\leftarrow TourCos{t}_k^{\prime };Tou{r}_k\leftarrow Tou{r}_k^{\prime }$
39:	end for
40:	end if
41:	end while
42:	end if
43:	return$Tou{r}_k,TourCos{t}_k$

Algorithm 2 Primal-dual heuristic for finding an HSF
1:	Initialization
2:	$F_k\leftarrow \varnothing$, ${\mathcal{C}}_k\leftarrow \{\left\{v\right\}:v\in V_k\}$ for $k=1,2$
3:	All vertices are unmarked.
4:	All dual variables are set to zero.
5:	$activ{e}_k\left(\left\{v\right\}\right)\leftarrow 1$, $\forall v\in V_k$, for $k=1,2$
6:	$activ{e}_k\left(\left\{d_k\right\}\right)\leftarrow 0$, for $k=1,2$
7:	Main loop
8:	while there exists any active component in ${\mathcal{C}}_1$ do
9:	for$k=1,2$ do
10:	Find an edge $e_k=(i,j)\in E_k$ with $i\in C_i,j\in C_j$ where $C_i,C_j\in {\mathcal{C}}_k,C_i\ne C_j$ that minimizes ${\epsilon }_k=\frac{\{W_k\times cos{t}_{ij}^k-dua{l}_k\left(i\right)-dua{l}_k\left(j\right)\}}{activ{e}_k\left(C_i\right)+activ{e}_k\left(C_j\right)}$.
11:	end for
12:	Let $\Re :=\{R:activ{e}_k\left(R\right)=1,\mathrm{One}\mathrm{of}\mathrm{subsets}\mathrm{of}R\mathrm{contains}{d}_2,\forall R\in {\mathcal{C}}_1\}$.
13:	Find $\overline{R}\in \Re$ that minimizes ${\epsilon }_3=bound\left(\overline{R}\right)-Y_1\left(\overline{R}\right)$
14:	${\epsilon }_{min}=min({\epsilon }_1,{\epsilon }_2,{\epsilon }_3)$
15:	for $k=1,2$ do
16:	for$C\in {\mathcal{C}}_k$ do
17:	$Y_k\left(C\right)\leftarrow Y_k\left(C\right)+{\epsilon }_{min}\times activ{e}_k\left(C\right)$
18:	$dua{l}_k\left(v\right)\leftarrow dua{l}_k\left(v\right)+{\epsilon }_{min}\times activ{e}_k\left(C\right),\forall v\in C$
19:	if $k=1$ then
20:	$bound\left(C\right)\leftarrow bound\left(C\right)+{\epsilon }_{min}\left|Children\left(C\right)\right|$
21:	end if
22:	end for
23:	end for
24:	if ${\epsilon }_{min}={\epsilon }_k$ for $k=1$ or 2 then
25:	$F_k\leftarrow \left\{e_k\right\}\cup F_k$
26:	${\mathcal{C}}_k\leftarrow {\mathcal{C}}_k\cup \{C_i\cup C_j\}-C_i-C_j$
27:	$Y_k\left(\{C_i\cup C_j\}\right)=Y_k\left(C_i\right)+Y_k\left(C_j\right)$
28:	if $k=1$ then
29:	$Bound(C_i\cup C_j)\leftarrow bound\left(C_i\right)+bound\left(C_j\right)$
30:	end if
31:	if $d_k\in \{C_i\cup C_j\}$ then
32:	$activ{e}_k(C_i\cup C_j)\leftarrow 0$
33:	if $k=1$ then
34:	$activ{e}_2\left(C\right)\leftarrow 0\forall C\in Children(C_i\cup C_j)$
35:	end if
36:	else
37:	$activ{e}_k(C_i\cup C_j)\leftarrow 1$
38:	end if
39:	else
40:	$activ{e}_1\left(\overline{C}\right)\leftarrow 0$
41:	Mark all of the vertices of $\overline{C}$ with the label $\overline{C}$.
42:	end if
43:	end while
44:	Pruning
45:	$P_k\leftarrow \mathrm{all}\mathrm{vertices}\mathrm{that}\mathrm{are}\mathrm{only}\mathrm{connected}\mathrm{to}{d}_k\mathrm{for}k=1,2$
46:	$P_c\leftarrow \mathrm{the}\mathrm{vertices}\mathrm{that}\mathrm{are}\mathrm{connected}\mathrm{to}\mathrm{both}{d}_1\mathrm{and}{d}_2$
47:	Let $T_k$ be the minimum spanning tree of $P_k\mathrm{for}k=1,2$.
48:	Let $C\left(T_k\right)$ be the sum of edge costs present in $T_k$
49:	while$P_c$ is not empty do
50:	Find the shortest edge $e_k$ that connects a vertex in $P_c$ and a vertex in $P_k$ for each k.
51:	if $C\left(T_1\right)\le C\left(T_2\right)$ then
52:	Add $e_1$ to $T_1$, remove the corresponding vertex from $P_c$, and add it to $P_1$.
53:	else
54:	Add $e_2$ to $T_2$, remove the corresponding vertex from $P_c$ and add it to $P_2$.
55:	end if
56:	end while

Lemma 1.

The proposed heuristic (in Algorithms 1 and 2) produces a feasible solution for min-max TDHTSP. Each of the vertices is reachable from one of the depots, and every vertex appears only once in the routes. In addition, Algorithm 2 runs in polynomial time.

Proof. 

During the main loop in Algorithm 2, the loop terminates when all the components of ${\mathcal{C}}_1$ become inactive. There exists only two cases that can happen for deactivation. First, a set C is connected to its depot, and second, one of the constraints in Equation (21) becomes tight. However, the second case can happen only if the subsets of C in ${\mathcal{C}}_2$ is connected to $d_2$. Thus, the only possible way for termination is if each of the targets in T is connected to either $d_1$ or $d_2$. Because we make sure that all vertices are connected to one of the components in pruning steps, the proposed heuristic produces a feasible solution for the given problem.

In addition, because there are at most n components for each robot at any point in time of running Algorithm 2, each iteration will have $O\left(n\right)$ searches, yielding a time bound of $O\left(nlog\right(n\left)\right)$ per iteration or $O\left(n^{2}log\left(n\right)\right)$ for the entire loop. Thus, Algorithm 2 runs in polynomial time.  □

4. TDHTSP with Asymmetric Travel Costs

4.1. Problem Formulation

When the travel costs are asymmetric, i.e., $cos{t}_{ij}^k\ne cos{t}_{ji}^k$, the directions of the edges need to be considered to generate tours. This problem is known as the two depot heterogeneous asymmetric traveling salesman problem (TDHATSP). We can formulate the following LP by considering only the incoming edges.

$$\begin{array}{c}{C}_{L{P}_2}=mint\hfill \end{array}$$

(25)

$$\begin{array}{c}\hfill \mathrm{subject}\mathrm{to}\\ \hfill \sum _{\{i,j\}\in {\delta }_1^{+}\left(S\right)}{x}_{ij}^1\ge & 1-\sum _{T\supseteq U\supseteq S}{z}_U\forall S\subseteq T,\hfill \end{array}$$

(26)

$$\begin{array}{cc}\hfill \sum _{\{i,j\}\in {\delta }_2^{+}\left(S\right)}{x}_{ij}^2\ge & \sum _{T\supseteq U\supseteq S}{z}_U\forall S\subseteq T,\hfill \end{array}$$

(27)

$$\begin{array}{cc}\hfill t\ge & \sum _{\{i,j\}\in E_k}cos{t}_{ij}^k{x}_{ij}^{k}k=1,2,\hfill \end{array}$$

(28)

$$\begin{array}{cc}\hfill x_{ij}^k\ge & 0\forall (i,j)\in E_k,k=1,2,\hfill \end{array}$$

(29)

$$\begin{array}{cc}\hfill z_U\ge & 0\forall U\subseteq T,\hfill \end{array}$$

(30)

$$\begin{array}{cc}\hfill t\ge & 0\hfill \end{array}$$

(31)

Similar to the symmetric case in Section 3.1, by introducing the dual variables $Y_1^{+}\left(S\right)$, $Y_2^{+}\left(S\right)$ and $W_k^{+}$ for Equations (26)–(28), the dual problem of the TDHATSP can be formulated as shown below:

$$\begin{array}{c}{C}_{dua{l}_2}=max\sum _{S\subseteq T}{Y}_1^{+}\left(S\right)\hfill \end{array}$$

(32)

$$\begin{array}{c}\hfill \mathrm{subject}\mathrm{to}\\ \hfill \sum _{S:e\in {\delta }_1^{+}\left(S\right)}{Y}_1^{+}\left(S\right)\le & cos{t}_{ij}^1{W}_1^{+}\forall (i,j)\in E_1,\hfill \end{array}$$

(33)

$$\begin{array}{cc}\hfill \sum _{S:e\in {\delta }_2^{+}\left(S\right)}{Y}_2^{+}\left(S\right)\le & cos{t}_{ij}^2{W}_2^{+}\forall (i,j)\in E_2,\hfill \end{array}$$

(34)

$$\begin{array}{cc}\hfill \sum _{S\subseteq U}{Y}_1^{+}\left(S\right)\le & \sum _{S\subseteq U}{Y}_2^{+}\left(S\right)\forall U\subseteq T,\hfill \end{array}$$

(35)

$$\begin{array}{cc}\hfill W_1^{+}+W_2^{+}\le & 1\hfill \end{array}$$

(36)

$$\begin{array}{cc}\hfill Y_k^{+}\left(S\right)\ge & 0\forall S\subseteq T,k=1,2,\hfill \end{array}$$

(37)

$$\begin{array}{cc}\hfill W_k^{+}\ge & 0k=1,2.\hfill \end{array}$$

(38)

4.2. A Heuristic for the TDHATSP

The difference between the symmetric and asymmetric cases lies in the primal-dual heuristic for obtaining partitions. For asymmetric case, we apply the primal-dual technique to derive a heterogeneous directed spanning forest (HDSF). During iteration to find the best $W_k$ values, we use the same algorithm presented in Algorithm 1 as we did in Section 3. The algorithm for obtaining an HDSF is presented in Algorithm 3.

Algorithm 3 Primal-dual heuristic for finding an HDSF
1:	Initialization
2:	$F_k\leftarrow \varnothing$, ${\mathcal{C}}_k\leftarrow \{\left\{v\right\}:v\in V_k\}$ for $k=1,2$
3:	All the vertices are unmarked.
4:	All the dual variables are set to zero.
5:	$activ{e}_k\left(\left\{v\right\}\right)\leftarrow 1$, $\forall v\in V_k$, for $k=1,2$
6:	$activ{e}_k\left(\left\{d_k\right\}\right)\leftarrow 0$, for $k=1,2$
7:	Main loop
8:	while there exists any active component in ${\mathcal{C}}_1,{\mathcal{C}}_2$ do
9:	for k = 1, 2 do
10:	Find an edge $e_k=(i,j)\in E_k$ with $i\in C_i,j\in C_j$, where $C_i,C_j\in {\mathcal{C}}_k,C_i\ne C_j$ that minimizes ${\epsilon }_k=\frac{W_k^{+}cos{t}_{ij}^k-dua{l}_k\left(j\right)}{activ{e}_k\left(C_j\right)}$
11:	end for
12:	Let the corresponding $C_j\in {\mathcal{C}}_k$ be $S_k$, while $S=\{S_1,S_2\}$ satisfies $S_1\supseteq S_2$ and $S_1,S_2$ are active.
13:	$F_k\leftarrow \left\{e_k\right\}\cup F_k$
14:	Increase the dual variables of $S_k$ by ${\epsilon }_k$.
15:	if$e_k$ forms a new strongly connected component and the component is not reachable from $d_k$ then
16:	Let the strongly connected component be an active component.
17:	else if $e_k$ makes any vertex $v\in S_k$ reachable from $d_k$ then
18:	Let the depot and all vertices that are reachable from the depot be an inactive component.
19:	if $e_k=e_1$ then
20:	Deactivate all subsets of this component in ${\mathcal{C}}_2$.
21:	else
22:	Mark all vertices in the supersets of this component in ${\mathcal{C}}_1$. Deactivate it if the corresponding component consists of all marked vertices.
23:	end if
24:	else
25:	Deactivate $S_k$.
26:	end if
27:	if there exists no $S=\{S_1,S_2\}$ that can be chosen that satisfies the given conditions and there exists any inactive set without an incoming edge that is not connected to the depot then
28:	Pick an inactive component for each k that consists of marked vertices that have incoming or outgoing edges. Combine those connected components until the new component does not have any incoming edges.
29:	end if
30:	end while
31:	Pruning
32:	$P_k\leftarrow \mathrm{all}\mathrm{vertices}\mathrm{that}\mathrm{are}\mathrm{only}\mathrm{reachable}\mathrm{from}{d}_k\mathrm{for}k=1,2$
33:	$P_c\leftarrow \mathrm{the}\mathrm{vertices}\mathrm{that}\mathrm{are}\mathrm{reachable}\mathrm{from}\mathrm{both}{d}_1\mathrm{and}{d}_2$
34:	Let $T_k$ be the minimum directed spanning tree of $P_k\mathrm{for}k=1,2$.
35:	Let $C\left(T_k\right)$ be the sum of the edge costs present in $T_k$.
36:	while$P_c$ is not empty do
37:	Find the shortest edge $e_k$ that makes a vertex in $P_c$ reachable from the vertices in $P_k$ for each k.
38:	if $C\left(T_1\right)\le C\left(T_2\right)$ then
39:	Add $e_1$ to $T_1$, remove the corresponding vertex from $P_c$, and add it to $P_1$.
40:	else
41:	Add $e_2$ to $T_2$, remove the corresponding vertex from $P_c$, and add it to $P_2$.
42:	end if
43:	end while

Similar to the symmetric case, once $W_1$ and $W_2$ are fixed, we derive a target assignment using a primal-dual heuristic that solves an HDSF based on the dual problem in Equations (32)–(38). Initially, each set contains one vertex and each tree $F_k$ is empty. The sets containing targets are active, while the sets containing depots are inactive. All vertices are unmarked, and all dual variables are set to zero. In the main loop, the algorithm iteratively searches for the dual variables that make one of the dual constraints in Equations (33) and (34) tight with the minimum increase, where the corresponding set in ${\mathcal{C}}_1$ and at least one of its subsets is active. The corresponding new edge is added to its tree $F_k$. There are three cases that can occur. First, if the new edge forms any new strongly connected component that is reachable from its depot, let the strongly connected component be a new active component. Second, if the new edge forms a new strongly connected component that is reachable from $d_k$, let the depot and all reachable vertices be a new inactive component. If $e_1$ has the minimum value, all subsets in ${\mathcal{C}}_2$ are deactivated. If $e_2$ is the minimum value, all vertices in the supersets of the component in ${\mathcal{C}}_1$ are marked and deactivated. This step ensures that the third dual constraint in Equation (35) holds all of the time during iteration. Third, if neither the first nor second case occurs, deactivate the corresponding set. Once the sets are updated, the algorithm checks whether there exists any active set that has at least one active subset that can be chosen. If not, find an inactive set that has no incoming edges and is not reachable from the depot. According to the design of the algorithm, those sets should have at least one connected set that contains marked vertices. Thus, we form a new active component by combining those sets until the new set does not have any incoming edges. Once the main loop is terminated, we perform the pruning steps as we did for the symmetric case in Algorithm 2. Since the edges have directions, we form the minimum directed spanning trees for each partition $P_k$ and iteratively distribute the vertices in $P_c$ to the one that has the lower tree cost. Now, the feasibility of the proposed heuristic for TDHATSP is shown in Lemma 2. Because the running time analysis is very similar with symmetric case, the proof is omitted.

Lemma 2.

The proposed heuristic (in Algorithm 1 and 3) produces a feasible solution for min-max TDHTSP. Each of the vertices is reachable from one of the depots, and every vertex appears only once in the routes.

Proof. 

During the main loop in Algorithm 3, the loop terminates when all components become inactive. There are three cases that can happen for deactivation: (1) The edge added to the forest does not form any new strongly connected component, and no vertices in the component are reachable from one of the depots; (2) the component has become reachable from its depot; and (3) one of its subsets or supersets becomes reachable from its depot. The vertices would become reachable from one of the depots if (2) or (3) happens at least once at the time of termination.

Assume that only one active component has left for all ${\mathcal{C}}_k$ after having case (1) for all iterations. Then, there exist only two cases that can happen in the next iteration. Either the component becomes reachable from one of the depots and terminates the loop or a new active strongly connected component is formed and continues. This would be true until there exists only one large active component that containing all the vertices left except the depot, which implies the latter case cannot happen at the next iteration. Thus, at least one edge starting from one of the depots should be added before the termination. This implies that, at the time of termination, each vertex is connected to at least one of the depots. During the pruning steps, we make sure that all vertices are connected to only one of the depots while distributing vertices in $P_c$. Thus, even if there existed the vertices that were connected to both depots, only one depot would be left at the end of the algorithm. Hence, the algorithm produces a feasible solution for TDHTSP.  □

5. Implementation

In this section, we show the computational aspects of the proposed algorithms. All computational experiments were performed with a PC equipped with an Intel^®Core™ i5-7600 CPU running at 3.5 GHz with 8 GB RAM. Simulations were performed on a virtual square space with a size of $2000\times 2000$ units. The proposed algorithms were implemented using MATLAB software and run repeatedly for instances with varying problem sizes. The number of targets was set to 20, 30, 40, 60, and 80. We evaluated 50 instances for each problem size. The locations of the targets and depots were randomly generated with a uniform distribution. We assumed that both $r_1$ and $r_2$ have the motion of a Reeds–Shepp vehicle [28] for the cost-symmetric cases and the motion of a Dubins vehicle [29] for the cost-asymmetric cases. To ensure that the cost inequality is satisfied, we set the average velocity of movement $v_k$ to be $v_1>v_2$ and the minimum turning radius ${\rho }_k$ to be ${\rho }_1<{\rho }_2$. Due to the motion constraints of the robots, we generated the locations of targets to stay within the margins of ${\rho }_1$. The costs to travel between the locations were set to the minimum travel time between the locations by dividing the Reeds–Shepp curve [30] and Dubins curve [29] by the average velocity of each vehicle. Specifically, we applied ${\rho }_1=20,{\rho }_2=25$, $v_1=1.2,$ and $v_2=0.9$ in the simulations. Example routes for 30 targets produced by three different algorithms for both symmetric and asymmetric cases are presented in Figure 2. In the examples, the heuristics produced the optimal and near optimal solutions within much shorter computation times.

To ascertain the performance, LP relaxation solutions were used to find a posteriori bounds. To solve the LP relaxation, we used a multi-commodity flow formulation on CPLEX [31]. We compared the solutions for the same instances with an LP rounding method, which solves the LP relaxation and assigns each target to the one has the maximum value of the partitioning decision variable. To solve the routing problem within the partition, LKH [32] was used for both Algorithm 2 and Algorithm 3. The results of the computational evaluation is presented in Figure 3 and

Table 2. The computation time in seconds for the TDHTSP.

	Average		Worst
No. of Jobs	LP Rounding	Primal-Dual	LP Rounding	Primal-Dual
20	2.11	0.81	2.91	1.61
30	31.13	1.79	41.23	2.35
40	429.61	3.30	867.66	5.26
60	5623.48	8.62	8470.95	11.72
80	39,891.46	19.65	63,239.30	31.02

and

Table 3. The computation time in seconds for the TDHATSP.

	Average		Worst
No. of Jobs	LP Rounding	Primal-Dual	LP Rounding	Primal-Dual
20	1.59	1.23	2.38	3.28
30	17.70	4.80	22.11	12.31
40	237.06	4.86	345.81	12.79
60	3634.76	16.00	10006.30	46.08
80	30,329.19	36.21	41,330.20	99.87

.

Discussion of Implementation Results

The average and worst a posteriori bounds of each problem size for both cost-symmetric and cost-asymmetric cases are presented in Figure 3. A posteriori bound was calculated by $Cos{t}_A\left(I\right)÷Cos{t}_{LP}\left(I\right)$, where $Cos{t}_A\left(I\right)$ represents the cost of the solution obtained through algorithm A of instance I and $Cos{t}_{LP}\left(I\right)$ represents LP relaxation cost for instance I. Despite the fact that LP rounding usually produced better quality solutions for the min-sum MDHTSP and min-sum MDHATSP [33], the proposed heuristic produced better posteriori bounds for all problem sizes with the min-max objective. For both the symmetric and asymmetric problems, the proposed methods had average posteriori bounds less than 1.4, while LP rounding had bounds greater than 1.6. The worst a posteriori bounds of LP rounding were larger than two for all sizes, while those for the proposed heuristics were less than two.

The average and worst computation times of cost-symmetric and cost-asymmetric cases are summarized in Table 2 and Table 3, respectively. In both tables, there exists a huge gap in the computation time between the two algorithms, especially for large-sized problems. For example, the LP rounding method required average of 39,891.46 s, i.e., longer than 11 h, while the proposed heuristic takes approximately 20 s to solve the cost-symmetric problems of 80 targets. As presented in blue and red in Table 2 and Table 3, the average computation time was decreased to $0.0005\%$ and $0.001\%$ compare to the LP rounding method for the symmetric and asymmetric cases of 80 targets, respectively, while maintaining better average solution qualities. Therefore, the proposed heuristics are better suitable for applications that require good approximate solutions within a short period of time to increase profits.

6. Conclusions

In this research, we proposed heuristics based on a primal-dual technique for the job allocation and routing of a two-UV system with structural heterogeneity while minimizing the last job completion time. The formulations of MIP, LP, and dual problems were presented. Using the dual problems, the heuristics were designed to iteratively run primal-dual algorithms by varying the $W_k$ values, which implies the priority of kth vehicle. Through implementation, the effectiveness of our proposed algorithms has been shown.

Our heuristics have limitations for guarantees of worst solution quality, limited number of vehicles, and limited heterogeneity. However, we believe that our heuristics are a good original idea that can solve the min-max MDHTSP in a time-efficient manner while considering additional constraints that increase the complexity of the problem. As future work, we aim to solve the mim-max MDHTSP and min-max MDHATSP while considering both structural and functional heterogeneity with lighter computational loads.