CGA: Chaotic Genetic Algorithm for fuzzy job scheduling in grid environment

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce a Chaotic Genetic Algorithm (CGA) to schedule Grid jobs with uncertainties. We adopt a Fuzzy Set based Execution Time (FSET) model to describe uncertain operation time and flexible deadline of Grid jobs. We incorporate chaos into standard Genetic Algorithm (GA) by logistic function, a simple equation involving chaos. A distinguishing feature of our approach is that the convergence of CGA can be controlled automatically by the three famous characteristics of logistic function: convergent, bifurcating, and chaotic. Following this idea, we propose a chaotic mutation operator based on the feedback of fitness function that ameliorates GA, in terms of convergent speed and stability. We present an entropy based metrics to evaluate the performance of CGA. Experimental results illustrate the efficiency and stability of the resulting algorithm. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Liu, D., & Cao, Y. (2007). CGA: Chaotic Genetic Algorithm for fuzzy job scheduling in grid environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 133–143). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free