文章基本信息

标题：P – TSP Seasonal Constrained Model
本地全文：下载
作者：Vijayalakshmi R ; Gurava Raju P ; Sundara Murthy 等
期刊名称：International Journal of Engineering and Computer Science
印刷版ISSN：2319-7242
出版年度：2015
卷号：4
期号：11
页码：15055-15064
DOI：10.18535/Ijecs/v4i11.34
出版社：IJECS
摘要：The Multiple Travelling Salesman Problem (MTSP) is a generalization of the well-known TSP, where more than one salesman isallowed to be used in the solution. The characteristics of the MTSP seem more appropriate for real life applications. In this paper we study aproblem called P-TSP Seasonal Constrained Model. Let there are number of cities „n‟, the number of salesmen P, the third dimension isseason S. Let M be common cities, which is subset of n for the salesman. Each salesman has to start their tour from head quartersthat is city 1in first season only and at the end of the season 1 all the salesmen have to meet at a common city which is in „M‟ .Again they starts their tour from common city in next season and visit some more cities and at the end of season 2 each of themhave to meet at another common city which is in „M‟ like this they travel upto (r-1)th season . Finally in rth season all the salesmenhave to reach the head quarter city. All the salesman have to visit „n0‟ cities other than the cities of „M‟ that is n0< n-m. Theobjective is to complete p- tours in „r‟ seasons with minimum total cost/distance.
关键词：TSP Problem; Lexi-Search; Pattern Recognition Technique; Alphabet Table; Search Table