Abstract
In order to improve the exploration ability of Quantum Evolutionary Algorithm (QEA) and helping the algorithm to escape from local optima, this paper proposes a novel operator which uses the history of search process during the previous iterations to lead the q-individuals toward better parts of the search space. In the proposed method, in each iteration the history of the solutions is stored in a set called the history set. The history of solutions contains some information about the fitness landscape and the structure of better and worse solutions. This paper proposes a new operator which exploits this information to make a figure about the backbone structure of the fitness landscape and lead the q-individuals to search better parts of the search space. The proposed algorithm is tested on Knapsack Problem, Trap Problem, Max-3-Sat Problem and 13 Numerical Benchmark functions. Experimental results show better performance for the proposed algorithm than the original version of QEA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wright, S.: The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In: Proc. 6th Congr. Genetics, vol. 1, p. 365 (1932)
Tavares, J., Pereira, F.B., Costa, E.: Multidimensional Knapsack Problem: A Fitness Landscape Analysis. IEEE Trans. on Sys., Man, and Cyb. Part BÂ 38(3)
Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Toward memetic algorithms, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, Tech. Rep. 790 (1989)
Moscato, P., Norman, M.G.: A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In: Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (eds.) Parallel Computing and Transputer Applications, pp. 177–186. IOS Press, Amsterdam (1992)
Qasem, M., Prugel-Bennett, A.: Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations. IEEE Trans. on Evol. Comp. 14(4) (August 2010)
Han, K., Kim, J.: Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Transactions on Evolutionary Computing 6(6) (2002)
Li, Y., Zhang, Y., Zhao, R., Jiao, L.: The immune quantum-inspired evolutionary algorithm. In: IEEE International Conference on Systems, Man and Cybernetics (2004)
Wang, Y., Feng, X.-Y., Huang, Y.-X., Zhou, W.-G., Liang, Y.-C., Zhou, C.-G.: A Novel Quantum Swarm Evolutionary Algorithm for Solving 0-1 Knapsack Problem. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3611, pp. 698–704. Springer, Heidelberg (2005)
Gao, H., Xu, G., Wang, Z.: A Novel Quantum Evolutionary Algorithm and Its Application. In: The Sixth IEEE World Congress on Intelligent Control and Automation (2006)
Yu, Y., Tian, Y., Yin, Z.: Hybrid Quantum Evolutionary Algorithms Based on Particle Swarm Theory. In: 1st IEEE Conference on Industrial Electronics and Applications (2006)
You, X., Liu, S., Shuai, D.: On Parallel Immune Quantum Evolutionary Algorithm Based on Learning Mechanism and Its Convergence. In: Jiao, L., Wang, L., Gao, X.-B., Liu, J., Wu, F. (eds.) ICNC 2006. LNCS, vol. 4221, pp. 903–912. Springer, Heidelberg (2006)
Cruz, D., Vellasco, A.V.A., Pacheco, M.M.B.: Quantum-Inspired Evolutionary Algorithm for Numerical Optimization. In: IEEE Congress on Evolutionary Computation (2006)
Feng, X.Y., Wang, Y., Ge, H.W., Zhou, C.G., Liang, Y.C.: Quantum-Inspired Evolutionary Algorithm for Travelling Salesman Problem. Computational Methods, 1363–1367 (2007)
Platelt, M.D., Schliebs, S., Kasabov, N.: A versatile quantum-inspired evolutionary algorithm. In: IEEE Congress on Evolutionary Computation (2007)
Hutsell, S.R., Greenwood, G.W.: Applying evolutionary techniques to quantum computing problems. In: IEEE Congress on Evolutionary Computation (2007)
Tayarani- N, M.-H., Akbarzadeh-T, M.-R.: A Cellular Structure and Diversity Preserving operator in Quantum Evolutionary Algorithms. In: IEEE World Conference on Computational Intelligence (2008)
Tayarani- N, M.-H., Akbarzadeh-T, M.-R.: A Sinusoid Size Ring Structure Quantum Evolutionary Algorithm. In: IEEE International Conference on Cybernetics and Intelligent Systems Robotics, Automation and Mechanics (2008)
Tayarani- N, M.-H., Akbarzadeh-T, M.-R.: Probabilistic Optimization Algorithms for Numerical Function Optimization Problems. In: IEEE International Conference on Cybernetics and Intelligent Systems Robotics, Automation and Mechanics (2008)
Tayarani- N, M.-H., Akbarzadeh-T, M.-R.: Magnetic Optimization Algorithm, A New Synthesis. In: IEEE World Conference on Computational Intelligence (2008)
Khorsand, A.-R., Akbarzadeh-T, M.-R.: Quantum Gate Optimization in a Meta-Level Genetic Quantum Algorithm. In: IEEE International Conference on Systems, Man and Cybernetics (2005)
Zhong, W., Liu, J., Xue, M., Jiao, L.: A Multi-agent Genetic Algorithm for Global Numerical Optimization. IEEE Trans. Sys., Man and Cyber. 34, 1128–1141 (2004)
Koumousis, V.K., Katsaras, C.P.: A Saw-Tooth Genetic Algorithm Combining the Effects of Variable Population Size and Reinitialization to Enhance Performance. IEEE Trans. Evol. Comput. 10, 19–28 (2006)
Han, K., Kim, J.: Quantum-Inspired Evolutionary Algorithms with a New Termination Criterion, H ε Gate, and Two-Phase Scheme. IEEE Trans. on Evolutionary Computation 8(2) (2004)
Zhong, W., Liu, J., Xue, M., Jiao, L.: A Multi-agent Genetic Algorithm for Global Numerical Optimization. IEEE Trans. Sys., Man and Cyber. 34, 1128–1141 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tayarani N., M.H., Beheshti, M., Sabet, J., Mobasher, M., Joneid, H. (2011). Improvement of the Performance of QEA Using the History of Search Process and Backbone Structure of Landscape. In: Pichappan, P., Ahmadi, H., Ariwa, E. (eds) Innovative Computing Technology. INCT 2011. Communications in Computer and Information Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27337-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-27337-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27336-0
Online ISBN: 978-3-642-27337-7
eBook Packages: Computer ScienceComputer Science (R0)