Distributed Multi-Depot Routing without Communications


We consider and formulate a class of distributed multi-depot routing problems, where servers are to visit a set of requests, with the aim of minimizing the total distance travelled by all servers. These problems fall into two categories: distributed offline routing problems where all the requests that need to be visited are known from the start; distributed… (More)


1 Figure or Table

Slides referencing similar topics