An Application of a Traveling Salesman Problem with Independent Clusters for Cash-Collection Routing

Motivated by a routing problem faced by banks to enhance their encashment services in the  city of Perm, Russia, we solve versions of the traveling salesman problem with clustering. To minimize the risk of theft, suppliers seek to operate multiple vehicles and determine an efficient routing; and, a single vehicle serves a set of locations that … Read more