Solving the Earth Observing Satellite Constellation Scheduling Problem by Branch-and-Price
Pei Wang () and
Gerhard Reinelt ()
Additional contact information
Pei Wang: University of Heidelberg
Gerhard Reinelt: University of Heidelberg
A chapter in Operations Research Proceedings 2010, 2011, pp 491-496 from Springer
Abstract:
Abstract An important economical issue for a space agency like China Center for Resource Satellite Data and Applications (CRESDA) is the optimization of the schedule of its earth observing satellites. The management of the constellation consists of selecting a feasible subset of requests and scheduling the observation activities of the satellites to acquire images as well as scheduling the download activities to transmit the images back to a set of ground stations, with the objective to maximize the summed rewards of the targets observed and image-downloaded. These selected and scheduled sequence of observations and downloads must comply with visibility time-windows, observing and downloading durations, satellite memory capacity, and minimum transition times between observations and downloads.
Keywords: Master Problem; Satellite Constellation; Partial Schedule; Memory Level; Late Start Time (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_78
Ordering information: This item can be ordered from
http://www.springer.com/9783642200090
DOI: 10.1007/978-3-642-20009-0_78
Access Statistics for this chapter
More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().