Premium
A two‐phase procedure for allotting geostationary orbital locations to communications satellites
Author(s) -
Reilly Charles H.,
MountCampbell Clark A.,
Mata Fernando,
Walton Eric K.,
Aebker Eric A.,
Levis Curt A.
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.3800380601
Subject(s) - geostationary orbit , computer science , heuristics , communications satellite , satellite , phase (matter) , algorithm , real time computing , aerospace engineering , physics , quantum mechanics , engineering , operating system
We consider the problem of allotting locations in the geostationary orbit to communication satellites, subject to angle of elevation and electromagnetic interference constraints. An optimization framework is used as a means of finding feasible allotment plans. Specifically, we present a two‐phase solution procedure for the satellite location problem (SLP). The objective in SLP is to allot geostationary orbital locations to satellites so as to minimize the sum of the absolute differences between the locations prescribed for the satellites and corresponding specified desired locations. We describe two heuristics, an ordering procedure and a k ‐permutation algorithm, that are used in tandem to find solutions to SLP. Solutions to a worldwide example problem with 183 satellites serving 208 service areas are summarized.