Balanced centroids (BC) k-means clustering algorithm to transform MTSP to TSP

P. Venkateswara Reddy, A.C.S. Kumar, M.S. Bhat, R. Dhanalakshmi and P. Parthiban

International Journal of Logistics Economics and Globalisation, 2010, vol. 2, issue 3, 187-197

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.

Keywords: multiple travelling salesperson; k-means; clustering algorithms; balanced centroids; tours; Euclidean mTSP; iterations; logistics management; economics. (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=36299 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injleg:v:2:y:2010:i:3:p:187-197

Access Statistics for this article

More articles in International Journal of Logistics Economics and Globalisation from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().