A Hybrid Grey Wolf Optimization and Constriction Factor based PSO Algorithm for Workflow Scheduling in Cloud

Due to its flexibility, scalability, and cost-effectiveness of cloud computing, it has emerged as a popular platform for hosting various applications. However, optimizing workflow scheduling in the cloud is still a challenging problem because of the dynamic nature of cloud resources and the diversity of user requirements. In this context, Particle Swarm Optimization (PSO) and Grey Wolf Optimization (GWO) algorithms have been proposed as effective techniques for improving workflow scheduling in cloud environments. The primary objective of this work is to propose a workflow scheduling algorithm that optimizes the makespan, service cost, and load balance in the cloud. The proposed HGWOCPSO hybrid algorithm employs GWO and Constriction factor based PSO (CPSO) for the workflow optimization. The algorithm is simulated on Workflowsim, where a set of scientific workflows with varying task sizes and inter-task communication requirements are executed on a cloud platform. The simulation results show that the proposed algorithm outperforms existing algorithms in terms of makespan, service cost, and load balance. The employed GWO algorithm mitigates the problem of local optima that is inherent in PSO algorithm

A Review of Optimization Approach to Power Flow Tracing in a Deregulated Power System

Power Flow Tracing (PFT) is known to be the best method in the allocation of charges to users of transmission systems, generators and loads, in a deregulated environment. The optimization approach to PFT produced better results than other methods because it considers the physical power flow results and electrical constraints of the system. A brief review of the optimal power flow concept, PFT techniques, and the deterministic and non-deterministic optimization methods applied to PFT are presented. The paper also highlighted the future trends of hybrid optimization approach to PFT. It is recommended that more research work should be directed on the hybrid optimization methods to solve PFT problems

Midrange exploration exploitation searching particle swarm optimization with HSV-template matching for crowded environment object tracking

Particle Swarm Optimization (PSO) has demonstrated its effectiveness in solving the optimization problems. Nevertheless, the PSO algorithm still has the limitation in finding the optimum solution. This is due to the lack of exploration and exploitation of the particle throughout the search space. This problem may also cause the premature convergence, the inability to escape the local optima, and has a lack of self-adaptation in their performance. Therefore, a new variant of PSO called Midrange Exploration Exploitation Searching Particle Swarm Optimization (MEESPSO) was proposed to overcome these drawbacks. In this algorithm, the worst particle will be relocating to a new position to ensure the concept of exploration and exploitation remains in the search space. This is the way to avoid the particles from being trapped in local optima and exploit in a suboptimal solution. The concept of exploration will continue when the particle is relocated to a new position. In addition, to evaluate the performance of MEESPSO, we conducted the experiment on 12 benchmark functions. Meanwhile, for the dynamic environment, the method of MEESPSO with Hue, Saturation, Value (HSV)-template matching was proposed to improve the accuracy and precision of object tracking. Based on 12 benchmarks functions, the result shows a slightly better performance in term of convergence, consistency and error rate compared to another algorithm. The experiment for object tracking was conducted in the PETS09 and MOT20 datasets in a crowded environment with occlusion, similar appearance, and deformation challenges. The result demonstrated that the tracking performance of the proposed method was increased by more than 4.67% and 15% in accuracy and precision compared to other reported works

Large-Scale Network Plan Optimization Using Improved Particle Swarm Optimization Algorithm

No relevant reports have been reported on the optimization of a large-scale network plan with more than 200 works due to the complexity of the problem and the huge amount of computation. In this paper, an improved particle swarm optimization algorithm via optimization of initial particle swarm (OIPSO) is first explained by the stochastic processes theory. Then two optimization examples are solved using this method which are the optimization of resource-leveling with fixed duration and the optimization of resources constraints with shortest project duration in a large network plan with 223 works. Through these two examples, under the same number of iterations, it is proven that the improved algorithm (OIPSO) can accelerate the optimization speed and improve the optimization effect of particle swarm optimization (PSO)

PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization

Particle swarm optimization (PSO) and fireworks algorithm (FWA) are two recently developed optimization methods which have been applied in various areas due to their simplicity and efficiency. However, when being applied to high-dimensional optimization problems, PSO algorithm may be trapped in the local optima owing to the lack of powerful global exploration capability, and fireworks algorithm is difficult to converge in some cases because of its relatively low local exploitation efficiency for noncore fireworks. In this paper, a hybrid algorithm called PS-FW is presented, in which the modified operators of FWA are embedded into the solving process of PSO. In the iteration process, the abandonment and supplement mechanism is adopted to balance the exploration and exploitation ability of PS-FW, and the modified explosion operator and the novel mutation operator are proposed to speed up the global convergence and to avoid prematurity. To verify the performance of the proposed PS-FW algorithm, 22 high-dimensional benchmark functions have been employed, and it is compared with PSO, FWA, stdPSO, CPSO, CLPSO, FIPS, Frankenstein, and ALWPSO algorithms. Results show that the PS-FW algorithm is an efficient, robust, and fast converging optimization method for solving global optimization problems

A Novel Particle Swarm Optimization Algorithm for Global Optimization

Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered. Meanwhile, to avoid premature, an abandoned mechanism is used. Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration. To verify the performance of our algorithm, standard test functions have been employed. The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms