Next Article in Journal
Fusing Thermopile Infrared Sensor Data for Single Component Activity Recognition within a Smart Environment
Next Article in Special Issue
Decision Making in Power Distribution System Reconfiguration by Blended Biased and Unbiased Weightage Method
Previous Article in Journal
Acknowledgement to Reviewers of Journal of Sensor and Actuator Networks in 2018
Article Menu
Issue 1 (March) cover image

Export Article

Open AccessArticle
J. Sens. Actuator Netw. 2019, 8(1), 9; https://doi.org/10.3390/jsan8010009

Chaotic Quantum Double Delta Swarm Algorithm Using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues

Department of Electrical Engineering and Computer Science, Vanderbilt University, 2201 West End Ave, Nashville, TN 37235, USA
*
Author to whom correspondence should be addressed.
Received: 8 December 2018 / Revised: 31 December 2018 / Accepted: 11 January 2019 / Published: 17 January 2019
(This article belongs to the Special Issue AI and Quantum Computing for Big Data Analytics)
  |  
PDF [11602 KB, uploaded 28 January 2019]
  |  

Abstract

The Quantum Double Delta Swarm (QDDS) Algorithm is a networked, fully-connected novel metaheuristic optimization algorithm inspired by the convergence mechanism to the center of potential generated within a single well of a spatially colocated double–delta well setup. It mimics the wave nature of candidate positions in solution spaces and draws upon quantum mechanical interpretations much like other quantum-inspired computational intelligence paradigms. In this work, we introduce a Chebyshev map driven chaotic perturbation in the optimization phase of the algorithm to diversify weights placed on contemporary and historical, socially-optimal agents’ solutions. We follow this up with a characterization of solution quality on a suite of 23 single–objective functions and carry out a comparative analysis with eight other related nature–inspired approaches. By comparing solution quality and successful runs over dynamic solution ranges, insights about the nature of convergence are obtained. A two-tailed t-test establishes the statistical significance of the solution data whereas Cohen’s d and Hedge’s g values provide a measure of effect sizes. We trace the trajectory of the fittest pseudo-agent over all iterations to comment on the dynamics of the system and prove that the proposed algorithm is theoretically globally convergent under the assumptions adopted for proofs of other closely-related random search algorithms. View Full-Text
Keywords: quantum particle swarms; swarm intelligence; chaotic systems; optimization quantum particle swarms; swarm intelligence; chaotic systems; optimization
Figures

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Sengupta, S.; Basak, S.; Peters, R.A., II. Chaotic Quantum Double Delta Swarm Algorithm Using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues. J. Sens. Actuator Netw. 2019, 8, 9.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
J. Sens. Actuator Netw. EISSN 2224-2708 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top