A clustering approach to solve the multiple travelling salesmen problem
by Nishanth Chandran, T.T. Narendran, K. Ganesh
International Journal of Industrial and Systems Engineering (IJISE), Vol. 1, No. 3, 2006

Abstract: The multiple travelling salesmen problem (mTSP) involves scheduling m salespersons to visit a set of n nodes so that each node is visited exactly once while minimising the total distance travelled by the salespersons. The mTSP is a harder variant of the well-known travelling salesperson problem (TSP). A less-addressed criterion is the balancing of workloads amongst salespersons. In a departure from other methodologies that have been employed for this purpose, we propose a clustering approach to solve the mTSP. When tested over a range of data-sets, the proposed method is found to achieve a good balance of workloads among the clusters, each of which is visited by a salesperson.

Online publication date: Fri, 12-May-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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