Microgrid Operations Planning Based on Improving the Flying Sparrow Search Algorithm

Microgrid operations planning is crucial for emerging energy microgrids to enhance the share of clean energy power generation and ensure a safe symmetry power grid among distributed natural power sources and stable functioning of the entire power system. This paper suggests a new improved version (namely, ESSA) of the sparrow search algorithm (SSA) based on an elite reverse learning strategy and firefly algorithm (FA) mutation strategy for the power microgrid optimal operations planning. Scheduling cycles of the microgrid with a distributed power source’s optimal output and total operation cost is modeled based on variables, e.g., environmental costs, electricity interaction, investment depreciation, and maintenance system, to establish grid multi-objective economic optimization. Compared with other literature methods, such as Genetic algorithm (GA), Particle swarm optimization (PSO), Firefly algorithm (FA), Bat algorithm (BA), Grey wolf optimization (GWO), and SSA show that the proposed plan offers higher performance and feasibility in solving microgrid operations planning issues.

Identification of Influential Modules Considering Design Change Impacts Based on Parallel Breadth-First Search and Bat Algorithm

Modular design is a widely used strategy that meets diverse customer requirements. Close relationships exist between parts inside a module and loose linkages between modules in the modular products. A change of one part or module may cause changes of other parts or modules, which in turn propagate through a product. This paper aims to present an approach to analyze the associations and change impacts between modules and identify influential modules in modular product design. The proposed framework explores all possible change propagation paths (CPPs), and measures change impact degrees between modules. In this article, a design structure matrix (DSM) is used to express dependence relationships between parts, and change propagation trees of affected parts within module are constructed. The influence of the affected part in the corresponding module is also analyzed, and a reachable matrix is employed to determine reachable parts of change propagation. The parallel breadth-first algorithm is used to search propagation paths. The influential modules are identified according to their comprehensive change impact degrees that are computed by the bat algorithm. Finally, a case study on the grab illustrates the impacts of design change in modular products.

A Deadline Constrained Time-Cost effective Salp Swarm Algorithm for Resource Optimization in Cloud Computing

Nowadays, Cloud Computing has become the most attractive platform, which provides anything as a Service (XaaS). Many applications may be developed and run on the cloud without worrying about platforms. It is a big challenge to allocate optimal resources to these applications and satisfy user's quality of service requirements. Here, in this paper, a Deadline Constrained Time-Cost effective Salp Swarm Algorithm (DTC-SSA) is proposed to achieve optimized resource allocation. DTC-SSA assigns the user's task to an appropriate virtual machine (Vm) and achieves a trade-off between cost and makespan while satisfying the deadline constraints. Rigorous examination of the algorithm is conducted on the various scale and cloud resources. The proposed algorithm is compared with Particle Swarm Optimization (PSO), Grey Wolf Optimizer(GWO), Bat Algorithm(BAT), and Genetic Algorithm(GA). Simulation results prove that it outperforms others by minimizing makespan, execution cost, Response time, and improving resource utilization throughput.

Penerapan Bat Algorithm Dalam Penyelsaian Kasus Travelling Salesman Problem (TSP) Pada Internship Program

This optimization is an optimization case that organizes all possible and feasible solutions in discrete form. One form of combinatorial optimization that can be used as material in testing a method is the Traveling Salesman Problem (TSP). In this study, the bat algorithm will be used to find the optimum value in TSP. Utilization of the Metaheuristic Algorithm through the concept of the Bat Algorithm is able to provide optimal results in searching for the shortest distance in the case of TSP. Based on trials conducted using data on the location of student street vendors, the Bat Algortima is able to obtain the global minimum or the shortest distance when compared to the nearest neighbor method, Hungarian method, branch and bound method.

An Improved Flower Pollination Algorithm for Global and Local Optimization

Meta-heuristic algorithms have emerged as a powerful optimization tool for handling non-smooth complex optimization problems and also to address engineering and medical issues. However, the traditional methods face difficulty in tackling the multimodal non-linear optimization problems within the vast search space. In this paper, the Flower Pollination Algorithm has been improved using Dynamic switch probability to enhance the balance between exploitation and exploration for increasing its search ability, and the swap operator is used to diversify the population, which will increase the exploitation in getting the optimum solution. The performance of the improved algorithm has investigated on benchmark mathematical functions, and the results have been compared with the Standard Flower pollination Algorithm (SFPA), Genetic Algorithm, Bat Algorithm, Simulated annealing, Firefly Algorithm and Modified flower pollination algorithm. The ranking of the algorithms proves that our proposed algorithm IFPDSO has outperformed the above-discussed nature-inspired heuristic algorithms.

Deep Ensemble Model for COVID-19 Diagnosis and Classification Using Chest CT Images

Coronavirus disease 2019 (COVID-19) has spread worldwide, and medicinal resources have become inadequate in several regions. Computed tomography (CT) scans are capable of achieving precise and rapid COVID-19 diagnosis compared to the RT-PCR test. At the same time, artificial intelligence (AI) techniques, including machine learning (ML) and deep learning (DL), find it useful to design COVID-19 diagnoses using chest CT scans. In this aspect, this study concentrates on the design of an artificial intelligence-based ensemble model for the detection and classification (AIEM-DC) of COVID-19. The AIEM-DC technique aims to accurately detect and classify the COVID-19 using an ensemble of DL models. In addition, Gaussian filtering (GF)-based preprocessing technique is applied for the removal of noise and improve image quality. Moreover, a shark optimization algorithm (SOA) with an ensemble of DL models, namely recurrent neural networks (RNN), long short-term memory (LSTM), and gated recurrent unit (GRU), is employed for feature extraction. Furthermore, an improved bat algorithm with a multiclass support vector machine (IBA-MSVM) model is applied for the classification of CT scans. The design of the ensemble model with optimal parameter tuning of the MSVM model for COVID-19 classification shows the novelty of the work. The effectiveness of the AIEM-DC technique take place on benchmark CT image data set, and the results reported the promising classification performance of the AIEM-DC technique over the recent state-of-the-art approaches.