Modified shuffled frog leaping algorithm for simulation capability scheduling problem

Yingying Xiao, Li Bo Hu and Xudong Chai

International Journal of Service and Computing Oriented Manufacturing, 2014, vol. 1, issue 3, 237-255

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.

Keywords: modified SFL; shuffled frog leaping algorithm; cloud simulation; simulation capability scheduling; constraint modelling; cloud computing; optimisation. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=63995 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijscom:v:1:y:2014:i:3:p:237-255

Access Statistics for this article

More articles in International Journal of Service and Computing Oriented Manufacturing from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().