望远镜网络调度问题的非线性规划解法
An Integer Linear Programming Solution to the Telescope Network Scheduling Problem
摘要:
望远镜网络由于其比单一望远镜更高的资源利用率以及作为新的天文观测模式的推动者而越来越受到关注。然而,随着望远镜网络规模的增加,完全甚至半手动调度它们的可能性消失了。在早期的一篇论文中,通过保留形式主义的规范,向软件望远镜调度迈出了一步,通过使用保留形式主义,天文学家可以表达他们复杂的观测需求和偏好。在本文中,我们建立在这项工作。我们提出了一个解决方案的离散化版本的调度望远镜网络的问题。我们推导出一个可解的整数线性规划(ILP)模型的基础上保留形式主义。我们展示了验证其正确性的计算结果,并确认我们基于Gurobi的实现可以解决实际规模的问题。最后,我们扩展了ILP模型,也可以处理新的观察请求,可以指定使用更先进的复合保留形式主义。
英文摘要:
Telescope networks are gaining traction due to their promise of higher resource utilization than single telescopes and as enablers of novel astronomical observation modes. However, as telescope network sizes increase, the possibility of scheduling them completely or even semi-manually disappears. In an earlier paper, a step towards software telescope scheduling was made with the specification of the Reservation formalism, through the use of which astronomers can express their complex observation needs and preferences. In this paper we build on that work. We present a solution to the discretized version of the problem of scheduling a telescope network. We derive a solvable integer linear programming (ILP) model based on the Reservation formalism. We show computational results verifying its correctness, and confirm that our Gurobi-based implementation can address problems of realistic size. Finally, we extend the ILP model to also handle the novel observation requests that can be specified using the more advanced Compound Reservation formalism.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。