A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM

Abstract

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 type of genetic algorithm (GA) designed particularly for grouping problems. It has been successfully applied to a variety of grouping problems. This paper focuses on the application of a GGA to solve the MTSP. Our GGA introduces a new chromosome representation to indicate which salesperson is assigned to each tour and the ordering of the cities within each tour. We compare our method to standard GAs that employ either the one-chromosome or two-chromosome representation for MTSP. This research demonstrates that our GGA with its new chromosome representation is capable of solving a variety of MTSP problems from the literature and can outperform the traditional encodings of previously published GA methods.