| Article ID: | iaor201523997 |
| Volume: | 38 |
| Issue: | 6 |
| Start Page Number: | 779 |
| End Page Number: | 797 |
| Publication Date: | Dec 1991 |
| Journal: | Naval Research Logistics (NRL) |
| Authors: | Mata Fernando, Reilly Charles H, Mount-Campbell Clark A, Walton Eric K, Aebker Eric A, Levis Curt A |
| Keywords: | space, scheduling |
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.