A Lexi-Search Approach for Variant Mutiple Travelling Salesmen Problem

The multiple travelling salesmen problem (mTSP) is a generalization of the well-known travelling salesman problem (TSP), wheremore than one salesman is allowed to be used in the solution. More over, the characteristics of the mTSP seem more appropriate for real-lifeapplications, and it is also possible to extend the problem to a wide variety of vehicle routing problems (VRPs) by incorporating some additionalside constraints. Although there exists a wide body of the literature for the TSP and the VRP, the mTSP has not received the same amount ofattention. In this paper we develop an efficient Lexi-Search method for solving the multiple travelling salesmen problem. Although Lexi-Searchmethods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter. Themotivation of the calculation of the lower bounds is based on ideas frequently used in solving problems. Computationally, the algorithmextended the size of the problem and find better solution