A Quantum Genetic Simulated Annealing Algorithm for Task Scheduling

Abstract

Based on quantum computing, a Quantum Genetic Simulated Annealing Algorithm (QGSAA) is proposed. With the condition of preserving Quantum Genetic Algorithm (QGA) advantages, QGSAA takes advantage of simulated annealing algorithm so as to avoid premature convergence. When the temperature in the process of cooling no longer falls, the result is the optimal solution on the whole. Comparing experiments have been conducted on task scheduling in grid computing. Experimental results have shown that QGSAA is superior to QGA and Genetic Algorithm (GA) on performance.