Investigating the performance of the genetic optimizer algorithm and the pyramids of Giza to solve the problem of designing a navigation satellite constellation

Satellite constellation is one of the fascinating topics of the world. Innovative optimization algorithms can be used to design satellite constellations. In this article, by defining genetic optimization algorithms and Giza pyramids, the problem of satellite navigation constellation design will be discussed. The number of ۲۴ satellites are considered at a fixed height of ۱۲۰۰ km, then by stating the access restrictions of four satellites and the curvature of the earth and the geometric dilution of precision (GDOP), a massive optimization problem with ۷۲ variables is designed so that the maximum possible time to satisfy the restrictions in ۲۴ hours be obtained Genetic optimization algorithms and Giza pyramids will compete to solve this optimization problem. In the same number of generations and the same constraints to solve the problem, it is clear that the Giza pyramids optimizer algorithm has found a better optimal point than the genetic algorithm and its time was ۲۲۲۰ seconds. On the other hand, the simulation time of the Giza pyramids algorithm was longer and it could not make any leaps in the same number of generations and it was able to perform better only because of the correct initial guess it made. The navigation constellation designed for the Lisbon area can achieve ۲۵% of ۲۴ Satisfy the clock according to the mentioned restrictions.