PENGEMBANGAN metaheuristicOpt: R PACKAGE UNTUK OPTIMASI DENGAN MENGGUNAKAN ALGORITMA POPULATION BASED METAHEURISTIC

Optimasi diterapkan diberbagai disiplin ilmu seperti teknik sipil, teknik mekanika, ekonomi, teknik elektro dan lain-lain. Karena optimasi diterapkan diberbagai disiplin ilmu maka optimasi sangatlah penting. Banyak sekali pendekatan yang dilakukan dalam melakukan optimasi salah satunya adalah population based metaheuristic. Di bahasa pemrograman R terdapat package optimasi menggunakan algoritma population based metaheuristic yaitu “metaheuristicOpt”. Algoritma-algoritma pada R package “metaheuristicOpt” memiliki dua kelemahan yaitu kompleksitas yang tinggi dan hyperparameter yang sedikit. Tujuan penelitian ini adalah mengembangkan R package “metaheuristicOpt” dengan menambahkan 10 algoritma baru yaitu clonal selection algorithm, differential evolution, shuffled frog leaping, cat swarm optimization, artificial bee colony algorithm, krill herd algorithm, cuckoo search, bat algorithm, gravitational based search dan black hole optimization untuk menutupi kelemahan algoritma sebelumnya. Dalam menambahkan algoritma ini kami menjaga konsistensi arsitektur package tersebut. Untuk menganalisis performa dari algoritma baru yang ditambahkan setiap fungsi diuji menggunakan 13 fungsi uji. Yang menjadi tolok ukur eksperimen adalah fitness dan waktu eksekusi. Berdasarkan eksperimen yang dilakukan beberapa algoritma baru memiliki kecepatan eksekusi yang lebih cepat dari algoritma sebelumnya dan beberapa algoritma baru juga memiliki fitness yang lebih baik dari algoritma sebelumnya. Optimization is applied in various scientific disciplines such as civil engineering, mechanical engineering, economics, electrical engineering and others. Because optimization is applied in various disciplines, optimization is very important. There are a lot of approaches used to optimize one of them is population based metaheuristic. In the R programming language there is an optimization package using the population based metaheuristic algorithm, namely "metaheuristicOpt". Algorithms in the R package "metaheuristicOpt" have two disadvantages: high complexity and few hyperparameters. Our goal is to develop the "metaheuristicOpt" package by adding 10 new algorithms namely clonal selection algorithm, differential evolution, shuffled frog leaping, cat swarm optimization, artificial bee colony algorithm, krill herd algorithm, cuckoo search, bat algorithm, gravitational based search and black hole optimization to cover up the weaknesses of the previous algorithm. In adding of these algorithms we maintain the consistency of the package architecture. To analyse performance of the new algorithm added to each function of the algorithm, experiments were carried out using 13 test functions. The benchmarks of the experiment are fitness and execution time. Based on experiments some of new algorithms added have a faster execution speed and better fitness than the previous algorithms

Metaheuristic optimization of power and energy systems: underlying principles and main issues of the 'rush to heuristics'

In the power and energy systems area, a progressive increase of literature contributions containing applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods based on weak comparisons. This 'rush to heuristics' does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter, but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems, and aims at providing a comprehensive view of the main issues concerning the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls found in literature contributions are identified, and specific guidelines are provided on how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

Evolutionary Computation 2020

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the `Rush to Heuristics'

In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems

Modified flower pollination algorithm for global optimization

In this paper, a modified flower pollination algorithm (MFPA) is proposed to improve the performance of the classical algorithm and to tackle the nonlinear equation systems widely used in engineering and science fields. In addition, the differential evolution (DE) is integrated with MFPA to strengthen its exploration operator in a new variant called HFPA. Those two algorithms were assessed using 23 well-known mathematical unimodal and multimodal test functions and 27 well-known nonlinear equation systems, and the obtained outcomes were extensively compared with those of eight well-known metaheuristic algorithms under various statistical analyses and the convergence curve. The experimental findings show that both MFPA and HFPA are competitive together and, compared to the others, they could be superior and competitive for most test cases

Improvements on the bees algorithm for continuous optimisation problems

This work focuses on the improvements of the Bees Algorithm in order to enhance the algorithm’s performance especially in terms of convergence rate. For the first enhancement, a pseudo-gradient Bees Algorithm (PG-BA) compares the fitness as well as the position of previous and current bees so that the best bees in each patch are appropriately guided towards a better search direction after each consecutive cycle. This method eliminates the need to differentiate the objective function which is unlike the typical gradient search method. The improved algorithm is subjected to several numerical benchmark test functions as well as the training of neural network. The results from the experiments are then compared to the standard variant of the Bees Algorithm and other swarm intelligence procedures. The data analysis generally confirmed that the PG-BA is effective at speeding up the convergence time to optimum. Next, an approach to avoid the formation of overlapping patches is proposed. The Patch Overlap Avoidance Bees Algorithm (POA-BA) is designed to avoid redundancy in search area especially if the site is deemed unprofitable. This method is quite similar to Tabu Search (TS) with the POA-BA forbids the exact exploitation of previously visited solutions along with their corresponding neighbourhood. Patches are not allowed to intersect not just in the next generation but also in the current cycle. This reduces the number of patches materialise in the same peak (maximisation) or valley (minimisation) which ensures a thorough search of the problem landscape as bees are distributed around the scaled down area. The same benchmark problems as PG-BA were applied against this modified strategy to a reasonable success. Finally, the Bees Algorithm is revised to have the capability of locating all of the global optimum as well as the substantial local peaks in a single run. These multi-solutions of comparable fitness offers some alternatives for the decision makers to choose from. The patches are formed only if the bees are the fittest from different peaks by using a hill-valley mechanism in this so called Extended Bees Algorithm (EBA). This permits the maintenance of diversified solutions throughout the search process in addition to minimising the chances of getting trap. This version is proven beneficial when tested with numerous multimodal optimisation problems

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

Integration of High Voltage AC/DC Grids into Modern Power Systems

Electric power transmission relies on AC and DC grids. The extensive integration of conventional and nonconventional energy sources and power converters into power grids has resulted in a demand for high voltage (HV), extra-high voltage (EHV), and ultra-high voltage (UHV) AC/DC transmission grids in modern power systems. To ensure the security, adequacy, and reliable operation of power systems, the practical aspects of interconnecting HV, EHV, and UHV AC/DC grids into the electric power systems, along with their economic and environmental impacts, should be considered. The stability analysis for the planning and operation of HV, EHV, and UHV AC/DC grids in power systems is regarded as another key issue in modern power systems. Moreover, interactions between power converters and other power electronics devices (e.g., FACTS devices) installed on the network are other aspects of power systems that must be addressed. This Special Issue aims to investigate the integration of HV, EHV, and UHV AC/DC grids into modern power systems by analyzing their control, operation, protection, dynamics, planning, reliability, and security, along with considering power quality improvement, market operations, power conversion, cybersecurity, supervisory and monitoring, diagnostics, and prognostics systems

A Comprehensive Review of Bio-Inspired Optimization Algorithms Including Applications in Microelectronics and Nanophotonics

The application of artificial intelligence in everyday life is becoming all-pervasive and unavoidable. Within that vast field, a special place belongs to biomimetic/bio-inspired algorithms for multiparameter optimization, which find their use in a large number of areas. Novel methods and advances are being published at an accelerated pace. Because of that, in spite of the fact that there are a lot of surveys and reviews in the field, they quickly become dated. Thus, it is of importance to keep pace with the current developments. In this review, we first consider a possible classification of bio-inspired multiparameter optimization methods because papers dedicated to that area are relatively scarce and often contradictory. We proceed by describing in some detail some more prominent approaches, as well as those most recently published. Finally, we consider the use of biomimetic algorithms in two related wide fields, namely microelectronics (including circuit design optimization) and nanophotonics (including inverse design of structures such as photonic crystals, nanoplasmonic configurations and metamaterials). We attempted to keep this broad survey self-contained so it can be of use not only to scholars in the related fields, but also to all those interested in the latest developments in this attractive area