Carter, Arthur E.; Ragsdale, Cliff T. - In: European Journal of Operational Research 194 (2009) 1, pp. 114-126
The traveling salesman problem is a classic NP-hard problem used to model many production and scheduling problems. The problem becomes even more difficult when additional salesmen are added to create a multiple traveling salesman problem (MTSP). We consider a variation of this problem where one...