A Heuristic Approach to Satellite Range Scheduling With Bounds Using Lagrangian Relaxation

被引：20

作者：

Brown, Nathanael ^{[1
]}

Arguello, Bryan ^{[1
]}

Nozick, Linda ^{[2
]}

Xu, Ningxiong ^{[2
]}

机构：

[1] Sandia Natl Labs, Albuquerque, NM 87185 USA

[2] Sch Civil & Environm Engn, Ithaca, NY 14853 USA

来源：

IEEE SYSTEMS JOURNAL | 2018年 / 12卷 / 04期

关键词：

Decision support systems; heuristic algorithms; integer linear programing; optimal scheduling; satellites; SEARCH;

D O I：

10.1109/JSYST.2018.2821094

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper focuses on scheduling antennas to track satellites using a novel heuristic method. The objectives pursued in developing a schedule are twofold: 1) minimize the priority weighted number of time periods that satellites are not tracked, and 2) equalize the percentage of time each satellite is uncovered. The heuristic method is a population-based local search tailored to the unique characteristics of this problem. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The heuristic method and the bounds are applied to several test problems. In all cases, the heuristic identifies a solution that is better than the upper bound and is generally closer (but obviously larger) than the lower bound with about an order of magnitude reduction in computation time. Finally, a comparison with CPLEX 12.7 is provided.

引用

页码：3828 / 3836

页数：9

共 18 条

[1]

Alvarez A., 2010, INTRO OPTIMAL SATELL

[2]

[Anonymous], THESIS

[3]

Barbulescu L., 2002, Parallel Problem Solving from Nature - PPSN VII. 7th International Conference. Proceedings (Lecture Notes in Computer Science Vol.2439), P611

[4] Scheduling space-ground communications for the Air Force Satellite Control Network [J].