162 research outputs found
Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues
Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm
inspired by the convergence mechanism to the center of potential generated
within a single well of a spatially co-located 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 function evaluations 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.Comment: 27 pages, 4 figures, 19 table
Evolutionary Computation
This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field
A Survey and Future Directions on Clustering: From WSNs to IoT and Modern Networking Paradigms
Many Internet of Things (IoT) networks are created as an overlay over traditional ad-hoc networks such as Zigbee. Moreover, IoT networks can resemble ad-hoc networks over networks that support device-to-device (D2D) communication, e.g., D2D-enabled cellular networks and WiFi-Direct. In these ad-hoc types of IoT networks, efficient topology management is a crucial requirement, and in particular in massive scale deployments. Traditionally, clustering has been recognized as a common approach for topology management in ad-hoc networks, e.g., in Wireless Sensor Networks (WSNs). Topology management in WSNs and ad-hoc IoT networks has many design commonalities as both need to transfer data to the destination hop by hop. Thus, WSN clustering techniques can presumably be applied for topology management in ad-hoc IoT networks. This requires a comprehensive study on WSN clustering techniques and investigating their applicability to ad-hoc IoT networks. In this article, we conduct a survey of this field based on the objectives for clustering, such as reducing energy consumption and load balancing, as well as the network properties relevant for efficient clustering in IoT, such as network heterogeneity and mobility. Beyond that, we investigate the advantages and challenges of clustering when IoT is integrated with modern computing and communication technologies such as Blockchain, Fog/Edge computing, and 5G. This survey provides useful insights into research on IoT clustering, allows broader understanding of its design challenges for IoT networks, and sheds light on its future applications in modern technologies integrated with IoT.acceptedVersio
Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations
In recent years, a great variety of nature- and bio-inspired algorithms has
been reported in the literature. This algorithmic family simulates different
biological processes observed in Nature in order to efficiently address complex
optimization problems. In the last years the number of bio-inspired
optimization approaches in literature has grown considerably, reaching
unprecedented levels that dark the future prospects of this field of research.
This paper addresses this problem by proposing two comprehensive,
principle-based taxonomies that allow researchers to organize existing and
future algorithmic developments into well-defined categories, considering two
different criteria: the source of inspiration and the behavior of each
algorithm. Using these taxonomies we review more than three hundred
publications dealing with nature-inspired and bio-inspired algorithms, and
proposals falling within each of these categories are examined, leading to a
critical summary of design trends and similarities between them, and the
identification of the most similar classical algorithm for each reviewed paper.
From our analysis we conclude that a poor relationship is often found between
the natural inspiration of an algorithm and its behavior. Furthermore,
similarities in terms of behavior between different algorithms are greater than
what is claimed in their public disclosure: specifically, we show that more
than one-third of the reviewed bio-inspired solvers are versions of classical
algorithms. Grounded on the conclusions of our critical analysis, we give
several recommendations and points of improvement for better methodological
practices in this active and growing research field.Comment: 76 pages, 6 figure
- …