Dynamic Relay Satellite Scheduling Based on ABC-TOPSIS Algorithm. (9th November 2016)

• Record Type: Journal Article
• Authors: Zhuang, Shufeng; Yin, Zhendong; Wu, Zhilu; Chen, Xiaoguang
• Other Names: Cuevas Erik Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2016(2016)
• Publication Date: 2016-11-09
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2016/3161069
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : Tracking and Data Relay Satellite System (TDRSS) is a space-based telemetry, tracking, and command system, which represents a research field of the international communication. The issue of the dynamic relay satellite scheduling, which focuses on assigning time resource to user tasks, has been an important concern in the TDRSS system. In this paper, the focus of study is on the dynamic relay satellite scheduling, whose detailed process consists of two steps: the initial relay satellite scheduling and the selection of dynamic scheduling schemes. To solve the dynamic scheduling problem, a new scheduling algorithm ABC-TOPSIS is proposed, which combines artificial bee colony (ABC) and technique for order preference by similarity to ideal solution (TOPSIS). The artificial bee colony algorithm is performed to solve the initial relay satellite scheduling. In addition, the technique for order preference by similarity to ideal solution is adopted for the selection of dynamic scheduling schemes. Plenty of simulation results are presented. The simulation results demonstrate that the proposed method provides better performance in solving the dynamic relay satellite scheduling problem in the TDRSS system.