IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5683698.html
   My bibliography  Save this article

Fuel-Efficient on-Orbit Service Vehicle Allocation Based on an Improved Discrete Particle Swarm Optimization Algorithm

Author

Listed:
  • Wu Jian
  • Liu Qingguo
  • Liu Xinxue
  • Li Yaxiong

Abstract

Given the limited fuel capacity of an on-orbit service vehicle (OSV), proper OSV allocation to satellites during each service mission is critical for economic fuel consumption. This allocation problem can be formulated as an optimization problem with many continuous and discrete design variables of wide domains. This problem can be effectively handled through the proposed approach that combines the tabu search with the discrete particle swarm optimization algorithm (DPSO-TS). First of all, Pontryagin’s minimum principle and genetic algorithm (GA) are exploited to find the most fuel-efficient transfer trajectory. This fuel efficiency maximization can then serve as the performance index of the OSV allocation optimization model problem. In particular, the maximization of the minimum residual fuel over individual OSVs is proposed as a performance index for OSV allocation optimization. The optimization problem is numerically solved through the proposed DPSO-TS algorithm. Finally, the simulation results demonstrate that the DPSO-TS algorithm has a higher accuracy compared to the DPSO, the DPSO-PDM and the DPSO-CSA algorithms in the premise that these four algorithms have the basically same computational time. The DPSO-TS algorithm can effectively solve the OSV allocation optimization problem.

Suggested Citation

  • Wu Jian & Liu Qingguo & Liu Xinxue & Li Yaxiong, 2020. "Fuel-Efficient on-Orbit Service Vehicle Allocation Based on an Improved Discrete Particle Swarm Optimization Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-14, April.
  • Handle: RePEc:hin:jnlmpe:5683698
    DOI: 10.1155/2020/5683698
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5683698.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/5683698.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/5683698?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:5683698. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.