Thumbnail - No thumbnail

A biobjective branch and bound procedure for planning spatial missions

Madakat, Dalal; Morio, Jérôme; Vanderpooten, Daniel (2018), A biobjective branch and bound procedure for planning spatial missions, Aerospace Science and Technology, 73, p. 269-277. 10.1016/j.ast.2017.11.040

Type
Article accepté pour publication ou publié
External document link
https://hal.archives-ouvertes.fr/hal-01706926
Date
2018
Journal name
Aerospace Science and Technology
Volume
73
Pages
269-277
Publication identifier
Metadata
Show full item record
Author(s)
Madakat, Dalal
Morio, Jérôme cc
Vanderpooten, Daniel
Abstract (EN)
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.
Subjects / Keywords
Space debris; Biobjective time dependent traveling salesman problem; Pareto frontier; Fathoming rules