A Population-Based Incremental Learning Algorithm with Elitist Strategy

The treatment of left turns at signalized intersections drives the development of signal phasing and timing plans and also plays an important role in overall traffic network operations. Accommodating left turns allows for the most direct routeing but reduces intersection capacity, whereas restricting left turns improves capacity but requires some vehicles to travel longer distances. This paper proposes a population-based incremental learning (PBIL) algorithm to determine at which intersections left-turn restrictions should be enacted to maximize a network's operational performance. The performance of each configuration is tested in a micro-simulation environment on both perfect and imperfect square grid networks. Comparison with a partial enumeration of feasible options reveals that the PBIL algorithm is effective at identifying a near-optimal configuration of left-turn restrictions. The resulting configurations suggest that left turns should be generally restricted at intersections that carry the most flow. These intersections typically occur in the central portion of the network when demands are relatively uniform. Doing so helps to provide additional intersection capacity at the locations where it is most necessary, while minimizing the additional travel distance that is incurred due to detours caused by the left-turn restrictions. These provide insight as to how urban traffic networks might be managed to improve network efficiency by only enacting left-turn restrictions at a subset of locations.

A hybrid algorithm (HA) based on population based incremental learning (PBIL) algorithm and zooming algorithm (ZA) is proposed, and its convergence is proved in this paper. In the hybrid algorithm, PBIL algorithm is employed for the evolutionary process as it can accelerate the convergence speed by a reduced time complexity, zooming algorithm is used to improve the PBIL algorithm as it can reduce search space on a large scale, and develop the convergence speed and the precision of solution obviously. The convergent analysis shows that if the population is big, and the parameters are proper, the hybrid algorithm converges to the global optimal solution.

Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper.

Population-based incremental learning (PBIL) has been recently applied to a range of optimization problems in controller designs with promising results. It combines aspects of genetic algorithm with competitive learning. The learning rate in the standard PBIL is generally fixed which makes it difficult for the algorithm to explore the search space effectively. In this paper, the standard PBIL is improved by using a combination of adaptive and fixed learning rate that varies according to the generation. The adaptive-fixed (AF) algorithm can adjust the learning rate automatically according to the degree of evolution of the search. The objective of the power system stabilizer (PSS) design is to achieve adequate stability over a wide range of power system operating conditions. The proposed controller is compared with conventional PBIL with fixed learning rate (PBIL) and tested under various operating conditions. Simulation results show that the AFPBIL based PSS provides a more efficient search capability and gives a better damping and adequate dynamic performance of the system than the conventional PBIL based PSS.

The convergence analysis and specification of the Population-Based Incremental Learning algorithm

Performance evaluation of power system stabilizers based on Population-Based Incremental Learning (PBIL) algorithm

Recently, genetic algorithms (GAs) have attracted great interest owing to efficiency and flexibility against complex robot path planning problems. To accelerate the convergence speed, preceding researches adapted conventional GAs by using problem-specific techniques. However, such approaches increase computational burden and algorithmic complexity, resulting in subsequent additional problems. In this paper, we used Population-Based Incremental Learning (PBIL) algorithm for robot path planning as a probabilistic evolutionary approach. In addition to PBIL, we also proposed the probabilistic model of nodes and the edge bank to generate promising paths. The experimental results demonstrate that the proposed method gave markedly better performance than its conventional counter-parts(GA,kGA,fGA) in terms of success rates and the quality of obtained paths.

In this paper we study two different meta-heuristics to solve a real-word frequency assignment problem (FAP) in GSM networks. We have used a precise mathematical formulation in which the frequency plans are evaluated using accurate interference information coming from a real GSM network. We have developed an improved version of the scatter search (SS) algorithm in order to solve this problem. After accurately tuning this algorithm, it has been compared with a version fixed for the FAP problem of the population-based incremental learning (PBIL) algorithm. The results show that SS obtains better frequency plannings than PBIL for all the experiments performed.

Traffic supervision in telephone networks is a task which needs to determine streams responsible for call losses in a network by comparing their traffic values to nominal values. However, stream traffic values are not measured by the on-line data acquisition system and, hence, have to be computed. We perform this computation by inverting an approximate knowledge based model of stream propagation in circuit-switched networks. This inversion is computed thanks to three evolutionary computation techniques (multiple restart hill-climbing, population-based incremental learning and genetic algorithms) for which both a binary version and a real variant have been experimented with several fitness measures. The final results first point out how the fitness measure choice can impact on their quality. They also show that, in this case, real variants of the algorithms give significantly better results than binary ones.

Development without any defect is unsubstantial. Timely detection of software defects favors the proper resource utilization saving time, effort and money. With the increasing size and complexity of software, demand for accurate and efficient prediction models is increasing. Recently, search-based techniques (SBTs) have fascinated many researchers for Software Defect Prediction (SDP). The goal of this study is to conduct an empirical evaluation to assess the applicability of SBTs for predicting software defects in object-oriented (OO) softwares. In this study, 16 SBTs are exploited to build defect prediction models for 13 OO software projects. Stable performance measures — GMean, Balance and Receiver Operating Characteristic-Area Under Curve (ROC-AUC) are employed to probe into the predictive capability of developed models, taking into consideration the imbalanced nature of software datasets. Proper measures are taken to handle the stochastic behavior of SBTs. The significance of results is statistically validated using the Friedman test complied with Wilcoxon post hoc analysis. The results confirm that software defects can be detected in the early phases of software development with help of SBTs. This paper identifies the effective subset of SBTs that will aid software practitioners to timely detect the probable software defects, therefore, saving resources and bringing up good quality softwares. Eight SBTs — sUpervised Classification System (UCS), Bioinformatics-oriented hierarchical evolutionary learning (BIOHEL), CHC, Genetic Algorithm-based Classifier System with Adaptive Discretization Intervals (GA_ADI), Genetic Algorithm-based Classifier System with Intervalar Rule (GA_INT), Memetic Pittsburgh Learning Classifier System (MPLCS), Population-Based Incremental Learning (PBIL) and Steady-State Genetic Algorithm for Instance Selection (SGA) are found to be statistically good defect predictors.

This article deals with the comparative performance of some established multi-objective evolutionary algorithms (MOEAs) for structural topology optimization. Four multi-objective problems, having design objectives like structural compliance, natural frequency and mass, and subjected to constraints on stress, etc., are posed for performance testing. The MOEAs include Pareto archive evolution strategy (PAES), population-based incremental learning (PBIL), non-dominated sorting genetic algorithm (NSGA), strength Pareto evolutionary algorithm (SPEA), and multi-objective particle swarm optimization (MPSO). The various MOEAs are implemented to solve the problems. The ground element filtering (GEF) technique is used to suppress checkerboard patterns on topologies. The results obtained from the various optimizers are illustrated and compared. It is shown that PBIL is far superior to the others. The optimal topologies from using PBIL can be compared with those obtained by employing the classical gradient-based approach. It can be considered as a powerful tool for structural topological design.

As an alternative to traditional evolutionary algorithms (EAs), population-based incremental learning (PBIL) maintains a probabilistic model of the best individual(s). Originally, PBIL was applied in binary search spaces. Recently, some work has been done to extend it to continuous spaces. In this paper, we review two such extensions of PBIL. An improved version of the PBIL based on Gaussian model is proposed that combines two main features: a new updating rule that takes into account all the individuals and their fitness values and a self-adaptive learning rate parameter. Furthermore, a new continuous PBIL employing a histogram probabilistic model is proposed. Some experiments results are presented that highlight the features of the new algorithms.

Relay communication networks increase the spectral efficiency and remote availability with the support of Multiple-Input Multiple-Output (MIMO). Channel estimation in the MIMO relay communication networks is mandatory to enhance the represented capabilities. Hence, developing channel estimation approaches in MIMO relay communication networks is one of the noteworthy aspects of recent researches. Besides, compressed sensing (CS) as a spectral efficient signal processing approach is attractive for estimators. Hence, in this paper, we have used CS based channel estimation method to improve the accuracy and spectral efficiency of channel estimation for MIMO-OFDM relay network. As represented, having a proper pilot allocation will increase the efficiency, and to this end, we are encountered with a combinatorial optimization which is dealt with Geometrical Differential Evolution (GDE) and Population-Based Incremental Learning (PBIL) in this paper. These are population-based evolutionary optimization. GDE is utilized for its speed and accuracy of convergence. Besides, PBIL is used for its probability nature which makes it capable of escaping from local minimum trapping. The illustrated result of simulations represents the superiority of the proposed methods in defining the pilot allocation sequences.

In this paper, we introduce a dynamic variant of the Location-Allocation problem: Dynamic Location-Allocation Problem (DULAP). DULAP involves the location of facilities to service a set of customer demands over a defined horizon. To evaluate a solution to DULAP, we propose two holistic metric approaches: Static and Dynamic Approach. In the static approach, a solution is evaluated with the assumption that customer locations and demand remain constant over a defined horizon. In the dynamic approach, the assumption is made that customer demand, and demographic pattern may change over the defined horizon. We introduce a stochastic model to simulate customer population and distribution over time. We use a Genetic Algorithm and Population-Based Incremental Learning algorithm used in previous work to find robust and satisfactory solutions to DULAP. Results show the dynamic approach of evaluating a solution finds good and robust solutions.

Finding interactions among genes is one of the main problems in molecular biology. In this paper, we use a novel approach to model the gene's regulations, or Gene Regulatory Networks (GRNs). We use a Recursive Neural Network (RNN) to model the networks, and then use Population Based Incremental Learning (PBIL) enhanced with K-means to find the optimum parameters of the Neural Network. We present experiments with real data, we compare our algorithm with others approaches by calculating different statistics for the solutions.