Our DSS is based on a TS that satisfies all customer requests trying to optimally generate vehicles’ paths. The DSS starts by inputting problem parameters, namely the number of customers to be served, the number of available vehicles and the vehicles’ capacity. Once these data were provided, customer demands are to be set. Customers’ geographical coordinates are then extracted from the original distance matrix1 and reported in a sub-matrix. The TS approach proceeds iteratively by an alternative use of two neighborhoods in order to diversify the search. All TS parameters were set after a meta-tunning. Once the numerical solution is generated, the DSS moves to the design of the cartographical solution that well illustrates the real itinerary. Customers’ locations are then marked in the addressed area and vehicles’ pathways are highlighted.