Modified shuffled frog leaping algorithm for simulation capability scheduling problem

Yingying Xiao, Xudong Chai, Li Bo Hu, Chen Yang, Tingyu Lin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 algorithm (MSFL) to solve the above optimization 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.

Original languageEnglish
Title of host publicationAsiaSim 2013 - 13th International Conference on Systems Simulation, Proceedings
PublisherSpringer Verlag
Pages71-81
Number of pages11
ISBN (Print)9783642450365
DOIs
Publication statusPublished - 2013
Externally publishedYes
Event13th International Conference on Systems Simulation, AsiaSim 2013 - , Singapore
Duration: 6 Nov 20138 Nov 2013

Publication series

NameCommunications in Computer and Information Science
Volume402
ISSN (Print)1865-0929

Conference

Conference13th International Conference on Systems Simulation, AsiaSim 2013
Country/TerritorySingapore
Period6/11/138/11/13

Keywords

  • Cloud simulation
  • Constraint model
  • Modified shuffled frog leaping algorithm
  • Simulation capability scheduling

Fingerprint

Dive into the research topics of 'Modified shuffled frog leaping algorithm for simulation capability scheduling problem'. Together they form a unique fingerprint.

Cite this