I'm currently working on a research project to optimize the recovery of space debris. We have to recover 50 pieces of space debris with the minimum number of missions possible. The missions are sent in parallel, so there are no planning problems to worry about. Obviously, a piece of debris has to be in a mission, and several missions can't contain the same piece of debris.
We have all the code needed to calculate the energy that a mission can produce, taking into account the positions of the debris at time T and its orbital drift. However, we must respect certain constraints for these missions, delta V_max and delta T_max, which are respectively the maximum speed a mission can travel in km/s and the number of days a mission can last.
I've implemented algorithms such as ACO, Genetic, NSGA-2 and 3. I've also optimized the function that gives the minimum energy a mission can produce, thanks to the Branch-and-bound algorithm, which permutes the debris list more efficiently to find the permutation with the minimum energy.
Since I'm looking for algorithms with constraints, I'd like to ask you if you know of any, or if you have any papers or articles on algorithms that have worked on this type of problem.
P.S : Here is an example of my problem but without scheduling : https://sophia.estec.esa.int/gtoc_portal/wp-content/uploads/2017/05/gtoc9_problem_stmt.pdf