Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 3161069, 11 pages
http://dx.doi.org/10.1155/2016/3161069
Research Article

Dynamic Relay Satellite Scheduling Based on ABC-TOPSIS Algorithm

1School of Electronics and Information Engineering, Harbin Institute of Technology, Harbin 150001, China
2Institute of Telecommunication Satellite, China Academy of Space Technology, Beijing 100000, China

Received 22 June 2016; Revised 1 October 2016; Accepted 16 October 2016

Academic Editor: Erik Cuevas

Copyright © 2016 Shufeng Zhuang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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.