  Future missions to Enceladus would benefit from multi-moon tours that
leverage V-infinity on resonant orbits to progressively transfer between moons.
Such "resonance family hopping" trajectories present a vast search space for
global optimization due to the different combinations of available resonances
and flyby speeds. The proposed multi-objective tour design algorithm optimizes
entire moon tours from Titan to Enceladus via grid-based dynamic programming,
in which the computation time is significantly reduced by utilizing a database
of V-infinity-leveraging transfers. The result unveils a complete trade space
of the moon tour design to Enceladus in a tractable computation time and global
optimality.
