Genetic learning particle swarm optimization

Social learning in particle swarm optimization (PSO) helps collective efficiency, whereas individual reproduction in genetic algorithm (GA) facilitates global effectiveness. This observation recently leads to hybridizing PSO with GA for performance enhancement. However, existing work uses a mechanistic parallel superposition and research has shown that construction of superior exemplars in PSO is more effective. Hence, this paper first develops a new framework so as to organically hybridize PSO with another optimization technique for “learning.” This leads to a generalized “learning PSO” paradigm, the *L-PSO. The paradigm is composed of two cascading layers, the first for exemplar generation and the second for particle updates as per a normal PSO algorithm. Using genetic evolution to breed promising exemplars for PSO, a specific novel *L-PSO algorithm is proposed in the paper, termed genetic learning PSO (GL-PSO). In particular, genetic operators are used to generate exemplars from which particles learn and, in turn, historical search information of particles provides guidance to the evolution of the exemplars. By performing crossover, mutation, and selection on the historical information of particles, the constructed exemplars are not only well diversified, but also high qualified. Under such guidance, the global search ability and search efficiency of PSO are both enhanced. The proposed GL-PSO is tested on 42 benchmark functions widely adopted in the literature. Experimental results verify the effectiveness, efficiency, robustness, and scalability of the GL-PSO

A three-stage optimization methodology for envelope design of passive house considering energy demand, thermal comfort and cost

Due to reducing the reliance of buildings on fossil fuels, Passive House (PH) is receiving more and more attention. It is important that integrated optimization of passive performance by considering energy demand, cost and thermal comfort. This paper proposed a set three-stage multi-objective optimization method that combines redundancy analysis (RDA), Gradient Boosted Decision Trees (GBDT) and Non-dominated sorting genetic algorithm (NSGA-II) for PH design. The method has strong engineering applicability, by reducing the model complexity and improving efficiency. Among then, the GBDT algorithm was first applied to the passive performance optimization of buildings, which is used to build meta-models of building performance. Compared with the commonly used meta-model, the proposed models demonstrate superior robustness with the standard deviation at 0.048. The optimization results show that the energy-saving rate is about 88.2% and the improvement of thermal comfort is about 37.8% as compared to the base-case building. The economic analysis, the payback period were used to integrate initial investment and operating costs, the minimum payback period and uncomfortable level of Pareto frontier solution are 0.48 years and 13.1%, respectively. This study provides the architects rich and valuable information about the effects of the parameters on the different building performance

Decision system based on neural networks to optimize the energy efficiency of a petrochemical plant

The energy efficiency of industrial plants is an important issue in any type of business but particularly in the chemical industry. Not only is it important in order to reduce costs, but also it is necessary even more as a means of reducing the amount of fuel that gets wasted, thereby improving productivity, ensuring better product quality, and generally increasing profits. This article describes a decision system developed for optimizing the energy efficiency of a petrochemical plant. The system has been developed after a data mining process of the parameters registered in the past. The designed system carries out an optimization process of the energy efficiency of the plant based on a combined algorithm that uses the following for obtaining a solution: On the one hand, the energy efficiency of the operation points occurred in the past and, on the other hand, a module of two neural networks to obtain new interpolated operation points. Besides, the work includes a previous discriminant analysis of the variables of the plant in order to select the parameters most important in the plant and to study the behavior of the energy efficiency index. This study also helped ensure an optimal training of the neural networks. The robustness of the system as well as its satisfactory results in the testing process (an average rise in the energy efficiency of around 7%, reaching, in some cases, up to 45%) have encouraged a consulting company (ALIATIS) to implement and to integrate the decision system as a pilot software in an SCADA

An Expert System to Improve the Energy Efficiency of the Reaction Zone of a Petrochemical Plant

Energy is the most important cost factor in the petrochemical industry. Thus, energy efficiency improvement is an important way to reduce these costs and to increase predictable earnings, especially in times of high energy price volatility. This work describes the development of an expert system for the improvement of this efficiency of the reaction zone of a petrochemical plant. This system has been developed after a data mining process of the variables registered in the plant. Besides, a kernel of neural networks has been embedded in the expert system. A graphical environment integrating the proposed system was developed in order to test the system. With the application of the expert system, the energy saving on the applied zone would have been about 20%.Junta de Andalucía TIC-570

Decoder-in-the-Loop: Genetic Optimization-based LDPC Code Design

LDPC code design tools typically rely on asymptotic code behavior and are affected by an unavoidable performance degradation due to model imperfections in the short length regime. We propose an LDPC code design scheme based on an evolutionary algorithm, the Genetic Algorithm (GenAlg), implementing a "decoder-in-the-loop" concept. It inherently takes into consideration the channel, code length and the number of iterations while optimizing the error-rate of the actual decoder hardware architecture. We construct short length LDPC codes (i.e., the parity-check matrix) with error-rate performance comparable to, or even outperforming that of well-designed standardized short length LDPC codes over both AWGN and Rayleigh fading channels. Our proposed algorithm can be used to design LDPC codes with special graph structures (e.g., accumulator-based codes) to facilitate the encoding step, or to satisfy any other practical requirement. Moreover, GenAlg can be used to design LDPC codes with the aim of reducing decoding latency and complexity, leading to coding gains of up to $0.325$ dB and $0.8$ dB at BLER of $10^{-5}$ for both AWGN and Rayleigh fading channels, respectively, when compared to state-of-the-art short LDPC codes. Also, we analyze what can be learned from the resulting codes and, as such, the GenAlg particularly highlights design paradigms of short length LDPC codes (e.g., codes with degree-1 variable nodes obtain very good results).Comment: in IEEE Access, 201

Planning as Optimization: Dynamically Discovering Optimal Configurations for Runtime Situations

The large number of possible configurations of modern software-based systems, combined with the large number of possible environmental situations of such systems, prohibits enumerating all adaptation options at design time and necessitates planning at run time to dynamically identify an appropriate configuration for a situation. While numerous planning techniques exist, they typically assume a detailed state-based model of the system and that the situations that warrant adaptations are known. Both of these assumptions can be violated in complex, real-world systems. As a result, adaptation planning must rely on simple models that capture what can be changed (input parameters) and observed in the system and environment (output and context parameters). We therefore propose planning as optimization: the use of optimization strategies to discover optimal system configurations at runtime for each distinct situation that is also dynamically identified at runtime. We apply our approach to CrowdNav, an open-source traffic routing system with the characteristics of a real-world system. We identify situations via clustering and conduct an empirical study that compares Bayesian optimization and two types of evolutionary optimization (NSGA-II and novelty search) in CrowdNav