An exact and a metaheuristic method for optimum resource allocation in clashing...

An exact and a metaheuristic method for optimum resource allocation in clashing leo satellite visibility windows

SHARE

P. Soma1, A. G. Rao1, S. Venkateswarlu1, Shanthalakshmi1, Sanjay Kumar2, Sanjeev Swami2 and Tapan P. Bagchi2
1ISTRAC, Indian Space Research Organisation, Bangalore
2Indian Institute of Technology, Kanpur – 208 016

This paper addresses the allocation of ground station resources to passing LEO satellites that have different and arbitrarily defined value generation profile. Station support times for each passing satellite must be determined so as to maximize the total value generated. This problem is an extension of the classic product mix problem. The present approach exploits the special structure of the value or profit function and constraints to apply a new, exactly formulated solution method when that is possible. When the profit function has arbitrary shape and constraints do not possess special structure, the approach invokes new metaheuristic methods to determine the optimum allocation. The paper concludes with the solution of a practical ground support allocation problem for which solution methods currently do not exist.