کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476575 1446011 2015 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Reconfiguration of satellite orbit for cooperative observation using variable-size multi-objective differential evolution
ترجمه فارسی عنوان
تنظیم مجدد مدار ماهواره ای برای مشاهده تعاونی با استفاده از تفاضل تکامل چند هدفه متغیر
کلمات کلیدی
مدار مجازی مدار ماهواره ای، بهینه سازی متغیر، تکامل تکاملی چند هدفه، محاسبات تکاملی، برآورد الگوریتم توزیع
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی


• A self-adaptive variable-size multi-objective DE for reconfiguration is proposed.
• The computations of coverage metrics, total fuel cost and maneuver time are detailed.
• Chromosome expression relies on fixed-length mechanism combined expression vector.
• Problem-specific operators are integrated into multi-objective DE.
• The algorithm optimizes the topology structure and component values simultaneously.

A novel self-adaptive variable-size multi-objective differential evolution algorithm is presented to find the best reconfiguration of existing on-orbit satellites for some particular targets on the ground when an emergent requirement arises in a short period. The main contribution of this study is that three coverage metrics are designed to assess the performance of the reconfiguration. Proposed algorithm utilizes the idea of fixed-length chromosome encoding scheme combined with expression vector and the modified initialization, mutation, crossover and selection operators to search for optimal reconfiguration structure. Multi-subpopulation diversity initialization is adopted first, then the mutation based on estimation of distribution algorithm and adaptive crossover operators are defined to manipulate variable-length chromosomes, and finally a new selection mechanism is employed to generate well-distributed individuals for the next generation. The proposed algorithm is applied to three characteristically different case studies, with the objective to improve the performance with respect to specified targets by minimizing fuel consumption and maneuver time. The results show that the algorithm can effectively find the approximate Pareto solutions under different topological structures. A comparative analysis demonstrates that the proposed algorithm outperforms two other related multi-objective evolutionary optimization algorithms in terms of quality, convergence and diversity metrics.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 242, Issue 1, 1 April 2015, Pages 10–20
نویسندگان
, , , , , ,