Practical Solution for n-TSP by Use of LCO

Abstract

N-TSP is a well-known problem, which belongs to a NP-hard problem class. It often appears in the truck delivery planning, the machine maintenance planning, and so. This paper proposes a new practical solution for n-TSP by use of LCO (Local Clustering Organization) and examines the effectiveness of the proposed method. In the proposed method, the newly developed clustering method is applied.