Comparison of optimization methods for computing bi-impulsive transfer trajectories in the bi-circular restricted four-body problem

Optimization is a crucial process in astrodynamics, focused on finding the most efficient trajectories with minimum cost, especially in terms of total velocity change ( Δ V ). The inherent complexity of orbital mechanics, particularly in multi-body systems and for long-duration transfers, often limits the effectiveness of traditional gradient-based methods, such as Non-Linear Programming (NLP), which are highly dependent on a high-quality initial guess. To overcome this limitation, meta-heuristic methods, which are robust and gradient-independent, are presented as a viable alternative. The present work evaluates the performance and efficiency of several single-objective meta-heuristic algorithms in the optimization of bi-impulsive transfer trajectories, starting from a Low Earth Orbit (LEO) at 200 km altitude toward retrograde co-orbital resonance using the Planar Restricted Bi-Circular Four-Body Problem (PBCR4BP). A comprehensive comparison was conducted using methods such as variants of Differential Evolution (DE), the Evolutionary Centers Algorithm (ECA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and Re-sampled Inheritance Search (RIS) and others, comparing them against a Random Search (RAS) baseline. The results demonstrated that Differential Evolution (DE) based methods, notably the DE/rand/1/bin RL and AD-DE/rand/1/bin RL variants, achieved the best overall performance, effectively minimizing both the required Δ V and the computational time. Furthermore, the robust optimization strategy successfully identified more efficient solutions than previously reported in the literature, achieving a minimum Δ V of 0.1478 km/s. We conclude that meta-heuristic methods, particularly the advanced variants of Differential Evolution, are powerful, reliable, and efficient tools for optimizing transfer trajectories in the complex dynamic environment of the PBCR4BP. However, the sensitivity analysis indicated that long-duration transfers can be highly sensitive to small perturbations, especially for eccentric target orbits near Earth. • PBCR4BP metaheuristics identified new efficient transfers to retrograde MMR. • DE variants showed superior performance in optimizing transfers trajectories. • DE/rand/1/bin RL and AD-DE proved most efficient for bi-impulsive maneuvers.

Authors

Institutions

Publication Details

Journal
Planetary and Space Science
Published
2026-02-01
DOI
https://doi.org/10.1016/j.pss.2026.106245
Primary Topic
Spacecraft Dynamics and Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparison of optimization methods for computing bi-impulsive transfer trajectories in the bi-circular restricted four-body problem

G.A. Caritá, A.F.B.A. Prado, S. Aljbaae, M.H.M. Morais
Planetary and Space Science
Spacecraft Dynamics and Control
article

Comparison of optimization methods for computing bi-impulsive transfer trajectories in the bi-circular restricted four-body problem

G.A. Caritá, A.F.B.A. Prado, S. Aljbaae, M.H.M. Morais
article en

Abstract

Optimization is a crucial process in astrodynamics, focused on finding the most efficient trajectories with minimum cost, especially in terms of total velocity change ( Δ V ). The inherent complexity of orbital mechanics, particularly in multi-body systems and for long-duration transfers, often limits the effectiveness of traditional gradient-based methods, such as Non-Linear Programming (NLP), which are highly dependent on a high-quality initial guess. To overcome this limitation, meta-heuristic methods, which are robust and gradient-independent, are presented as a viable alternative. The present work evaluates the performance and efficiency of several single-objective meta-heuristic algorithms in the optimization of bi-impulsive transfer trajectories, starting from a Low Earth Orbit (LEO) at 200 km altitude toward retrograde co-orbital resonance using the Planar Restricted Bi-Circular Four-Body Problem (PBCR4BP). A comprehensive comparison was conducted using methods such as variants of Differential Evolution (DE), the Evolutionary Centers Algorithm (ECA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), and Re-sampled Inheritance Search (RIS) and others, comparing them against a Random Search (RAS) baseline. The results demonstrated that Differential Evolution (DE) based methods, notably the DE/rand/1/bin RL and AD-DE/rand/1/bin RL variants, achieved the best overall performance, effectively minimizing both the required Δ V and the computational time. Furthermore, the robust optimization strategy successfully identified more efficient solutions than previously reported in the literature, achieving a minimum Δ V of 0.1478 km/s. We conclude that meta-heuristic methods, particularly the advanced variants of Differential Evolution, are powerful, reliable, and efficient tools for optimizing transfer trajectories in the complex dynamic environment of the PBCR4BP. However, the sensitivity analysis indicated that long-duration transfers can be highly sensitive to small perturbations, especially for eccentric target orbits near Earth. • PBCR4BP metaheuristics identified new efficient transfers to retrograde MMR. • DE variants showed superior performance in optimizing transfers trajectories. • DE/rand/1/bin RL and AD-DE proved most efficient for bi-impulsive maneuvers.

Planetary and Space ScienceVol. 271
University of Atacama (CL), Instituto Nacional de Pesquisas Espaciais (BR), Universidade Estadual Paulista (Unesp) (BR)
Openalex Percentile: Top 63%
Spacecraft Dynamics and Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.