The GTOC9 competition requires the design of a sequence of missions to remove debris from the LEO orbit. A mission is a sequence of transfer of the spacecraft from one debris to another. Both missions and transfer must fulfill a set of constraints. The work presents the procedures to develop a solution for the GTOC9 problem (i.e the mission sequence) that does not violate constraints.The solution is obtained through an evolutionary algorithm that combines pre-computed basic missions stored in a database. The main objective of the algorithm is to minimize the overall cost of the solution, in order to maximize the competition score. The database of pre-computed missions is derived by connecting transfers stored in a database of transfers, through a combinatorial approach that considers the problem constraints. The database of transfer is formulated through the solution of a constrained minimization problem upon the control action (the magnitude of the overall impulsive velocity changes \(\Delta\)V ). Only a subset of all possible transfers (selected on the basis of acceptable \(\Delta\) V ), enters in the database.