Spark-based distributed quantum-behaved particle swarm optimization algorithm

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

Abstract

For high dimensional and complex tasks, quantum optimization algorithms suffer from the problem of high computational cost. Distributed computing is an efficient way to solve such problems. Therefore, distributed optimization algorithms have become a hotspot for large scale optimization problems with the increasing volume of the data. In this paper, a novel Spark-based distributed quantum-behaved particle swarm optimization algorithm (SDQPSO) was proposed. By submitting the task to a higher computing cluster in parallel, the SDQPSO algorithm can improve the convergence performance.

Cite

CITATION STYLE

APA

Zhang, Z., Wang, W., Gao, N., & Zhao, Y. (2018). Spark-based distributed quantum-behaved particle swarm optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11151 LNCS, pp. 295–298). Springer Verlag. https://doi.org/10.1007/978-3-030-00560-3_42

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