The MTSP optimal model suited for local-cross repeat path

Although many people have paid attention to the conventional MTSP problem and doing research on it, its constraint condition ”only one travelling salesman can pass by in each city” suffered from many limitations in reality. On the basis of conventional MTSP model, this article promotes it in adding the ”material transportation capacity” constraint condition and builds a new MTSP material transportation optimal model permitting the existence of local-cross repeat path. We use lingo software to solve the problem combined with an example. The result indicates that the new optimal model accords with fact well. Another advantage of this new model can also avoid the cumbersome process of the GA (Genetic Algorithm) and it is much easier to operate for researchers. Meanwhile, we can bring in other variants and constraint conditions on the basis of this new model and extend to build other models suited for specific needs.