提出了應(yīng)用于QoS路由選擇的一種新遺傳算法，該算法給出了基于跳數(shù)優(yōu)先原則的初始種群生成辦法，以及鄰近交叉和前向變異兩個(gè)關(guān)鍵算子。算法的主要優(yōu)點(diǎn)表現(xiàn)為初始種群生成獨(dú)立于網(wǎng)絡(luò)拓?fù)涞亩攘?a target='_blank' class='arckwlink_none'>參數(shù)，交叉產(chǎn)生了多樣性新個(gè)體，以及變異有效抑制算法退化等。對隨機(jī)生成的不同規(guī)模的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)進(jìn)行仿真，結(jié)果表明該算法是有效的。The most problems of multi-constrained QoS routing are NP-completeness. In this paper, a novel genetic algorithm is given which is applied to QoS routing. The principle of hop-prior is presented to generate an initial population. Simultaneously, two operators of vicinity crossover and forward mutation are brought forward. The primary advantages of this algorithm are shown as below: the population initialization is independent on the metrics in a network, the new personals born of crossover are diversified, and mutation depresses the algorithm devolutions effectively. At last, the simulations on differ-scale networks randomly created demonstrate that this algorithm is effective.