Genetic algorithm for QoS partition and routing problem
用遗传算法求解最优QoS 划分与路由问题*

Future communication networks were expected to full support applications with quality of service(QoS) requirements. Optimal QoS partition problem was an optimal problem for QoS applications. The paper presented a novel genetic algorithm for the OPQR problem. This algorithm used K shortest pathes instead of global search of optimal paths. Simulation results proof the efficiency of this algorithm.