A novel distributed quantum-behaved particle swarm optimization (Q1659270)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A novel distributed quantum-behaved particle swarm optimization |
scientific article; zbMATH DE number 6918426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel distributed quantum-behaved particle swarm optimization |
scientific article; zbMATH DE number 6918426 |
Statements
A novel distributed quantum-behaved particle swarm optimization (English)
0 references
15 August 2018
0 references
Summary: Quantum-behaved particle swarm optimization (QPSO) is an improved version of particle swarm optimization (PSO) and has shown superior performance on many optimization problems. But for now, it may not always satisfy the situations. Nowadays, problems become larger and more complex, and most serial optimization algorithms cannot deal with the problem or need plenty of computing cost. Fortunately, as an effective model in dealing with problems with big data which need huge computation, MapReduce has been widely used in many areas. In this paper, we implement QPSO on MapReduce model and propose MapReduce quantum-behaved particle swarm optimization (MRQPSO) which achieves parallel and distributed QPSO. Comparisons are made between MRQPSO and QPSO on some test problems and nonlinear equation systems. The results show that MRQPSO could complete computing task with less time. Meanwhile, from the view of optimization performance, MRQPSO outperforms QPSO in many cases.
0 references
quantum-behaved particle swarm optimization, big data
0 references