Hybridization strategies for continuous ant colony optimization and particle swarm optimization applied to data clustering

Sine-Cosine Algorithm for the Dynamic Economic Dispatch Problem With the Valve-Point Loading Effect

Dynamic economic dispatch (DED) deals with the allocation of predicted load demand over a certain period of time among the thermal generating units at minimum fuel cost. The objective function of DED becomes highly complex and nonlinear after considering various operating constraints like valve point loading, ramp rate limit, transmission loss, and generation limits. In this study, the sine-cosine algorithm has been presented to solve the DED problem with various constraints. The randomly placed swarm finds an optimum solution according to their fitness values and keeps the path towards the best solution attained by each swarm. The swarm avoid local optima in the exploration stage and move towards the solution exploitation stage using sine and cosine functions. The proposed technique has been tested in several test systems. The results obtained by the proposed technique have been compared with those obtained by other published methods employing the same test systems. The results validate the superiority and the effectiveness of the proposed technique over other well-known techniques.

Secure Clustering Strategy Based on Improved Particle Swarm Optimization Algorithm in Internet of Things

This paper proposes a secure clustering strategy based on improved particle swarm optimization (PSO) in the environment of the Internet of Things (IoT). First, in the process of cluster head election, by considering the residual energy and load balance of nodes, a new fitness function is established to evaluate and select better candidate cluster head nodes. Second, the optimized adaptive learning factor is used to adjust the location update speed of candidate cluster head nodes, expand the local search, and accelerate the convergence speed of global search. Finally, in the stage of forwarding node election and data transmission, in order to reduce the energy consumption of forwarding nodes, each cluster head node elects a forwarding node among the ordinary nodes in its cluster, so that the elected forwarding nodes have the optimal energy and location relationship. Experiments show that the proposed method effectively prolongs the network lifetime compared with the comparison methods. The average node degree of the proposed method is less than 2.5.

Sooty Tern Optimization Algorithm for Solving the Multi-Objective Dynamic Economic Emission Dispatch Problem

The sooty tern optimization algorithm (STOA) has been used in this study to solve and optimize the dynamic economic emission dispatch (DEED) problem. The main aim of the DEED model is to minimize total fuel cost and emission of pollutant gases from thermal generators for 24 hours. The various operating constraints like valve point loading effect, ramp rate limit, transmission losses, operating conditions, and power balance constraints have been considered in this study to get a closer practical system. The swarm intelligence-based STOA method has been inspired by the migration and attacking behaviors of sea bird sooty tern. The exploration and exploitation approach of the proposed algorithm help to get an optimum solution in less convergence time. The algorithm has been tested in 5 and 10 thermal generating units to verify the algorithm's performance. The results obtained by the proposed algorithm have been compared with results obtained by other recently developed algorithms.

Particle Swarm Optimization Combined with Inertia-Free Velocity and Direction Search

The particle swarm optimization algorithm (PSO) is a widely used swarm-based natural inspired optimization algorithm. However, it suffers search stagnation from being trapped into a sub-optimal solution in an optimization problem. This paper proposes a novel hybrid algorithm (SDPSO) to improve its performance on local searches. The algorithm merges two strategies, the static exploitation (SE, a velocity updating strategy considering inertia-free velocity), and the direction search (DS) of Rosenbrock method, into the original PSO. With this hybrid, on the one hand, extensive exploration is still maintained by PSO; on the other hand, the SE is responsible for locating a small region, and then the DS further intensifies the search. The SDPSO algorithm was implemented and tested on unconstrained benchmark problems (CEC2014) and some constrained engineering design problems. The performance of SDPSO is compared with that of other optimization algorithms, and the results show that SDPSO has a competitive performance.

An Event-Based Supply Chain Partnership Integration Using a Hybrid Particle Swarm Optimization and Ant Colony Optimization Approach

Integrating a partnership with potentially stronger suppliers is widely acknowledged as a contributor to the organizational competitiveness of a supply chain. This paper proposes an event-based model which lists the events related with all phases of cooperation with partners and puts events into a dynamic supply chain network in order to understand factors that affect supply chain partnership integration. We develop a multi-objective supply chain partnership integration problem by maximizing trustworthiness, supplier service, qualified products rate and minimizing cost, and then, apply a hybrid algorithm (PSACO) with particle swarm optimization (PSO) and ant colony optimization (ACO) that aims to efficiently solve the problem. It combines the advantages of PSO with reliable global searching capability and ACO with great evolutionary ability and positive feedback. By using the actual data from 1688.com, experimental studies are carried out. The parameter optimizing of the hybrid algorithm is firstly deployed and then we compare the problem solution results of PSACO with the original PSO, ACO. By studying the partnership integration results and implementing analysis of variance (ANOVA) analysis, it shows that the event based model with PSACO approach has validity and superiority over PSO and ACO, and can be served as a tool of decision making for supply chain coordination management in business.

Cellular Automata Based Model for E-Healthcare Data Analysis

E-healthcare is warm area of research and a number of algorithms have been applied to classify healthcare data. In the healthcare field, a large amount of clinical data is generated through MRI, CT scans, and other diagnostic tools. Healthcare analytics are used to analyze the clinical data of patient records, disease diagnosis, cost, hospital management, etc. Analytical techniques and data visualization are used to get the real time information. Further, this information can be used for decision making. Also, this information is useful for the better treatment of patients. In this work, an improved big bang-big crunch (BB-BC) based clustering algorithm is applied to analyze healthcare data. Cluster analysis is an important task in the field of data analysis and can be used to understand the organization of data. In this work, two healthcare datasets, CMC and cancer, are used and the proposed algorithm obtains better results when compared to MEBB-BC, BB-BC, GA, PSO and K-means algorithms. The performance of the improved BB-BC algorithm is also examined against benchmark clustering datasets. The simulation results showed that proposed algorithm improves the clustering results significantly when compared to other algorithms.

Scenario-Based Emergency Material Scheduling Using V2X Communications

Vehicle-to-everything (V2X) communications can be applied in emergency material scheduling due to their performance in collecting and transmitting disaster-related data in real time. The urgency of disaster depots can be judged based on the disaster area video, and the scenario coefficient can be evaluated for building a fairness model. This paper presents a scenario-based approach for emergency material scheduling (SEMS) using V2X communications. We propose a SEMS model, with the objectives of minimum time and maximum fairness in the cases of multiple supply depots, disaster depots, commodities and transport modes for logistics management of relief commodities. We design the SEMS algorithm based on the artificial fish-swarm algorithm to obtain an optimized solution. The results demonstrate that the SEMS model can enhance the fairness of relief scheduling, especially for disaster depots with small demands compared to the Gini and enhanced Theil fairness models. Moreover, the acquired vehicle speed via V2X communications updates the SEMS model in real time, which approaches a solution closer to reality.

Particle Swarm Optimization: A Survey of Historical and Recent Developments with Hybridization Perspectives

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems that cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment, and improvements of its most basic as well as some of the very recent state-of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.

K-Means Cloning: Adaptive Spherical K-Means Clustering

We propose a novel method for adaptive K-means clustering. The proposed method overcomes the problems of the traditional K-means algorithm. Specifically, the proposed method does not require prior knowledge of the number of clusters. Additionally, the initial identification of the cluster elements has no negative impact on the final generated clusters. Inspired by cell cloning in microorganism cultures, each added data sample causes the existing cluster ‘colonies’ to evaluate, with the other clusters, various merging or splitting actions in order for reaching the optimum cluster set. The proposed algorithm is adequate for clustering data in isolated or overlapped compact spherical clusters. Experimental results support the effectiveness of this clustering algorithm.