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...

A CAD-guided vision sensor planning system is developed in our lab. To improve the efficiency of the inspection system, the path planning problem is rendered as a Traveling Salesman Problem(TSP). A new approach is developed to solve the TSP into its suboptimality quickly. First, viewpoints are clustered into several groups. Second, clustered Traveling Salesman Problem is solved by favoring the ...