Two Objective Public Service System Design Problem

The public service system serves population spread over a geographical area from a given number of service centers. One of the possible approaches to the problem with two or more simultaneously applied contradicting objectives is determination of the so-called Pareto front, i.e. set of all the feasible non-dominated solutions. The Pareto front determination represents a crucial computational deal, when a large public service system is designed using an exact method. This process complexity evoked an idea to use an evolutionary metaheuristic, which can build up a set of non-dominated solution continuously in the form of an elite set. Nevertheless, the latter approach does not assure that the resulting set of solutions represents the true Pareto front of the multi-objective problem solutions. Within this paper, authors deal with both approaches to evaluate the difference between the exact and heuristic approaches.

Evolutionary Metaheuristic Methods Applied to Minimize the THD in Inverters: A Systematic Review

In recent research works, metaheuristic methods have been widely used to minimize THD in inverters, these methods provide better computation time and effective results compared to classical methods. This paper presents a systematic analysis with a comprehensive coverage of metaheuristic methods applied to multilevel inverters. The search focused on the characteristics of the inverters used in the articles (topologies, levels, loads and evolutionary method). The aim is to show which are the characteristics of the most used case studies for the application of evolutionary metaheuristic methods. The IEEEXplorer, ScienceDirect, IET Digital Library, Springer and WorldWideScience databases have been used for the review since 2010. The results of the review show that many researchers use evolutionary algorithms, with Cascaded H-bridge Multilevel Inverter topology, RL loading and 7 levels. This highlights which features of the case studies are the most used and analysed to explore the advantages of using evolutionary metaheuristic methods.

A Comprehensive Review on Scatter Search: Techniques, Applications, and Challenges

Recent years have witnessed the use of metaheuristic algorithms to solve the optimization problems that usually require extensive computations and time. Among others, scatter search is the widely used evolutionary metaheuristic algorithm. It uses the information of global optima, which is stored in a different and unique set of solutions. In this paper, an updated review of scatter search (SS) is given. SS has been successfully applied in a variety of research problems, namely, data mining, bioinformatics, and engineering design. This paper presents the modified and hybrid versions of SS with their applications. The control strategies are discussed to show their impact on the performance of SS. various issues and future directions related to SS are also discussed. It inspires innovative researchers to use this algorithm for their research domains.

MURAME parameter setting for creditworthiness evaluation: data-driven optimization

In this paper, we amend a multi-criteria methodology known as MURAME, to evaluate the creditworthiness of a large sample of Italian Small and Medium-sized Enterprises, using as input their balance sheet data. This methodology produces results in terms of scoring and of classification into homogeneous rating classes. A distinctive goal of this paper is to consider a preference disaggregation method to endogenously determine some parameters of MURAME, by solving a nonsmooth constrained optimization problem. Because of the complexity of the involved mathematical programming problem, for its solution we use an evolutionary metaheuristic, coupled with a specific efficient initialization. This is combined with an unconstrained reformulation of the problem, which provides a reasonable compromise between the quality of the solution and the computational burden. An extensive numerical experience is reported, comparing an exogenous choice of MURAME parameters with our approach.

AutoMH: Automatically Create Evolutionary Metaheuristic Algorithms Using Reinforced Learning

Machine learning research has been able to solve problems in multiple aspects. An open area of research is machine learning for solving optimisation problems. An optimisation problem can be solved using a metaheuristic algorithm, which is able to find a solution in a reasonable amount of time. However, there is a problem, the time required to find an appropriate metaheuristic algorithm, that would have the convenient configurations to solve a set of optimisation problems properly. A solution approach is shown here, using a proposal that automatically creates metaheuristic algorithms aided by a reinforced learning approach. Based on the experiments performed, the approach succeeded in creating a metaheuristic algorithm that managed to solve a large number of different continuous domain optimisation problems. This work's implications are immediate because they describe a basis for the generation of metaheuristic algorithms in real-time.

Optimization using evolutionary metaheuristic techniques: a brief review

Optimization is necessary for finding appropriate solutions to a range of real life problems. Evolutionary-approach-based meta-heuristics have gained prominence in recent years for solving Multi Objective Optimization Problems (MOOP). Multi Objective Evolutionary Approaches (MOEA) has substantial success across a variety of real-world engineering applications. The present paper attempts to provide a general overview of a few selected algorithms, including genetic algorithms, ant colony optimization, particle swarm optimization, and simulated annealing techniques. Additionally, the review is extended to present differential evolution and teaching-learning-based optimization. Few applications of the said algorithms are also presented. This review intends to serve as a reference for further work in this domain.