This paper treats of a generalization of the Traveling Salesman Problem (TSP) called Multi-commodity one-to-one Pickup-and-Delivery Traveling Salesman Problem (m-PDTSP) in which cities corresponds to customers providing or requiring known amounts of m different objects, and the vehicle has a given upper-limit capacity. Each object has exactly one origin and one destination, and the vehicle must...
