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

Use Linear Weighted Genetic Algorithm to Optimize the Scheduling of Fog Computing Resources

Author

Listed:
  • Ruisheng Li
  • Zhihan Lv

Abstract

This paper establishes a mathematical model for the resource management and scheduling of the fog node cluster and establishes the optimization goals of delay, communication load, and service cost. According to the idea of genetic algorithm for single-objective optimization, this paper proposes a linear weighted genetic algorithm based on linear weighting. The optimization weight is established according to the user’s preference for the target. We normalize the optimization objective function and merge it into one target, and then we proceed with genetic manipulation to get a better solution. The experimental results show that when the user specifies the preference weight, the optimal solution can be obtained by the genetic algorithm based on linear weighting, and the algorithm execution efficiency is high. With the increase of the single-objective weight, the optimization effect of this objective is better. When the preference weight tends to be average, its overall optimization effect is not ideal. When the user does not specify the preference weight, a set of optimal solutions can be obtained through the improved nondominated sorting genetic algorithm with elite strategy. Compared with the traditional algorithm, in addition to the overall optimization effect of the target being better, the algorithm itself also has higher efficiency.

Suggested Citation

  • Ruisheng Li & Zhihan Lv, 2021. "Use Linear Weighted Genetic Algorithm to Optimize the Scheduling of Fog Computing Resources," Complexity, Hindawi, vol. 2021, pages 1-12, June.
  • Handle: RePEc:hin:complx:9527430
    DOI: 10.1155/2021/9527430
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9527430.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9527430.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/9527430?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:complx:9527430. 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.