A novel evolutionary algorithm for multi-constrained path selection

For the problem of multi-constrained path selection, a novel evolutionary algorithm named MCP_EA is proposed. Firstly, a novel coding technology named PNNC (Preceding Natural Number Coding, PNNC) is designed, and no circle exists on the path coded by PNNC. Secondly, a novel crossover operator called DCC operator (Dispersing Connection Crossover operator, DCC operator) is designed to guarantee the validity of the crossed paths and the diversity of the population. Thirdly, a novel mutation operator named selective mutation operator is proposed. Finally, the theoretical analysis proves that the algorithm converges to the satisfactory solution with probability 1.0. Extensive simulations show that the novel evolutionary algorithm outperforms the H_MCOP in performance for the problem, and is a promising algorithm for the problem with high performance.

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  Cui Yong.  Research on Internetwork QoS Routing Algorithms: a Survey , 2002 .

[3]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[4]  Zhigang Cao,et al.  Quality of Service Routing: Problems and Solutions , 2003 .

[5]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Marta M. B. Pascoal,et al.  A new implementation of Yen’s ranking loopless paths algorithm , 2003, 4OR.

[7]  Ke Xu,et al.  Precomputation for multiconstrained QoS routing in high-speed networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.