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

Multiobjective Optimization of Cloud Manufacturing Service Composition with Improved Particle Swarm Optimization Algorithm

Author

Listed:
  • Yongxiang Li
  • Xifan Yao
  • Min Liu

Abstract

Aiming at the problems of low search efficiency and inaccurate optimization of existing service composition optimization methods, a new multiobjective optimization model of cloud manufacturing service composition was constructed, which took service matching degree, composition synergy degree, cloud entropy, execution time, and execution cost as optimization objectives, and an improved particle swarm optimization algorithm (IPSOA) was proposed. In the IPSOA, the integer encoding method was used for particle encoding. The inertia coefficient and two acceleration coefficients were improved by introducing the normal cloud model, sine function, and cosine function. The global search ability of IPSOA in the early stage was improved, and its prematurity was restrained to form a more comprehensive solution space. In the later stage, IPSOA focused on the local fine search and improved the optimization precision. Taking automatic guided forklift manufacturing task as an example, the correctness of the proposed multiobjective optimization model of cloud manufacturing service composition and the effectiveness of its solution algorithm were verified. The performance of IPSOA was analyzed and compared with standard genetic algorithm (SGA) and traditional particle swarm optimization (PSO). Under the same conditions, IPSOA had a faster convergence speed than PSO and SGA and had better performance than PSO.

Suggested Citation

  • Yongxiang Li & Xifan Yao & Min Liu, 2020. "Multiobjective Optimization of Cloud Manufacturing Service Composition with Improved Particle Swarm Optimization Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-17, October.
  • Handle: RePEc:hin:jnlmpe:9186023
    DOI: 10.1155/2020/9186023
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1155/2020/9186023?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:9186023. 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.