Research of Photo-reconnaissance Satellite SchedulingProblem with Variable Profit of Activity
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The characteristic that observation activity has variable profit in satellite scheduling is analyzed, and the upper bound and lower bound of profit of activity are discussed. An advanced tabu search algorithm with local derivational is proposed. A mechanism with layered variable evaluating functions is used in the proposed tabu search algorithm, which leads the procedure of searching solution to multiobjective optimization, and both raises the rate of coverage and reduces the consumption of energy. The result of practical example demonstrates that the algorithm proposed in this paper can be applied to the satellites scheduling problem with variable profit of activity effectively.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 19,2005
  • Revised:
  • Adopted:
  • Online: March 14,2013
  • Published:
Article QR Code