Constraint programming for planning test campaigns of communications satellites

01/23/2017
by   Emmanuel Hébrard, et al.
0

The payload of communications satellites must go through a series of tests to assert their ability to survive in space. Each test involves some equipment of the payload to be active, which has an impact on the temperature of the payload. Sequencing these tests in a way that ensures the thermal stability of the payload and minimizes the overall duration of the test campaign is a very important objective for satellite manufacturers. The problem can be decomposed in two sub-problems corresponding to two objectives: First, the number of distinct configurations necessary to run the tests must be minimized. This can be modeled as packing the tests into configurations, and we introduce a set of implied constraints to improve the lower bound of the model. Second, tests must be sequenced so that the number of times an equipment unit has to be switched on or off is minimized. We model this aspect using the constraint Switch, where a buffer with limited capacity represents the currently active equipment units, and we introduce an improvement of the propagation algorithm for this constraint. We then introduce a search strategy in which we sequentially solve the sub-problems (packing and sequencing). Experiments conducted on real and random instances show the respective interest of our contributions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2019

A Fast Scalable Heuristic for Bin Packing

In this paper we present a fast scalable heuristic for bin packing that ...
research
11/12/2019

Investigating Constraint Programming and Hybrid Methods for Real World Industrial Test Laboratory Scheduling

In this paper we deal with a complex real world scheduling problem close...
research
02/09/2019

Fast Approximation Schemes for Bin Packing

We present new approximation schemes for bin packing based on the follow...
research
04/10/2022

EPTAS for the dual of splittable bin packing with cardinality constraint

The problem considered is the splittable bin packing with cardinality co...
research
05/09/2019

Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories

Bin Packing with Conflicts (BPC) are problems in which items with compat...
research
01/13/2020

Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems

This work aims to study and explore the use of Gene Expression Programmi...

Please sign up or login with your details

Forgot password? Click here to reset