Article ID: | iaor20131413 |
Volume: | 84 |
Start Page Number: | 182 |
End Page Number: | 188 |
Publication Date: | Mar 2013 |
Journal: | Acta Astronautica |
Authors: | Vanderpooten Daniel, Morio Jrme, Madakat Dalal |
Keywords: | space, programming: branch and bound, combinatorial optimization |
The growth of the orbital debris population has been a concern to the international space community for several years. Recent studies have shown that the debris environment in Low Earth Orbit (LEO, defined as the region up to 2000km altitude) has reached a point where the debris population will continue to increase even if all future launches are suspended. As the orbits of these objects often overlap the trajectories of satellites, debris create a potential collision risk. However, several studies show that about 5 objects per year should be removed in order to keep the future LEO environment stable. In this article, we propose a biobjective time dependent traveling salesman problem (BiTDTSP) model for the problem of optimally removing debris and use a branch and bound approach to deal with it.