Solving orbit maintenance problems by the synthesis of evolution algorithms and traditional optimization methods

Orbit maintenance problems are solved by the synthesis of the traditional penalty function method and evolution algorithms (EAs). A general method is presented for the n-time impulse problem of orbit maintenance. The algorithm is proved to be effective according to a simulation example which adjusts the semi-major axis with 3,4,5 impulse times.