Traffic flow forecasting using natural selection based hybrid Bald Eagle Search-Grey Wolf optimization algorithm.

In a fast-moving world, transportation consumes most of the time and resources. Traffic prediction has become a thrust application for machine learning algorithms to overcome the hurdles faced by congestion. Its accuracy determines the selection and existence of machine learning algorithms. The accuracy of such an algorithm is improved better by the proper tuning of the parameters. Support Vector Regression (SVR) is a well-known prediction mechanism. This paper exploits the Hybrid Grey Wolf Optimization-Bald Eagle Search (GWO-BES) algorithm for tuning SVR parameters, wherein the GWO selection methods are of natural selection. SVR-GWO-BES with natural selection has error performance increases by 48% in Mean Absolute Percentage Error and Root Mean Square Error, with the help of Caltrans Performance Measurement System (PeMS) open-source data and Chennai city traffic data for traffic forecasting. It is also shown that the increasing population of search agents increases the performance.

Novel metaheuristic based on multiverse theory for optimization problems in emerging systems.

Finding an optimal solution for emerging cyber physical systems (CPS) for better efficiency and robustness is one of the major issues. Meta-heuristic is emerging as a promising field of study for solving various optimization problems applicable to different CPS systems. In this paper, we propose a new meta-heuristic algorithm based on Multiverse Theory, named MVA, that can solve NP-hard optimization problems such as non-linear and multi-level programming problems as well as applied optimization problems for CPS systems. MVA algorithm inspires the creation of the next population to be very close to the solution of initial population, which mimics the nature of parallel worlds in multiverse theory. Additionally, MVA distributes the solutions in the feasible region similarly to the nature of big bangs. To illustrate the effectiveness of the proposed algorithm, a set of test problems is implemented and measured in terms of feasibility, efficiency of their solutions and the number of iterations taken in finding the optimum solution. Numerical results obtained from extensive simulations have shown that the proposed algorithm outperforms the state-of-the-art approaches while solving the optimization problems with large feasible regions.

COVID-19 Optimizer Algorithm, Modeling and Controlling of Coronavirus Distribution Process.

The emergence of novel COVID-19 is causing an overload on public health sector and a high fatality rate. The key priority is to contain the epidemic and reduce the infection rate. It is imperative to stress on ensuring extreme social distancing of the entire population and hence slowing down the epidemic spread. So, there is a need for an efficient optimizer algorithm that can solve NP-hard in addition to applied optimization problems. This article first proposes a novel COVID-19 optimizer Algorithm (CVA) to cover almost all feasible regions of the optimization problems. We also simulate the coronavirus distribution process in several countries around the globe. Then, we model a coronavirus distribution process as an optimization problem to minimize the number of COVID-19 infected countries and hence slow down the epidemic spread. Furthermore, we propose three scenarios to solve the optimization problem using most effective factors in the distribution process. Simulation results show one of the controlling scenarios outperforms the others. Extensive simulations using several optimization schemes show that the CVA technique performs best with up to 15%, 37%, 53% and 59% increase compared with Volcano Eruption Algorithm (VEA), Gray Wolf Optimizer (GWO), Particle Swarm Optimization (PSO) and Genetic Algorithm (GA), respectively.