Application of genetic algorithm to solving the optimization problem of locations graph vertices in the line

Supplementary Files

pdf

Keywords

genetic algorithm
optimization problem
location problem
graphs algorithms

How to Cite

Chiriac, L., Lupashco, N., & Pavel, M. (2024). Application of genetic algorithm to solving the optimization problem of locations graph vertices in the line. Acta Et Commentationes Exact and Natural Sciences, 2(16), 128-142. https://doi.org/10.36120/2587-3644.v2i16.128-142

Abstract

This article examines genetic algorithms that are built on the "survival of the fittest" principle enunciated by Charles Darwin. By applying genetic algorithms to solving optimization problems, it is not always possible to guarantee the determination of the global optimum in polynomial time. This fact does not occur because only brute force search methods allow us to find the global optimum. Instead the genetic algorithm allows selecting good decisions, in a reasonable time, compared to other well-known deterministic or heuristic search engine optimization algorithms. The authors of this article develop an algorithm of solving the optimization problem of locations graph vertices in the line.

https://doi.org/10.36120/2587-3644.v2i16.128-142
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.