We consider the planning and scheduling problem of SAR constellations for the observation of the Earth. We define a simplified problem which only takes into account the most binding constraints of the real problem. We present a Lagrangean relaxation algorithm that provides upper bounds and we show that it can also be used to guide an existing heuristic algorithm to find better solutions to the real problem.
A mathematical programming algorithm for planning and scheduling an Earth observing SAR constellation / N. Bianchessi, G. Righini. ((Intervento presentato al 5. convegno International Workshop on Planning and Scheduling for Space tenutosi a Baltimore nel 2006.
A mathematical programming algorithm for planning and scheduling an Earth observing SAR constellation
N. BianchessiPrimo
;G. RighiniUltimo
2006
Abstract
We consider the planning and scheduling problem of SAR constellations for the observation of the Earth. We define a simplified problem which only takes into account the most binding constraints of the real problem. We present a Lagrangean relaxation algorithm that provides upper bounds and we show that it can also be used to guide an existing heuristic algorithm to find better solutions to the real problem.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.