Showing 1 - 1 of 1
The multiple traveling salesperson problem (MTSP) involves scheduling m 1 salespersons to visit a set of n m locations. Thus, the n locations must be divided into m groups and arranged so that each salesperson has an ordered set of cities to visit. The grouping genetic algorithm (GGA) is a...
Persistent link: https://www.econbiz.de/10005033372