Optimizing Network Planning by Using Improved Genetic Algorithm
Zhuang Hong-mian
Abstract
Zhuang Hong-mian
Abstract
The optimization for network planning by using genetic algorithm(GA) is a non-monotonic as well as deceitful problem,so it is difficult to obtaining a global optimization result.This paper researches the optimization for network planning by using improved genetic algorithm,and analyses a large number of actual computing results in database.The analysis indicates that improved genetic algorithm can obviously improve the successful probability of obtaining global optimization result.The research also shows that the dynamic adjustment of the fitness gains the best result.At last this paper offers a suitable parameter for this type problem.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The optimization for network planning by using genetic algorithm(GA) is a non-monotonic as well as deceitful problem,so it is difficult to obtaining a global optimization result.This paper researches the optimization for network planning by using improved genetic algorithm,and analyses a large number of actual computing results in database.The analysis indicates that improved genetic algorithm can obviously improve the successful probability of obtaining global optimization result.The research also shows that the dynamic adjustment of the fitness gains the best result.At last this paper offers a suitable parameter for this type problem.
Key concepts: Genetic algorithm, Computer science, Meta-optimization, Mathematical optimization, Optimization algorithm, Network planning and design, Population-based incremental learning, Optimization problem