Modified shuffled frog leaping algorithm for simulation capability scheduling problem Online publication date: Tue, 29-Jul-2014
by Yingying Xiao; Li Bo Hu; Xudong Chai
International Journal of Service and Computing Oriented Manufacturing (IJSCOM), Vol. 1, No. 3, 2014
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.
Online publication date: Tue, 29-Jul-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Service and Computing Oriented Manufacturing (IJSCOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com