Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8058158 | Aerospace Science and Technology | 2018 | 9 Pages |
Abstract
More than 90% of the space objects orbiting around the earth are space debris. Since the orbits of these debris often overlap the trajectories of spacecraft, they create a potential collision risk. The problem of removing the most dangerous space debris can be modeled as a biobjective time dependent traveling salesman problem (BiTDTSP). In this paper, we study an approach based on a branch and bound procedure to determine the Pareto frontier of the BiTDTSP.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Aerospace Engineering
Authors
Dalal Madakat, Jérôme Morio, Daniel Vanderpooten,