The colored traveling salesmen problem is a node routing with multiple salesmen, where the cities are divided into m exclusive city sets and one shared set. objective to minimize total distance of Hamiltonian circuits (routes) under following constraints: each be visited by corresponding salesman, while can any salesman. In this work, we present first grouping memetic algorithm for solving chal...