Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
A Fair QoS Multicast Routing Scheme for IP/DWDM Optical Internet
ICDCSW '05 Proceedings of the Third International Workshop on Mobile Distributed Computing - Volume 06
Application of Quantum Genetic Algorithm on Finding Minimal Reduct
GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
Genetic algorithm for delay- and degree-constrained multimedia broadcasting on overlay networks
Computer Communications
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
QoS-driven multicast tree generation using Tabu search
Computer Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Quantum-inspired evolutionary algorithms: a survey and empirical study
Journal of Heuristics
Hi-index | 0.25 |
This paper investigates least-cost QoS multicast routing problem in IP/DWDM optical networks, and proposes an improved evolutionary algorithm (AEQEA). Based on quantum-inspired evolutionary algorithm (QEA) with quantum rotation gate strategy, AEQEA introduces adaptive evolution mechanism (AEM), which allows each chromosome in a population to update itself to a fitter position according to its own situation. In term of this mechanism, AEQEA can significantly improve its capability of exploration and exploitation, since every chromosome is able to be allocated with suitable evolutionary parameters before each update. A repair method is applied to eliminate illegal graphs as many as possible hence more excellent solutions will appear in each evolutionary generation. Simulations are carried out over a number of network topologies. And the results show that, for the QoS multicasting problem, AEQEA outperforms other existing heuristic algorithms and is characterized by robustness, high success ratio, fast convergence and excellent capability on global searching.