To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decodingmethod with matrix are proposed.
为了解决最小化旅行时间的多旅行商一类问题,提出了一种递阶遗传算法和矩阵解码方法。
2
By the convergence of the method, we can fast construct a COSTBC matrix with the maximal rates and the minimal decoding delays that we all know now recur to the computer.