کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6903465 1446991 2018 35 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Priority-based and conflict-avoidance heuristics for multi-satellite scheduling
ترجمه فارسی عنوان
اکتشافات مقابله با اولویت و درگیری برای برنامه ریزی چند ماهواره
کلمات کلیدی
00-01، 99-00، ماهواره ها مشاهده ماهواره، برنامه ریزی، ابتکاری، تکامل دیفرانسیل، بهینه سازی،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
In this paper we address the problem of multi-satellite scheduling with limited observing ability. As with other computationally hard combinatorial optimization problems, a two-stage heuristic method is developed to obtain high quality solutions in a reasonable amount of computation time. The first stage involves the determination of an observing sequence and the generation of a feasible scheduling scheme. We propose several priority-based and conflict-avoidance heuristic strategies and develop the time-based greedy approaches, the weight-based greedy approaches, and an improved differential evolution (DE) algorithm. The second stage consists of further improvement strategies under different resource contentions, thus improving the scheduling results further. Finally, we design different classes of instances to test the efficiency and applicability of the methods. Computational results reveal that the new proposed methods routinely delivered very close to optimal solutions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 69, August 2018, Pages 177-191
نویسندگان
, , , ,