In this paper, we combine the concepts of hypervolume, ant colony optimization and nondominated sorting to develop a novel multi-objective ant colony optimizer for global space trajectory optimization. In particular, this algorithm is first tested on three space trajectory bi-objective test problems: an Earth-Mars transfer, an Earth-Venus transfer and a bi-objective version of the Jupiter Icy Moons Explorer mission (the first largeclass mission of the European Space Agency's Cosmic Vision 2015-2025 programme). Finally, the algorithm is applied to a four-objectives low-thrust problem that describes the journey of a solar sail towards a polar orbit around the Sun. The results on both the test cases and the more complex problem are reported by comparing the novel algorithm performances with those of two popular multi-objective optimizers (i.e., a nondominated sorting genetic algorithm and a multi-objective evolutionary algorithm with decomposition) in terms of hypervolume metric. The numerical results of this study show that the multi-objective hypervolume-based ant colony optimization algorithm is not only competitive with the standard multi-objective algorithms when applied to the space trajectory test cases, but it can also provide better Pareto fronts in terms of hypervolume values when applied to the complex solar sailing mission.
Dyson spheres are hypothetical megastructures encircling stars in order to harvest most of their energy output. During the 11th edition of the GTOC challenge, participants were tasked with a complex trajectory planning related to the construction of a precursor Dyson structure, a heliocentric ring made of twelve stations. To this purpose, we developed several new approaches that synthesize techniques from machine learning, combinatorial optimization, planning and scheduling, and evolutionary optimization effectively integrated into a fully automated pipeline. These include a machine learned transfer time estimator, improving the established Edelbaum approximation and thus better informing a Lazy Race Tree Search to identify and collect asteroids with high arrival mass for the stations; a series of optimally-phased low-thrust transfers to all stations computed by indirect optimization techniques, exploiting the synodic periodicity of the system; and a modified Hungarian scheduling algorithm, which utilizes evolutionary techniques to arrange a mass-balanced arrival schedule out of all transfer possibilities. We describe the steps of our pipeline in detail with a special focus on how our approaches mutually benefit from each other.Lastly, we outline and analyze the final solution of our team, ACT&Friends, which ranked second at the GTOC 11 challenge.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.