Picture 1 of 1

Stock photo

Optimizing Mean Mission Duration for Multiple-Payload Satellites.by Flory New<| - Picture 1 of 1

Optimizing Mean Mission Duration for Multiple-Payload Satellites by John A Flory (Paperback, 2012)

baham_books (2687637)

99.5% positive Feedback

Price:

£55.79

Free postage

Estimated delivery Sat, 26 Jul - Sat, 2 Aug

Returns:

30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

Author: John A. Flory ISBN 10: 1249594030. Used-like N : The book pretty much look like a new book. There will be no stains or markings on the book, the cover is clean and crisp, the book will look unread, the only marks there may be are slight bumping marks to the edges of the book where it may have been on a shelf previously.

About this product

Product Information

This thesis addresses the problem of optimally selecting and specifying satellite payloads for inclusion on a satellite bus to be launched into a constellation. The objective is to select and specify payloads so that the total lifetime utility of the constellation is maximized. The satellite bus is limited by nite power, weight, volume, and cost constraints. This problem is modeled as a classical knapsack prob- lem in one and multiple dimensions, and dynamic programming and binary integer programming formulations are provided to solve the problem. Due to the compu- tational complexity of the problem, the solution techniques include exact methods as well as four heuristic procedures including a greedy heuristic, two norm-based heuristics, and a simulated annealing heuristic. The performance of the exact and heuristic approaches is evaluated on the basis of solution quality and computation time by solving a series of notional and randomly-generated problem instances. The numerical results indicate that, when an exact solution is required for a moderately- sized constellation, the integer programming formulation is most reliable in solving the problem to optimality. However, if the problem size is very large, and near- optimal solutions are acceptable, then the simulated annealing algorithm performs best among the heuristic procedures.