IDEAS home Printed from https://ideas.repec.org/a/ids/ijscom/v1y2014i3p237-255.html
   My bibliography  Save this article

Modified shuffled frog leaping algorithm for simulation capability scheduling problem

Author

Listed:
  • Yingying Xiao
  • Li Bo Hu
  • Xudong Chai

Abstract

Based on the analysis of characteristics of simulation capability scheduling problem in cloud simulation platform, this paper gives its mathematical description and introduces a modified shuffled frog leaping (MSFL) algorithm to solve the above optimisation problem with multi-mode constraint. The MFSL introduces GA to code the feasible solution space. During the random execution of coding, decoding and mutation, it increases three layers of coding constraints including simulation capability, task logic and feasible mode, to ensure the randomness of the solving process in the controllable scope. Thus, it can reduce the search range of solution space, get rid of the meaningless illegal solution, and ultimately improve the convergence speed of the algorithm and avoid precocity.

Suggested Citation

  • Yingying Xiao & Li Bo Hu & Xudong Chai, 2014. "Modified shuffled frog leaping algorithm for simulation capability scheduling problem," International Journal of Service and Computing Oriented Manufacturing, Inderscience Enterprises Ltd, vol. 1(3), pages 237-255.
  • Handle: RePEc:ids:ijscom:v:1:y:2014:i:3:p:237-255
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=63995
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijscom:v:1:y:2014:i:3:p:237-255. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=376 .

    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.