%0 Journal Article
	%A Diogo Silva and  Fadul Rodor and  Carlos Moraes
	%D 2018
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 137, 2018
	%T Particle Swarm Optimization and Quantum Particle Swarm Optimization to Multidimensional Function Approximation
	%U https://publications.waset.org/pdf/10008997
	%V 137
	%X This work compares the results of multidimensional
function approximation using two algorithms: the classical Particle
Swarm Optimization (PSO) and the Quantum Particle Swarm
Optimization (QPSO). These algorithms were both tested on three
functions - The Rosenbrock, the Rastrigin, and the sphere functions
- with different characteristics by increasing their number of
dimensions. As a result, this study shows that the higher the function
space, i.e. the larger the function dimension, the more evident the
advantages of using the QPSO method compared to the PSO method
in terms of performance and number of necessary iterations to reach
the stop criterion.
	%P 293 - 301