Abstract
With application to the specific problem of multiple gravity assist trajectory design, a deterministic
search space pruning algorithm is developed that displays both polynomial time and space complexity.
This is shown empirically to achieve search space reductions of greater than six orders of
magnitude, thus reducing significantly the complexity of the subsequent optimisation.
Original language | English |
---|---|
Title of host publication | XXXVIdeg: Annual Conference, Italian Operations Research Society, AIRO 2005 |
Publication status | Published - 2005 |