Thesis (M.Com.(quantitative Management)) / Satellite Scheduling Problems (SSP) are NP-hard and constraint programming and
metaheuristics solution methods yield mixed results. This study investigates a new version of
the SSP, the Satellite Constellation Time-Window Optimization Problem (SCoTWOP),
involving commercial satellite constellations that provide frequent earth coverage.
The SCoTWOP is related to the dual of the Vehicle Routing Problem with Multiple Timewindows,
suggesting binary solution vectors representing an activation of time-windows.
This representation fitted well with the MatLab® Genetic Algorithm and Direct Search
Toolbox subsequently used to experiment with genetic algorithms, tabu search, and simulated
annealing as SCoTWOP solution methods. The genetic algorithm was most successful and in
some instances activated all 250 imaging time-windows, a number that is typical for a
constellation of six satellites. / Quantitative Management
| Identifer | oai:union.ndltd.org:netd.ac.za/oai:union.ndltd.org:unisa/oai:uir.unisa.ac.za:10500/2706 |
| Date | 02 1900 |
| Creators | Oberholzer, Christiaan Vermaak |
| Source Sets | South African National ETD Portal |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 1 online resource (170 leaves) |
Page generated in 0.0022 seconds