A new reinforcement learning-based memetic particle swarm optimizer

Developing an effective memetic algorithm that integrates the Particle Swarm Optimization (PSO) algorithm and a local search method is a difficult task. The challenging issues include when the local search method should be called, the frequency of calling the local search method, as well as which particle should undergo the local search operations. Motivated by this challenge, we introduce a new Reinforcement Learning-based Memetic Particle Swarm Optimization (RLMPSO) model. Each particle is subject to five operations under the control of the Reinforcement Learning (RL) algorithm, i.e. exploration, convergence, high-jump, low-jump, and fine-tuning. These operations are executed by the particle according to the action generated by the RL algorithm. The proposed RLMPSO model is evaluated using four uni-modal and multi-modal benchmark problems, six composite benchmark problems, five shifted and rotated benchmark problems, as well as two benchmark application problems. The experimental results show that RLMPSO is useful, and it outperforms a number of state-of-the-art PSO-based algorithms.

A GA-PSO layered encoding evolutionary approach to 0/1 knapsack optimization

This paper presents a layered encoding cascade evolutionary approach to solve a 0/1 knapsack optimization problem. A layered encoding structure is proposed and developed based on the schema theorem and the concepts of cascade correlation and multi-population evolutionary algorithms. Genetic algorithm (GA) and particle swarm optimization (PSO) are combined with the proposed layered encoding structure to form a generic optimization model denoted as LGAPSO. In order to enhance the finding of both local and global optimum in the evolutionary search, the model adopts hill climbing evaluation criteria, feature of strength Pareto evolutionary approach (SPEA) as well as nondominated spread lengthen criteria. Four different sizes benchmark knapsack problems are studied using the proposed LGAPSO model. The performance of LGAPSO is compared to that of the ordinary multi-objective optimizers such as VEGA, NSGA, NPGA and SPEA. The proposed LGAPSO model is shown to be efficient in improving the search of knapsack’s optimum, capable of gaining better Pareto trade-off front.

An interactive evolutionary algorithm for MMIC low noise amplifier design

A layer-encoded interactive evolutionary algorithm (IEA) for optimization of design parameters of a monolithic microwave integrated circuit (MMIC) low noise amplifier is presented. The IEA comprises a combination of the genetic algorithm (GA) and the particle swarm optimization (PSO) technique. The layer-encoding structure allows human intervention in order to accelerate the process of evolution, whereas the GA and PSO technique are incorporated to enhance both global and local searches. With this combination of features, the proposed IEA has shown to be efficient in meeting all requirements and constraints of the MMIC. In addition, the IEA is able to optimize noise figure, current, and power gain of the MMIC amplifier design.

A layered-encoding cascade optimization approach to product-mix planning in high-mix-low-volume manufacturing

High-mix-low-volume (HMLV) production is currently a worldwide manufacturing trend. It requires a high degree of customization in the manufacturing process to produce a wide range of products in low quantity in order to meet customers' demand for more variety and choices of products. Such a kind of business environment has increased the conversion time and decreased the production efficiency due to frequent production changeover. In this paper, a layered-encoding cascade optimization (LECO) approach is proposed to develop an HMLV product-mix optimizer that exhibits the benefits of low conversion time, high productivity, and high equipment efficiency. Specifically, the genetic algorithm (GA) and particle swarm optimization (PSO) techniques are employed as optimizers for different decision layers in different LECO models. Each GA and PSO optimizer is studied and compared. A number of hypothetical and real data sets from a manufacturing plant are used to evaluate the performance of the proposed GA and PSO optimizers. The results indicate that, with a proper selection of the GA and PSO optimizers, the LECO approach is able to generate high-quality product-mix plans to meet the production demands in HMLV manufacturing environments.

Wind-thermal systems operation optimization considering emission problem

This paper proposes a hybrid computational framework based on Sequential Quadratic Programming (SQP) and Particle Swarm Optimization (PSO) to address the Combined Unit Commitment and Emission (CUCE) problem. By considering a model which includes both thermal generators and wind farms, the proposed hybrid computational framework can minimize the scheduling cost and greenhouse gases emission cost. The viability of the proposed hybrid technique is demonstrated using a set of numerical case studies. Moreover, comparisons are performed with other optimization algorithms. The simulation results show that our hybrid method is better in terms of the speed and accuracy. The main contribution of this paper is the development of a emission unit commitment model integrating with wind energy and combining the SQP and PSO methods to achieve faster and better performance optimization

Structure and thickness optimization of active layer in nanoscale organic solar cells

 This paper presents the development of a two-dimensional model of multilayer bulk heterojunction organic nanoscale solar cells, consisting of the thickness of active layer and morphology of the device. The proposed model is utilized to optimize the device parameters in order to achieve the best performance using particle swarm optimization algorithm. The organic solar cells under research are from poly (3-hexylthiophene) and [6,6]-phenyl C61-butyric acid methyl ester type which are modelled to be investigated for performance enhancement. A three-dimensional fitness function is proposed involving domain size and active layer thickness as variables. The best results out of 20 runs of optimization show that the optimized value for domain size is 17 nm, while the short-circuit current vs. voltage characteristic shows a very good agreement with the experimental results obtained by previous researchers. © 2014 Springer Science+Business Media New York

Effectiveness of evolutionary algorithms for optimization of heat exchangers

This paper comprehensively investigates performance of evolutionary algorithms for design optimization of shell and tube heat exchangers (STHX). Genetic algorithm (GA), firefly algorithm (FA), and cuckoo search (CS) method are implemented for finding the optimal values for seven key design variables of the STHX model. ε-NTU method and Bell-Delaware procedure are used for thermal modeling of STHX and calculation of shell side heat transfer coefficient and pressure drop. The purpose of STHX optimization is to maximize its thermal efficiency. Obtained results for several simulation optimizations indicate that GA is unable to find permissible and optimal solutions in the majority of cases. In contrast, design variables found by FA and CS always lead to maximum STHX efficiency. Also computational requirements of CS method are significantly less than FA method. As per optimization results, maximum efficiency (83.8%) can be achieved using several design configurations. However, these designs are bearing different dollar costs. Also it is found that the behavior of the majority of decision variables remains consistent in different runs of the FA and CS optimization processes.

Simulation and hardware implementation of new maximum power point tracking technique for partially shaded PV system using hybrid DEPSO method

In photovoltaic (PV) power generation, partial shading is an unavoidable complication that significantly reduces the efficiency of the overall system. Under this condition, the PV system produces a multiple-peak function in its output power characteristic. Thus, a reliable technique is required to track the global maximum power point (GMPP) within an appropriate time. This study aims to employ a hybrid evolutionary algorithm called the DEPSO technique, a combination of the differential evolutionary (DE) algorithm and particle swarm optimization (PSO), to detect the maximum power point under partial shading conditions. The paper starts with a brief description about the behavior of PV systems under partial shading conditions. Then, the DEPSO technique along with its implementation in maximum power point tracking (MPPT) is explained in detail. Finally, Simulation and experimental results are presented to verify the performance of the proposed technique under different partial shading conditions. Results prove the advantages of the proposed method, such as its reliability, system-independence, and accuracy in tracking the GMPP under partial shading conditions.

Underwater swarm robotics review

Underwater robotics is a growing field in which more research is required. A literature review has been conducted on underwater robotics, focusing on the swarm problem with this type of robotics to help overcome this gap. Consensus control of robotic swarms is focused on, with a brief description of formation control and how it can be applied in the underwater setting. The basic concepts behind Particle Swarm Optimization, Ant Colony Optimization, Bees Algorithm and Heterogeneous Swarms has also been presented. The problems that are associated with communicating underwater are shown, with some possible solutions to this problem also being presented. Possible future work is described to conclude the paper.

An efficient meta-heuristic algorithm for grid computing

A grid computing system consists of a group of programs and resources that are spread across machines in the grid. A grid system has a dynamic environment and decentralized distributed resources, so it is important to provide efficient scheduling for applications. Task scheduling is an NP-hard problem and deterministic algorithms are inadequate and heuristic algorithms such as particle swarm optimization (PSO) are needed to solve the problem. PSO is a simple parallel algorithm that can be applied in different ways to resolve optimization problems. PSO searches the problem space globally and needs to be combined with other methods to search locally as well. In this paper, we propose a hybrid-scheduling algorithm to solve the independent task- scheduling problem in grid computing. We have combined PSO with the gravitational emulation local search (GELS) algorithm to form a new method, PSO–GELS. Our experimental results demonstrate the effectiveness of PSO–GELS compared to other algorithms.

Mixing Matrix Estimation From Sparse Mixtures With Unknown Number of Sources

In blind source separation, many methods have been proposed to estimate the mixing matrix by exploiting sparsity. However, they often need to know the source number a priori, which is very inconvenient in practice. In this paper, a new method, namely nonlinear projection and column masking (NPCM), is proposed to estimate the mixing matrix. A major advantage of NPCM is that it does not need any knowledge of the source number. In NPCM, the objective function is based on a nonlinear projection and its maxima just correspond to the columns of the mixing matrix. Thus a column can be estimated first by locating a maximum and then deflated by a masking operation. This procedure is repeated until the evaluation of the objective function decreases to zero dramatically. Thus the mixing matrix and the number of sources are estimated simultaneously. Because the masking procedure may result in some small and useless local maxima, particle swarm optimization (PSO) is introduced to optimize the objective function. Feasibility and efficiency of PSO are also discussed. Comparative experimental results show the efficiency of NPCM, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.

Short-term load and wind power forecasting using neural network-based prediction intervals

Electrical power systems are evolving from today's centralized bulk systems to more decentralized systems. Penetrations of renewable energies, such as wind and solar power, significantly increase the level of uncertainty in power systems. Accurate load forecasting becomes more complex, yet more important for management of power systems. Traditional methods for generating point forecasts of load demands cannot properly handle uncertainties in system operations. To quantify potential uncertainties associated with forecasts, this paper implements a neural network (NN)-based method for the construction of prediction intervals (PIs). A newly introduced method, called lower upper bound estimation (LUBE), is applied and extended to develop PIs using NN models. A new problem formulation is proposed, which translates the primary multiobjective problem into a constrained single-objective problem. Compared with the cost function, this new formulation is closer to the primary problem and has fewer parameters. Particle swarm optimization (PSO) integrated with the mutation operator is used to solve the problem. Electrical demands from Singapore and New South Wales (Australia), as well as wind power generation from Capital Wind Farm, are used to validate the PSO-based LUBE method. Comparative results show that the proposed method can construct higher quality PIs for load and wind power generation forecasts in a short time.

Construction of neural network-based prediction intervals for short-term electrical load forecasting

Short-term load forecasting (STLF) is of great importance for control and scheduling of electrical power systems. The uncertainty of power systems increases due to the random nature of climate and the penetration of the renewable energies such as wind and solar power. Traditional methods for generating point forecasts of load demands cannot properly handle uncertainties in datasets. To quantify these potential uncertainties associated with forecasts, this paper implements a neural network (NN)-based method for construction of prediction intervals (PIs). A newly proposed method, called lower upper bound estimation (LUBE), is applied to develop PIs using NN models. The primary multi-objective problem is firstly transformed into a constrained single-objective problem. This new problem formulation is closer to the original problem and has fewer parameters than the cost function. Particle swarm optimization (PSO) integrated with the mutation operator is used to solve the problem. Two case studies from Singapore and New South Wales (Australia) historical load datasets are used to validate the PSO-based LUBE method. Demonstrated results show that the proposed method can construct high quality PIs for load forecasting applications.

Uncertainty handling using neural network-based prediction intervals for electrical load forecasting

The complexity and level of uncertainty present in operation of power systems have significantly grown due to penetration of renewable resources. These complexities warrant the need for advanced methods for load forecasting and quantifying uncertainties associated with forecasts. The objective of this study is to develop a framework for probabilistic forecasting of electricity load demands. The proposed probabilistic framework allows the analyst to construct PIs (prediction intervals) for uncertainty quantification. A newly introduced method, called LUBE (lower upper bound estimation), is applied and extended to develop PIs using NN (neural network) models. The primary problem for construction of intervals is firstly formulated as a constrained single-objective problem. The sharpness of PIs is treated as the key objective and their calibration is considered as the constraint. PSO (particle swarm optimization) enhanced by the mutation operator is then used to optimally tune NN parameters subject to constraints set on the quality of PIs. Historical load datasets from Singapore, Ottawa (Canada) and Texas (USA) are used to examine performance of the proposed PSO-based LUBE method. According to obtained results, the proposed probabilistic forecasting method generates well-calibrated and informative PIs. Furthermore, comparative results demonstrate that the proposed PI construction method greatly outperforms three widely used benchmark methods. © 2014 Elsevier Ltd.

A hybrid cuckoo search and variable neighborhood descent for single and multiobjective scheduling problems

Cuckoo search (CS) is a relatively new meta-heuristic that has proven its strength in solving continuous optimization problems. This papers applies cuckoo search to the class of sequencing problems by hybridizing it with a variable neighborhood descent local search for enhancing the quality of the obtained solutions. The Lévy flight operator proposed in the original CS is modified to address the discrete nature of scheduling problems. Two well-known problems are used to demonstrate the effectiveness of the proposed hybrid CS approach. The first is the NP-hard single objective problem of minimizing the weighted total tardiness time (Formula presented.) and the second is the multiobjective problem of minimizing the flowtime ¯ and the maximum tardiness Tmaxfor single machine (Formula presented.). For the first problem, computational results show that the hybrid CS is able to find the optimal solutions for all benchmark test instances with 40, 50, and 100 jobs and for most instances with 150, 200, 250, and 300 jobs. For the second problem, the hybrid CS generated solutions on and very close to the exact Pareto fronts of test instances with 10, 20, 30, and 40 jobs. In general, the results reveal that the hybrid CS is an adequate and robust method for tackling single and multiobjective scheduling problems.