Abstract

Biology-inspired algorithms are computationally efficient for real-parameter optimization. However, the search efficiency of such algorithms depends significantly on their ability in keeping the balance between exploration and exploitation when solving complex multimodal problems. A new technique for generating potential solutions in biology-inspired algorithms is proposed. The stated technique uses a historical memory of successful positions found by individuals to guide them in different directions, thereby improving their exploration and exploitation abilities. Thus, this paper describes the application of modified biology-inspired algorithms, namely the Firefly Algorithm, the Cuckoo Search Algorithm and the Bat Algorithm to global trajectory optimization problems. The problems are provided by the European Space Agency and represent trajectories of several well-known spacecraft, such as Cassini and Messenger. Firstly, modified versions of the listed heuristics as well as their original variants were evaluated on a set of various test functions. Then their performance was evaluated on two global trajectory optimization problems: Cassini-1 and Messenger. The experimental results obtained by them are presented and compared. It was established that success-history based position adaptation allows better solutions to be found with the same computational effort while solving complex real-world problems. Thus, the usefulness of the proposed position adaptation technique was demonstrated.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.