Search

The optimization of industrial processes is a critical task for leveraging profitability and sustainability. To ensure the selection of optimum process parameter levels in any industrial process, numerous metaheuristic algorithms have been proposed so far. However, many algorithms are either computationally too expensive or become trapped in the pit of local optima. To counter these challenges, in this paper, a hybrid metaheuristic called PSO-GSA is employed that works by combining the iterative improvement capability of particle swarm optimization (PSO) and gravitational search algorithm (GSA). A binary PSO is also fused with GSA to develop a BPSO-GSA algorithm. Both the hybrid algorithms i.e., PSO-GSA and BPSO-GSA, are compared against traditional algorithms, such as tabu search (TS), genetic algorithm (GA), differential evolution (DE), GSA and PSO algorithms. Moreover, another popular hybrid algorithm DE-GA is also used for comparison. Since earlier works have already studied the performance of these algorithms on mathematical benchmark functions, in this paper, two real-world-applicable independent case studies on biodiesel production are considered. Based on the extensive comparisons, significantly better solutions are observed in the PSO-GSA algorithm as compared to the traditional algorithms. The outcomes of this work will be beneficial to similar studies that rely on polynomial models. [ABSTRACT FROM AUTHOR]

Wireless powered communication network (WPCN) is a promising technique to resolve the power constraint issue faced by wireless nodes at the same time it also provides green and a safer solution. This paper studies, mutual sharing between WPCN and simultaneous wireless information and power transfer model where optimal resource allocation occurs between licensed/bandwidth group and an unlicensed/power group to enhance the system performance. The main aim of this paper is to maximize system weighted sum rate and minimize power consumption during transmission by optimal time allocation and energy beamforming vector allocation. These multiobjective combinatorial problems are solved using joint metaheuristic particle swarm optimization-cuckoo search algorithm to provide an optimal solution. The results are compared using a conventional mathematical optimization algorithm to set as a baseline for performance parameters. The obtained results demonstrate that the efficient joint metaheuristic approach provides a significant gain in the system performance and also offers a computationally less complex approach for solving a complicated non-convex multiobjective problem of wireless powered network. [ABSTRACT FROM AUTHOR]

Over the last decade, the size and complexity of real-world problems have grown dramatically, necessitating more effective tools. Nature-inspired metaheuristic algorithms have proven to be a promising tool for solving such problems due to their performance in a variety of fields. JAYA algorithm is a novel population-based algorithm which could have been able to present reliable results. This is because it does not need any parameters to be set other than the population size and the maximum number of iteration. Despite its positive feedbacks, this algorithm should be modified to witness more efficiency. This paper aims to amend the original version of Jaya to present a high-efficiency version named Powerful Enhanced Jaya (PEJAYA). In other words, the methodology of updating position in Jaya is modified to enhance the convergence and search capabilities. This approach is assessed according to solve 20 well-known benchmark functions, feature selection, and statistical tests. The output results of proposed optimization algorithm are then evaluated by comparing it with other recent algorithms including crow search algorithm (CSA), standard version of JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO) and sine–cosine algorithm (SCA). Solving a real-world problem is another way of checking the efficiency of this approach with other published works. Prompt escape from local minima, superior convergence, and stability demonstrate that the suggested approach is a very powerful instrument that may be employed in a variety of optimization situations. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm which is mathematically modelled by amalgamating the superior features of recently developed Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), and Crow Search Algorithm (CSA). Researchers have already implemented the aforementioned three algorithms and obtained superior quality results for solving diverse optimization problems. The novel hybrid Variegated GWO Algorithm (VGWO) developed in this proposed research work is initially realized and validated for solving IEEE CEC-C06 2019 benchmark functions. Thereafter, the proposed VGWO is utilized as an optimization tool to solve three emerging and complex power system optimization problems which includes energy management of microgrid systems operated in both islanded and grid-connected mode, dynamic economic emission dispatch and reactive power planning (RPP) problem. A comparative analysis of the proposed VGWO approach with other established metaheuristics is undertaken for each optimization problem. Numerical results show that the novel hybrid VGWO algorithm outperformed an ample number of optimization techniques in providing better quality solutions. The proposed hybrid algorithm yielded a 36.93% reduction in active power loss and 36.80% reduction in operating cost with respect to base case condition for RPP problem. Likewise while solving microgrid energy management problems 9–30% savings was realized in the generation cost compared to the ones mentioned in literature. The capability of handling many complex constraints within a minimum amount of computational time to provide consistently best solutions prioritize the proposed hybrid algorithm among its kinds. Statistical analysis validates the authenticity and viability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Since real-world problems are quite complex, developing more effective methods to optimize them is taken into consideration at the present age. One of the most popular strategies to solve such problems is nature-inspired metaheuristic algorithms which have presented promising solutions in different fields. The JAYA algorithm is an innovative and promising technique for solving a wide range of optimization problems. Hence, this investigation provides a new hybrid algorithm based on JAYA and crow search algorithm (CSA), known as HJCSA, to enhance its performance. In other words, the mechanism of updating position in CSA is integrated with JAYA algorithm to reinforce the convergence and search capabilities of JAYA algorithm. The proposed hybrid algorithm is evaluated through solving 20 well-known benchmark functions, and obtained results are compared with various up-to-date algorithms, including CSA, JAYA, particle swarm optimization (PSO), dragonfly algorithm (DA), grasshopper optimization algorithm (GOA), moth-flame optimization (MFO), and sine–cosine algorithm (SCA). In addition, a real-world engineering problem is optimized by the proposed optimization approach and compared with other published works. The results showed that the suggested optimization algorithm is much more vigorous in escaping from local minima, possessing better convergence, and discovering more accurate solutions. [ABSTRACT FROM AUTHOR]