  This paper proposes a formulation of the Active Debris Removal (ADR) Mission
Design problem as a modified Time-Dependent Traveling Salesman Problem (TDTSP).
The TDTSP is a well-known combinatorial optimization problem, whose solution is
the cheapest mono-cyclic tour connecting a number of non-stationary cities in a
map. The problem is tackled with an optimization procedure based on Simulated
Annealing, that efficiently exploits a natural encoding and a careful choice of
mutation operators. The developed algorithm is used to simultaneously optimize
the targets sequence and the rendezvous epochs of an impulsive ADR mission.
Numerical results are presented for sets comprising up to 20 targets.
