利用TSP问题特点，提出了动态分组算法求TSP问题。

The paper proposes a dynamic grouping algorithm for TSP.

youdao

仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。

Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in AD hoc networks.

youdao

仿真表明，该算法可以动态调整网络路由路径，使所选路径的平均分组时延与分组能量消耗乘积达到最小。

Simulation demonstrated that the algorithm could dynamic adjust the route which can make the product of packet delay and energy consumption of routing path to be minimization in AD hoc networks.

youdao