期刊
COMPUTERS & OPERATIONS RESEARCH
卷 85, 期 -, 页码 12-21出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2017.03.012
关键词
Optimization; Satellite range scheduling; Conflict resolution; Bounding
类别
资金
- National Natural Science Foundation of China [91646110, 91224007, 71332003]
As the number of daily satellite service requests increases, the satellite range scheduling problem becomes more intractable during the ground station operations management. The NP-complete problem involves scheduling satellite requests to ground station antennas within their time windows so that the profit from the scheduled requests is maximized. This paper analyzes various conflicts between satellite requests and then develops a conflict-resolution technique. The technique first builds an elite initial schedule using a prescheduling strategy and then improves the initial schedule using a rescheduling strategy in a subspace of feasible solutions. The main highlight of the technique is its dual functions of quickly generating a high-quality solution and providing a good bound. As shown in the experimental results from the actual data and more difficult random instances, the proposed technique is significantly better than the best-known heuristic. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据