Title: Modified shuffled frog leaping algorithm for simulation capability scheduling problem

Authors: Yingying Xiao; Li Bo Hu; Xudong Chai

Addresses: School of Automation Science and Electrical Engineering, Beihang University, Beijing 100083, China ' Beijing Simulation Center, Beijing 100854, China ' Beijing Simulation Center, Beijing 100854, China

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.

DOI: 10.1504/IJSCOM.2014.063995

International Journal of Service and Computing Oriented Manufacturing, 2014 Vol.1 No.3, pp.237 - 255

Available online: 29 Jul 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article