TandEM

TandEM is an interplanetary trajectory with multiple fly-bys. The transcription proposed here uses one deep-space manouvre per leg, and a launch with the rocket Atlas 501.

The global optimisation problems we propose draw inspiration from the work performed in April 2008 by the European Space Agency working group on mission analysis on the mission named TandEM. TandEM is an interplanetary mission aimed at reaching Titan and Enceladus (two moons of Saturn). The problems, written here as minimisation problems, are actually maximising the mass delivered to a high eccentricity final orbit. With respect to the other mgadsm problems proposed in these pages, the transcription of the TandEM problem is slightly different as it evaluates directly the spacecraft mass at departure, and then at the end, using an interpolation of the launcher capability table (declination and C3 vs mass). The fly-by sequence can be selected among a list of suggested ones. Each fly-by sequence creates a different problem instance. The wide bounds used are valid for all problem instances.

The code

1. MATLAB: use the function tandem.m and pass to it the MGADSMproblem variable contained in tandem.mat after having selected the correct sequence in MGADSMproblem.sequence
2. C++: call the function "double tandem(const std::vector & x, double& tof, const int sequence_[])" provided in the GTOPtoolbox.
3. C++ (PaGMO): use the class pagmo::problem::tandem
4. Python 2.7 (PyGMO): use PyGMO.problem.tandem(prob_id,tof_c).obj_fun(x) to minimize -log(m_final)

Problems Description

We propose two sets of 25 different instances:

1. Unconstrained continuous optimisation (solutions database)
2. Constrained continuous optimisation (solutions database) : A constraint on the total mission duration is considered: x(5)+x(6)+x(7)+x(8) < 3652.5. [In the C++ code c_ineq (output of the tandem function) needs to be negative]

Box bounds

The box bounds on each of the decision vector variables are given below.