Balanced centroids (BC) k-means clustering algorithm to transform MTSP to TSP Online publication date: Mon, 01-Nov-2010
by P. Venkateswara Reddy, A.C.S. Kumar, M.S. Bhat, R. Dhanalakshmi, P. Parthiban
International Journal of Logistics Economics and Globalisation (IJLEG), Vol. 2, No. 3, 2010
Abstract: Solving a multiple travelling salesperson (mTSP) is more difficult than solving a travelling salesperson. Although the TSP has received a great deal of attention, the research on the mTSP is limited. In the mTSP, the N cities must be partitioned into m tours, with each tour resulting in a TSP for one salesperson. The purpose of this paper is to review in brief the existing literature on the mTSP and to transform the most 'NP complete' problem to an ordinary TSP. We propose a technique to transform mTSP to TSP using BC k-means clustering. The methodology we mentioned here will be suitable for any type of Euclidean mTSP. The result shows that the number of iterations (NI) required to get the solution are less in BC k-means clustering in most of the cases.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Logistics Economics and Globalisation (IJLEG):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com