%0 Thesis %1 Oberholzer2009 %A Oberholzer, Christiaan V. %D 2009 %K *file-import-12-02-06 algorithms, annealing, constellation, earth, genetic, metaheuristics, multiple, observation, of, optimization, problem, routing, satellite, satellites, scheduling, search, simulated, tabu, time-window, time-windows, vehicle, %T Time-window optimization for a constellation of earth observation satellite %X 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 Time-windows, 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.

@mastersthesis{Oberholzer2009, abstract = {{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 Time-windows, 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.}}, added-at = {2012-03-02T03:39:18.000+0100}, author = {Oberholzer, Christiaan V.}, biburl = {https://www.bibsonomy.org/bibtex/28109975d023d722567ae7215ffe38d77/baby9992006}, citeulike-article-id = {10317921}, interhash = {83c8ceb15b4e6698db144ede155e6cfd}, intrahash = {8109975d023d722567ae7215ffe38d77}, keywords = {*file-import-12-02-06 algorithms, annealing, constellation, earth, genetic, metaheuristics, multiple, observation, of, optimization, problem, routing, satellite, satellites, scheduling, search, simulated, tabu, time-window, time-windows, vehicle,}, posted-at = {2012-02-06 13:49:58}, priority = {2}, school = {UNIVERSITY OF SOUTH AFRICA}, timestamp = {2012-03-02T03:39:25.000+0100}, title = {{Time-window optimization for a constellation of earth observation satellite}}, year = 2009 }