Abstract
Quantum-behaved particle swarm optimization (short in QPSO) is an improved version of particle swarm particle (short in PSO), and the performance is superior. But for now, it may not always satisfy the situations. Nowadays, problems become larger and more complex, most serial optimization algorithms cannot deal with the problem or need plenty of computing cost. In this paper, we implement QPSO on MapReduce model, propose MapReduce quantum-behaved particle swarm optimization (short in MRQPSO), and realize QPSO parallel and distributed, which the MapReduce model is a parallel computing programming model. In the experiments, the test results show that MRQPSO is more advanced both on performance of solution and time than QPSO.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gong, Y., Chen, W., Zhan, Z., Zhang, J., Li, Y., Zhang, Q., Li, J.: Distributed evolutionary algorithms, their models: a survey of the state-of-the-art. Appl. Soft Comput. 34, 286–300 (2015)
Umbarkar, A., Joshi, M.: Review of parallel genetic algorithm based on computing paradigm and diversity in search space. ICTACT J. Soft Comput. 3, 615–622 (2013)
Johar, F.M., Azmin, F.A., Suaidi, M.K., Shibghatullah, A.S., Ahmad, B.H., Salleh, S.N., Aziz, M.Z.A.A., Md Shukor, M.: A review of genetic algorithms and parallel genetic algorithms on graphics processing unit (GPU). In: Proceedings of the 2013 IEEE International Conference on Control System, Computing and Engineering, 264–269 (2013)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Sun, J., Feng, B., Xu, W.B.: Particle swarm optimization with particles having quantum behavior. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 325–331 (2004)
Sun, J., Fang, W., Wu, X., Palade, V., Xu, W.: Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection. Evol. Comput. 20(3), 349–393 (2012)
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107–113 (2008)
McNabb, A.W., Monson, C.K., Seppi, K.D.: Parallel PSO using MapReduce. In: IEEE Congress on Evolutionary Computation (CEC), pp. 7–14 (2007)
Liang, J.J., Qu, B.Y., Suganthan, P.N., Hernndez-Daz, A.G.: Problem definitions and evaluation criteria for the cec 2013 special session on real-parameter optimization. Technical report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, January 2013
Acknowledgments
This work was supported by the National Natural Science Foundation of China (Nos. 61272279, 61272282, 61371201, and 61203303), the National Basic Research Program (973 Program) of China (No. 2013CB329402), the Program for Cheung Kong Scholars and Innovative Research Team in University (No. IRT-15R53), and the Fund for Foreign Scholars in University Research and Teaching Programs (the 111 Project) (No. B07048).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Li, Y., Chen, Z., Wang, Y., Jiao, L. (2016). Quantum-Behaved Particle Swarm Optimization Using MapReduce. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 682. Springer, Singapore. https://doi.org/10.1007/978-981-10-3614-9_22
Download citation
DOI: https://doi.org/10.1007/978-981-10-3614-9_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3613-2
Online ISBN: 978-981-10-3614-9
eBook Packages: Computer ScienceComputer Science (R0)