Integrating continuous differential evolution with discrete local search for meander line RFID antenna design

The automated design of meander line RFID antennas is a discrete self-avoiding walk(SAW) problem for which efficiency is to be maximized while resonant frequency is to beminimized. This work presents a novel exploration of how discrete local search may beincorporated into a continuous solver such as differential evolution (DE). A prior DE algorithmfor this problem that incorporates an adaptive solution encoding and a bias favoringantennas with low resonant frequency is extended by the addition of the backbite localsearch operator and a variety of schemes for reintroducing modified designs into the DEpopulation. The algorithm is extremely competitive with an existing ACO approach and thetechnique is transferable to other SAW problems and other continuous solvers. The findingsindicate that careful reintegration of discrete local search results into the continuous populationis necessary for effective performance

Adaptive multimodal continuous ant colony optimization

Seeking multiple optima simultaneously, which multimodal optimization aims at, has attracted increasing attention but remains challenging. Taking advantage of ant colony optimization algorithms in preserving high diversity, this paper intends to extend ant colony optimization algorithms to deal with multimodal optimization. First, combined with current niching methods, an adaptive multimodal continuous ant colony optimization algorithm is introduced. In this algorithm, an adaptive parameter adjustment is developed, which takes the difference among niches into consideration. Second, to accelerate convergence, a differential evolution mutation operator is alternatively utilized to build base vectors for ants to construct new solutions. Then, to enhance the exploitation, a local search scheme based on Gaussian distribution is self-adaptively performed around the seeds of niches. Together, the proposed algorithm affords a good balance between exploration and exploitation. Extensive experiments on 20 widely used benchmark multimodal functions are conducted to investigate the influence of each algorithmic component and results are compared with several state-of-the-art multimodal algorithms and winners of competitions on multimodal optimization. These comparisons demonstrate the competitive efficiency and effectiveness of the proposed algorithm, especially in dealing with complex problems with high numbers of local optima

Analyzing the Scalability Performance of Crossover-First and Self-Adaptive Differential Evolution Algorithms for Complex Numerical Optimization

Two Crossover-first Differential Evolution (XDE) algorithms as well as four self-adaptive DE algorithms are compared in this study in terms of their optimization accuracy for solving a set of 15 complex, non-linear numerical optimization functions across 4 different dimensions of 10, 30, 50 and 100 optimization variables. XDE is a crossover-first variant of the original DE algorithm where XjDE is the crossover-first variant of the self-adaptive jDE algorithm. The original DE representing a fixed parameter strategy is tested against four self-adaptive algorithms, namely the DESACR, DESACRF, SDE and jDE algorithms. Although XDE is able to outperform XjDE in all 15 test problems for the lowest dimensional benchmark test setting of 10 variables, the crossover-first approach in XjDE is able to improve its performance and obtained better results over XDE in some of the test problems for the higher-dimensional benchmark test settings of 30, 50 and 100 variables. As such, this shows that there is some merit in adopting the crossover-first approach into the self-adaptive XjDE algorithm since the CR and F parameters are automatically adjusted and optimized by the algorithm itself as compared to the fixed CR and F in XDE which has to be manually tuned by hand. The results also show that different self-adaptive parameter tuning schemes have significantly different effects on the performance of DE as the number of optimization dimensions increases

Synthesis of Coupling Matrix for Diplexers Based on a Self-adaptive Differential Evolution Algorithm

Diplexer coupling matrix synthesis often involves both analytical methods and optimization techniques. At present, general purpose optimization algorithms are used, but they need strong supporting information (e.g., high-quality starting points and very narrow search ranges) from analytical methods, which is not available or too complex to be obtained in many cases. Aiming to obtain the desired coupling matrix with highly reduced supporting information to relieve the pressure of analytical methods, a new optimization algorithm, called self-adaptive differential evolution for coupling matrix synthesis (SADEC), is proposed. Considering the landscape characteristics of diplexer coupling matrix synthesis problems, a new self-adaptive multipopulation search framework and a self-adaptive algorithm parameter control strategy are proposed and organized in a particular way. The performance of SADEC is demonstrated by two all-resonator-based narrowband diplexers using large search ranges only with the requirement of matching the diplexer topology and no ad hoc analysis is included. Experiments and comparisons show the high performance of SADEC and clear advantages compared with the state-of-the-art global optimization methods. SADEC is also applicable to filter coupling matrix synthesis and is downloadable

Differential evolution with an evolution path: a DEEP evolutionary algorithm

Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs

Study and analysis of the use of flexibility in local electricity markets

In this work an introduction to Local Electricity Markets (LEM) was done and afterwards evolutionary algorithms (EAs) such as Differential Evolution (DE), HybridAdaptive Differential Evolution (HyDE), Hybrid-Adaptive Differential Evolution with Decay Function (HyDE-DF) and Vortex Search (VS) were applied to a market model in order to test its efficiency and scalability. Then, the market model was expanded adding a network model from the BISITE laboratory and again tests using the evolutionary algorithms were performed. In more detail, first a literature review is done about distributed generation, load flexibility, LEM and EAs. Then a cost optimization problem in Local Electricity Markets is analyzed considering fixed-term flexibility contracts between the distribution system operator (DSO) and aggregators. In this market structure, the DSO procures flexibility while aggregators of different types (e.g., conventional demand response or thermo-load aggregators) offer the service. Its then solved the proposed model using evolutionary algorithms based on the well-known differential evolution (DE). First, a parameter-tuning analysis is done to assess the impact of the DE parameters on the quality of solutions to the problem. Later, after finding the best set of parameters for the “tuned” DE strategies, we compare their performance with other self-adaptive parameter algorithms, namely the HyDE, HyDE-DF, and VS. Overall, the algorithms are able to find near-optimal solutions to the problem and can be considered an alternative solver for more complex instances of the model. After this a network model, from BISITE laboratory, is added to the problem and new analyses are performed using evolutionary algorithms along with MATPOWER power flow algorithms. Results show that evolutionary algorithms support from simple to complex problems, that is, it is a scalable algorithm, and with these results it is possible to perform analyses of the proposed market model.Neste trabalho foi feita uma introdução aos Mercados Locais de Eletricidade (MLE) e posteriormente foram aplicados algoritmos evolutivos (AEs) como Differential Evolution (DE), Hybrid-Adaptive Differential Evolution (HyDE), Hybrid-Adaptive Differential Evolution with Decay Function (HyDE-DF) e Vortex Search (VS) a um modelo de mercado a fim de testar a sua eficiência e escalabilidade. O modelo de mercado foi expandido adicionando uma rede do laboratório BISITE e novamente foram realizados testes usando os algoritmos evolutivos. Em mais detalhe, no trabalho primeiro foi feita uma revisão bibliográfica sobre geração distribuída, flexibilidade de carga, MLE e AEs. É analisado um problema de optimização de custos nos MLE, considerando contratos de flexibilidade a prazo fixo entre os agentes. O distribuidor adquire flexibilidade enquanto que os agregadores de diferentes tipos (por exemplo, os agregadores convencionais de resposta à procura ou de carga térmica) oferecem o serviço. Resolve-se depois o modelo proposto utilizando AEs baseados na conhecida DE. É feita uma análise de afinação de parâmetros para avaliar o impacto dos parâmetros DE na qualidade das soluções para o problema. Após encontrarmos o melhor conjunto de parâmetros para as estratégias DE "afinadas", comparamos o seu desempenho com outros algoritmos de parâmetros autoadaptáveis, nomeadamente o HyDE, HyDE-DF, e VS. Globalmente, os algoritmos são capazes de encontrar soluções quase óptimas para o problema e podem ser considerados um solucionador alternativo para instâncias mais complexas do modelo. Então um modelo de rede, do laboratório BISITE, é acrescentado ao problema e novas análises são realizadas utilizando algoritmos evolutivos juntamente com algoritmos de fluxo de potência MATPOWER. Os resultados mostram que os algoritmos evolutivos suportam desde problemas simples a complexos, ou seja, é um algoritmo escalável, e com estes resultados é possível realizar análises do modelo de mercado proposto