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
TypeArticle accepté pour publication ou publié
External document linkhttps://hal.archives-ouvertes.fr/hal-01706926
Journal nameAerospace Science and Technology
MetadataShow full item record
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 / KeywordsSpace debris; Biobjective time dependent traveling salesman problem; Pareto frontier; Fathoming rules
Showing items related by title and author.
Figueira, José; Paquete, Luis; Simoes, Marco; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem Belhoul, Lyes; Galand, Lucie; Vanderpooten, Daniel (2014) Article accepté pour publication ou publié