• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
10.1016/j.ast.2017.11.040
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

Related items

Showing items related by title and author.

  • Thumbnail
    Biobjective planning of an active debris removal mission 
    Madakat, Dalal; Morio, Jérôme; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
  • Thumbnail
    Bi-objective matchings with the triangle inequality 
    Gourvès, Laurent; Monnot, Jérôme; Pascual, Fanny; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
  • Thumbnail
    Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem 
    Figueira, José; Paquete, Luis; Simoes, Marco; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
  • Thumbnail
    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é
  • Thumbnail
    Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks 
    Delavernhe, Florian; Rossi, André; Sevaux, Marc (2021) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo