A Network Selection Algorithm Based on Improved Genetic Algorithm

Author(s):  
Juanmin Chen ◽  
Damin Zhang ◽  
Dong Liu ◽  
Zhiyan Pan
Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Weiwei Xiao

This article proposes an Analytic Hierarchy Process Dempster-Shafer (AHP-DS) and similarity-based network selection algorithm for the scenario of dynamic changes in user requirements and network environment; combines machine learning with network selection and proposes a decision tree-based network selection algorithm; combines multiattribute decision-making and genetic algorithm to propose a weighted Gray Relation Analysis (GRA) and genetic algorithm-based network access decision algorithm. Firstly, the training data is obtained from the collaborative algorithm, and it is used as the training set, and the network attributes are used as the attribute set, and the continuous attributes are discretized by dichotomization, and the attribute that can make the greatest information gain is selected as the division feature, and a decision tree with strong generalization ability is finally obtained, which is used as the decision basis for network access selection. The simulation results show that the algorithm proposed in this thesis can effectively improve user service quality under three services, and the algorithm is simple and effective with low complexity. It first uses AHP-DS hierarchical analysis to establish a recursive hierarchy for the network selection problem and obtains the subjective weights of network attributes through the judgment matrix. Then, it uses a genetic algorithm to adjust the subjective weight, defines the fitness function in the genetic algorithm-based on gray correlation analysis, adjusts the weights of the selection operator, crossover operator, and variation operator in the genetic algorithm, and gets the network with the largest fitness as the target network, which can effectively improve the user service quality.


Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


Sign in / Sign up

Export Citation Format

Share Document