單一軌道上具傾斜觀測功能之衛星遙測取像排程問題
碩士 === 國立新竹教育大學 === 人資處數學教育碩士班 === 97 === This thesis presents the research and development of the remote imaging scheduling problem for single satellite with inclinable observation. The objective function of the scheduling problem of the satellite passing through the imaging area on single orbit to...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/54278903130348836935 |
id |
ndltd-TW-097NHCT5480022 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-097NHCT54800222016-05-04T04:26:30Z http://ndltd.ncl.edu.tw/handle/54278903130348836935 單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 賴致瑩 碩士 國立新竹教育大學 人資處數學教育碩士班 97 This thesis presents the research and development of the remote imaging scheduling problem for single satellite with inclinable observation. The objective function of the scheduling problem of the satellite passing through the imaging area on single orbit to take images between one consecutive imaging operation is to maximize the number of jobs. For the optimization problem which is NP-hard in computational complexity, classical dynamic programming is too time-consuming for optimal solutions. This thesis will develop a meta-heuristics method—Serial Algorithm. In the first place, schedule the jobs with EST, then connect sub-tour reversal and K-OPT serially to produce neighborhood solutions of different structure for searching toward other areas, and use the memory function of Tabu Search to compute repeatedly. In the end ,simulating the computation experience with computer, the numbers of improved samples using Serial Algorithm achieves 50%, and the average performance is better 10.32% and 8.91% than the one of sub-tour reversal and K-OPT when the number of total jobs is 50 and the λ(imaging area)is 1.6 .To sum up, Serial Algorithm is good at solving the remote imaging scheduling problem of the satellite. 游素珍 學位論文 ; thesis 66 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立新竹教育大學 === 人資處數學教育碩士班 === 97 === This thesis presents the research and development of the remote imaging scheduling problem for single satellite with inclinable observation. The objective function of the scheduling problem of the satellite passing through the imaging area on single orbit to take images between one consecutive imaging operation is to maximize the number of jobs. For the optimization problem which is NP-hard in computational complexity, classical dynamic programming is too time-consuming for optimal solutions. This thesis will develop a meta-heuristics method—Serial Algorithm. In the first place, schedule the jobs with EST, then connect sub-tour reversal and K-OPT serially to produce neighborhood solutions of different structure for searching toward other areas, and use the memory function of Tabu Search to compute repeatedly.
In the end ,simulating the computation experience with computer, the numbers of improved samples using Serial Algorithm achieves 50%, and the average performance is better 10.32% and 8.91% than the one of sub-tour reversal and K-OPT when the number of total jobs is 50 and the λ(imaging area)is 1.6 .To sum up, Serial Algorithm is good at solving the remote imaging scheduling problem of the satellite.
|
author2 |
游素珍 |
author_facet |
游素珍 賴致瑩 |
author |
賴致瑩 |
spellingShingle |
賴致瑩 單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
author_sort |
賴致瑩 |
title |
單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
title_short |
單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
title_full |
單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
title_fullStr |
單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
title_full_unstemmed |
單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
title_sort |
單一軌道上具傾斜觀測功能之衛星遙測取像排程問題 |
url |
http://ndltd.ncl.edu.tw/handle/54278903130348836935 |
work_keys_str_mv |
AT làizhìyíng dānyīguǐdàoshàngjùqīngxiéguāncègōngnéngzhīwèixīngyáocèqǔxiàngpáichéngwèntí |
_version_ |
1718259091798753280 |