The purpose of this thesis is to provide a new scheduling model of a large constellation of imaging satellites that does not use a heuristic solving method. The objective is to create a mixed-integer linear model that would be competitive in speed and in its closeness to reality against a current model using simulated annealing, while trying to improve both models. Each satellite has the choice between a number of possible events, each event having a utility and a cost, and the chosen schedule must take into account numerous time-related constraints. The main difficulties appeared in modeling realistically a battery level and in handling infeasible configurations due to inaccurate parameters. The obtained linear model has enabled a better understanding of the performance of the simulated annealing solver, and could also be adapted to different real-world scheduling problems.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-179300 |
| Date | January 2015 |
| Creators | Monmousseau, Philippe |
| Publisher | KTH, Optimeringslära och systemteori |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | TRITA-MAT-E ; 2015:87 |
Page generated in 0.0027 seconds