Table 2. Symbols and their definitions.

Symbol	Definition
G	Graph, G, composed of G(V, E)
V	All node and depot/s locations, each with a corresponding demand
$n$	Number of nodes
E	Edges between all nodes
D	Distance matrix between all V
$p$	$p\subset V$, set of depot/s and do not have a demand
$t(r_i)$	$t$([list of vertices]) returns the sum of the distance between the nodes in explicit order
$c(r_i)$	$c$([list of vertices]) returns the sum of the demand of all nodes in the route
$\tau$	Time constraint
$\psi$	Capacity constraint