GENETIC ALGORITHM AS A TOOL FOR SOLVING OPTIMISATION PROBLEMS
Yaroslav Pyrih, Mykhailo Klymash, Yuliia Pyrih et al. · Information and communication technologies electronic engineering · 2023
The article focuses on the peculiarities of using the genetic algorithm (GA) for solving optimization problems. It provides a classification of optimization problems and offers a detailed description of the structural elements of the GA and their role in solving the traveling salesman problem. To assess the impact of GA parameters on its effectiveness, a study on the influence of population size on the length of the traveling salesman's route is conducted. Based on the obtained results, it is shown that population size affects the route length, and the optimal population size for this problem is found to be 150. Using the tournament selection operator, the ordered crossover operator, and the inverse mutation operator, we obtained a salesman's route of 9271.735 km, which, based on the results presented in this paper, is optimal for visiting 29 cities.
Cited by 10 works. doi:10.23939/ictee2023.02.095 Open-access PDF
Authors
References
- DEAP
- Research of Genetic Algorithms for Increasing the Efficiency of Data Routing
- Method for Estimating the Topological Structure of Self-Organized Networks
- Modified Genetic Based Algorithm for Load Balancing in Cloud Computing
- Genetic-Voronoi algorithm for coverage of IoT data collection networks
- Searching Extreme Paths Based on Travelling Salesman’s Problem for Wireless Emerging Networking
- Genetic Algorithm Based Clustering Techniques in Wireless Sensor Networks: A Comprehensive Study
- Research on TSP Solution Based on Genetic Algorithm
- A Review of the Genetic Algorithm and JAYA Algorithm Applications