IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-27744-8_7.html
   My bibliography  Save this book chapter

Constraint-Based Random Search for Solving Spacecraft Downlink Scheduling Problems

In: Multidisciplinary Scheduling: Theory and Applications

Author

Listed:
  • Angelo Oddi

    (ISTC-CNR Italian National Research Council)

  • Nicola Policella

    (ISTC-CNR Italian National Research Council)

  • Amedeo Cesta

    (ISTC-CNR Italian National Research Council)

  • Gabriella Cortellessa

    (ISTC-CNR Italian National Research Council)

Abstract

This paper introduces a combinatorial optimisation problem called the Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency programme Mars Express. The domain is characterized by complex constraints concerning bounded on-board memory capacities, limited communication windows over the downlink channels, deadlines and ready times imposed by the scientists using the spacecraft instruments. This paper lays out the problem and analyses its computational complexity showing that Mex-Mdp is NP-hard. Then the problem is modelled as a Constraint Satisfaction Problem and two different heuristic strategies for its solution are presented: a core greedy constraint-based procedure and an iterative sampling strategy based on random search. The algorithms are evaluated both against a benchmark set created on the basis of ESA documentation and a lower bound of the minimised objective function. Experimental results show the overall effectiveness of the approach.

Suggested Citation

  • Angelo Oddi & Nicola Policella & Amedeo Cesta & Gabriella Cortellessa, 2005. "Constraint-Based Random Search for Solving Spacecraft Downlink Scheduling Problems," Springer Books, in: Graham Kendall & Edmund K. Burke & Sanja Petrovic & Michel Gendreau (ed.), Multidisciplinary Scheduling: Theory and Applications, pages 133-160, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-27744-8_7
    DOI: 10.1007/0-387-27744-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-27744-8_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.