Finding fixed satellite service orbital allotments with a k-permutation algorithm

Author

Reilly, Charles H. ; Gonsalvez, David J A ; Mount-Campbell, Clark A.

Author_Institution

Dept. of Ind. & Syst. Eng., Ohio State Univ., Columbus, OH, USA

Volume

38

Issue

8

fYear

1990

fDate

8/1/1990 12:00:00 AM

Firstpage

1253

Lastpage

1259

Abstract

A satellite system synthesis problem, the satellite location problem (SLP), is addressed. In SLP, orbital locations (longitudes) are allotted to geostationary satellites in the fixed satellite service. A linear mixed-integer programming model is presented that views SLP as a combination of two problems: the problem of ordering the satellites and the problem of locating the satellites given some ordering. A special-purpose heuristic procedure, a k-permutation algorithm, that has been developed to find solutions to SLPs formulated in the manner suggested is described. Solutions to small example problems are presented and analyzed on the basis of calculated interferences

Keywords

integer programming; linear programming; satellite relay systems; fixed satellite service; geostationary satellites; k-permutation algorithm; linear mixed-integer programming model; orbital allotments; satellite location problem; special-purpose heuristic procedure; Aggregates; Frequency selective surfaces; Interchannel interference; Interference constraints; Linear programming; Mathematical model; Mathematical programming; Orbital calculations; Satellite broadcasting; Satellite communication;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.58758

Filename

58758