Optimization of Network Coding Resources Based on Improved Quantum Genetic Algorithm
The problem of network coding resource optimization with a known topological structure is NP-hard. Traditional quantum genetic algorithms have the disadvantages of slow convergence and difficulty in finding the optimal solution when dealing with this problem. To overcome these disadvantages, this pa...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
MDPI AG
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/54d6d0a3d15d46b7ac6dd08c951c43fd |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | The problem of network coding resource optimization with a known topological structure is NP-hard. Traditional quantum genetic algorithms have the disadvantages of slow convergence and difficulty in finding the optimal solution when dealing with this problem. To overcome these disadvantages, this paper proposes an adaptive quantum genetic algorithm based on the cooperative mutation of gene number and fitness (GNF-QGA). This GNF-QGA adopts the rotation angle adaptive adjustment mechanism. To avoid excessive illegal individuals, an illegal solution adjustment mechanism is added to the GNF-QGA. A solid demonstration was provided that the proposed algorithm has a fast convergence speed and good optimization capability when solving network coding resource optimization problems. |
|---|