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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
