为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。

To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.

youdao

利用该方法良好的收敛性，可以借助于电子计算机快速的构造目前已知的具有最大码率和最小解码时延的多天线复正交空时分组编码矩阵。

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.

youdao

与传统解码的算法不同，该算法无需在发送端进行信道相关矩阵的估计和预编码，降低了发送端的编码复杂度。

Compared to the traditional decoding algorithms, the proposed scheme is no need to estimate the correlation matrix of the channel and pre-code at the transmitter, and its coding complexity is reduced.

youdao