Review of Metaheuristics and Generalized Evolutionary Walk Algorithm

Metaheuristic algorithms are often nature-inspired, and they are becoming very powerful in solving global optimization problems. More than a dozen of major metaheuristic algorithms have been developed over the last three decades, and there exist even more variants and hybrid of metaheuristics. This paper intends to provide an overview of nature-inspired metaheuristic algorithms, from a brief history to their applications. We try to analyze the main components of these algorithms and how and why they works. Then, we intend to provide a unified view of metaheuristics by proposing a generalized evolutionary walk algorithm (GEWA). Finally, we discuss some of the important open questions.Comment: 14 page

Energy management in microgrids with renewable energy sources: A literature review

Renewable energy sources have emerged as an alternative to meet the growing demand for energy, mitigate climate change, and contribute to sustainable development. The integration of these systems is carried out in a distributed manner via microgrid systems; this provides a set of technological solutions that allows information exchange between the consumers and the distributed generation centers, which implies that they need to be managed optimally. Energy management in microgrids is defined as an information and control system that provides the necessary functionality, which ensures that both the generation and distribution systems supply energy at minimal operational costs. This paper presents a literature review of energy management in microgrid systems using renewable energies, along with a comparative analysis of the different optimization objectives, constraints, solution approaches, and simulation tools applied to both the interconnected and isolated microgrids. To manage the intermittent nature of renewable energy, energy storage technology is considered to be an attractive option due to increased technological maturity, energy density, and capability of providing grid services such as frequency response. Finally, future directions on predictive modeling mainly for energy storage systems are also proposed

Modified constrained differential evolution for solving nonlinear global optimization problems

Nonlinear optimization problems introduce the possibility of multiple local optima. The task of global optimization is to find a point where the objective function obtains its most extreme value while satisfying the constraints. Some methods try to make the solution feasible by using penalty function methods, but the performance is not always satisfactory since the selection of the penalty parameters for the problem at hand is not a straightforward issue. Differential evolution has shown to be very efficient when solving global optimization problems with simple bounds. In this paper, we propose a modified constrained differential evolution based on different constraints handling techniques, namely, feasibility and dominance rules, stochastic ranking and global competitive ranking and compare their performances on a benchmark set of problems. A comparison with other solution methods available in literature is also provided. The convergence behavior of the algorithm to handle discrete and integer variables is analyzed using four well-known mixed-integer engineering design problems. It is shown that our method is rather effective when solving nonlinear optimization problems.Fundação para a Ciência e a Tecnologia (FCT

Proposal and Comparative Study of Evolutionary Algorithms for Optimum Design of a Gear System

This paper proposes a novel metaheuristic framework using a Differential Evolution (DE) algorithm with the Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Both algorithms are combined employing a collaborative strategy with sequential execution, which is called DE-NSGA-II. The DE-NSGA-II takes advantage of the exploration abilities of the multi-objective evolutionary algorithms strengthened with the ability to search global mono-objective optimum of DE, that enhances the capability of finding those extreme solutions of Pareto Optimal Front (POF) difficult to achieve. Numerous experiments and performance comparisons between different evolutionary algorithms were performed on a referent problem for the mono-objective and multi-objective literature, which consists of the design of a double reduction gear train. A preliminary study of the problem, solved in an exhaustive way, discovers the low density of solutions in the vicinity of the optimal solution (mono-objective case) as well as in some areas of the POF of potential interest to a decision maker (multi-objective case). This characteristic of the problem would explain the considerable difficulties for its resolution when exact methods and/or metaheuristics are used, especially in the multi-objective case. However, the DE-NSGA-II framework exceeds these difficulties and obtains the whole POF which significantly improves the few previous multi-objective studies.Fil: Méndez Babey, Máximo. Universidad de Las Palmas de Gran Canaria; EspañaFil: Rossit, Daniel Alejandro. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; ArgentinaFil: González, Begoña. Universidad de Las Palmas de Gran Canaria; EspañaFil: Frutos, Mariano. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentin

A Study Of Vantage Point Neighbourhood Search In The Bees Algorithm For Combinatorial Optimization Problems

Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2014Thesis (M.Sc. ) -- İstanbul Technical University, Institute of Science and Technology, 2014Bu tez çalışmasının temel amacı arıların kaynak arama davranışlarını modelleyen arı algoritmasının, kombinatoryal uzaylarda komşuluk arama fazına yeni bir yaklaşım geliştirilmesidir. Geliştirilen yaklaşım Gezgin Satıcı Problemine uygulanarak Gezgin Satıcı Problemi çözümünün en iyilenmesi amaçlanmıştır.This thesis focuses on nature-inspired optimisation algorithms, in particular, the Bees Algorithm that developed for combinatorial domains with new local search procedure and applied to Traveller Salesman Problem (TSP). An efficient and robust local neighborhood search algorithm is proposed for combinatorial domains to increase the efficiency of the Bees Algorithm.Yüksek LisansM.Sc

HYBRID GENETIC AND PENGUIN SEARCH OPTIMIZATION ALGORITHM (GA-PSEOA) FOR EFFICIENT FLOW SHOP SCHEDULING SOLUTIONS

This paper presents a novel hybrid approach, fusing genetic algorithms (GA) and penguin search optimization (PSeOA), to address the flow shop scheduling problem (FSSP). GA utilizes selection, crossover, and mutation inspired by natural selection, while PSeOA emulates penguin foraging behavior for efficient exploration. The approach integrates GA's genetic diversity and solution space exploration with PSeOA's rapid convergence, further improved with FSSP-specific modifications. Extensive experiments validate its efficacy, outperforming pure GA, PSeOA, and other metaheuristics

Distribution based artificial fish swarm in continuous global optimization

Distribution based artificial fish swarm (DbAFS) is a new heuristic for continuous global optimization. Based on the artificial fish swarm paradigm, the new algorithm generates trial points from the Gaussian distribution, where the mean is the midpoint between the current and the target point and the standard deviation is the difference between those two points. A local search procedure is incorporated into the algorithm aiming to improve the quality of the solutions. The performance of the proposed DbAFS is investigated using a set of small bound constrained optimization problems.Fundação para a Ciência e a Tecnologia (FCT

Demand Side Management In Smart Grid Optimization Using Artificial Fish Swarm Algorithm

The demand side management and their response including peak shaving approaches and motivations with shiftable load scheduling strategies advantages are the main focus of this paper. A recent real-time pricing model for regulating energy demand is proposed after a survey of literature-based demand side management techniques. Lack of user’s resources needed to change their energy consumption for the system's overall benefit. The recommended strategy involves modern system identification and administration that would enable user side load control. This might assist in balancing the demand and supply sides more effectively while also lowering peak demand and enhancing system efficiency. The AFSA and BFO algorithms are combined in this study to handle the optimization of difficult problems in a range of industries. Although the BFO will be used to exploit the search space and converge to the optimum solution, the AFSA will be used to explore the search space and retain variation. In terms of reduction of peak demand, energy consumption, and user satisfaction, the AFSA-BFO hybrid algorithm outperforms previous techniques in the field of demand side management in a smart grid context, using an AFSA. According to simulation results, the genetic algorithm successfully reduces PAR and power consumption expenses