Time-window optimization for a constellation of earth observation satellite

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),...

Full description

Bibliographic Details
Main Author: Oberholzer, Christiaan Vermaak
Format: Others
Language:en
Published: 2009
Subjects:
Online Access:http://hdl.handle.net/10500/2706
id ndltd-netd.ac.za-oai-union.ndltd.org-unisa-oai-umkn-dsp01.int.unisa.ac.za-10500-2706
record_format oai_dc
spelling ndltd-netd.ac.za-oai-union.ndltd.org-unisa-oai-umkn-dsp01.int.unisa.ac.za-10500-27062016-04-16T04:08:02Z Time-window optimization for a constellation of earth observation satellite Oberholzer, Christiaan Vermaak Satellite scheduling Genetic algorithms Metaheuristics Simulated annealing Vehicle Routing Multiple time-windows Constellation of satellites Tabu search 621.3825 Artificial satellites-- Scheduling Remote sensing-- Mathematics Heuristic algorithms Artificial satellites-- Orbits-- Mathematical models Artificial satellites-- Orbits--Data processing Earth sciences-- Remote sensing 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 2009-10-21T09:44:54Z 2009-10-21T09:44:54Z 2009-02 Thesis http://hdl.handle.net/10500/2706 en 1 online resource (170 leaves)
collection NDLTD
language en
format Others
sources NDLTD
topic Satellite scheduling
Genetic algorithms
Metaheuristics
Simulated annealing
Vehicle Routing
Multiple time-windows
Constellation of satellites
Tabu search
621.3825
Artificial satellites-- Scheduling
Remote sensing-- Mathematics
Heuristic algorithms
Artificial satellites-- Orbits-- Mathematical models
Artificial satellites-- Orbits--Data processing
Earth sciences-- Remote sensing
spellingShingle Satellite scheduling
Genetic algorithms
Metaheuristics
Simulated annealing
Vehicle Routing
Multiple time-windows
Constellation of satellites
Tabu search
621.3825
Artificial satellites-- Scheduling
Remote sensing-- Mathematics
Heuristic algorithms
Artificial satellites-- Orbits-- Mathematical models
Artificial satellites-- Orbits--Data processing
Earth sciences-- Remote sensing
Oberholzer, Christiaan Vermaak
Time-window optimization for a constellation of earth observation satellite
description 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
author Oberholzer, Christiaan Vermaak
author_facet Oberholzer, Christiaan Vermaak
author_sort Oberholzer, Christiaan Vermaak
title Time-window optimization for a constellation of earth observation satellite
title_short Time-window optimization for a constellation of earth observation satellite
title_full Time-window optimization for a constellation of earth observation satellite
title_fullStr Time-window optimization for a constellation of earth observation satellite
title_full_unstemmed Time-window optimization for a constellation of earth observation satellite
title_sort time-window optimization for a constellation of earth observation satellite
publishDate 2009
url http://hdl.handle.net/10500/2706
work_keys_str_mv AT oberholzerchristiaanvermaak timewindowoptimizationforaconstellationofearthobservationsatellite
_version_ 1718224043373494272