NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Finding fixed satellite service orbital allotments with a k-permutation algorithmA 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, has been developed to find solutions to SLPs. Solutions to small sample problems are presented and analyzed on the basis of calculated interferences.
Document ID
19900065896
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Reilly, Charles H.
(Ohio State Univ. Columbus, OH, United States)
Mount-Campbell, Clark A.
(Ohio State University Columbus, United States)
Gonsalvez, David J. A.
(GM Research Laboratories Warren, MI, United States)
Date Acquired
August 14, 2013
Publication Date
August 1, 1990
Publication Information
Publication: IEEE Transactions on Communications
Volume: 38
ISSN: 0090-6778
Subject Category
Communications And Radar
Accession Number
90A52951
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available