scholarly journals STPGA: Selection of training populations with a genetic algorithm

2017 ◽  
Author(s):  
Deniz Akdemir
Keyword(s):  
Genetic Algorithm ◽  
Variable Selection ◽  
Optimization Problems ◽  
Subset Selection ◽  
Breeding Population ◽  
Mixed Integer ◽  
Optimal Subset ◽  
Look Ahead ◽  
Selection Of ◽  
The Ideal

AbstractOptimal subset selection is an important task that has numerous algorithms designed for it and has many application areas. STPGA contains a special genetic algorithm supplemented with a tabu memory property (that keeps track of previously tried solutions and their fitness for a number of iterations), and with a regression of the fitness of the solutions on their coding that is used to form the ideal estimated solution (look ahead property) to search for solutions of generic optimal subset selection problems. I have initially developed the programs for the specific problem of selecting training populations for genomic prediction or association problems, therefore I give discussion of the theory behind optimal design of experiments to explain the default optimization criteria in STPGA, and illustrate the use of the programs in this endeavor. Nevertheless, I have picked a few other areas of application: supervised and unsupervised variable selection based on kernel alignment, supervised variable selection with design criteria, influential observation identification for regression, solving mixed integer quadratic optimization problems, balancing gains and inbreeding in a breeding population. Some of these illustrations pertain new statistical approaches.

Optimization of Real Power Loss and Voltage Stability Index for Distribution Systems with Distributed Generation

2017 ◽  
Vol 33 ◽  
pp. 100-114 ◽  
Author(s):  
Mostafa Elshahed ◽  
Mahmoud Dawod ◽  
Zeinab H. Osman
Keyword(s):  
Genetic Algorithm ◽  
Distributed Generation ◽  
Distribution Systems ◽  
Voltage Stability ◽  
Reactive Power ◽  
Optimization Problems ◽  
Stability Index ◽  
Mixed Integer ◽  
Voltage Profile ◽  
Voltage Stability Index

Integrating Distributed Generation (DG) units into distribution systems can have an impact on the voltage profile, power flow, power losses, and voltage stability. In this paper, a new methodology for DG location and sizing are developed to minimize system losses and maximize voltage stability index (VSI). A proper allocation of DG has to be determined using the fuzzy ranking method to verify best compromised solutions and achieve maximum benefits. Synchronous machines are utilized and its power factor is optimally determined via genetic optimization to inject reactive power to decrease system losses and improve voltage profile and VSI. The Augmented Lagrangian Genetic Algorithm with nonlinear mixed-integer variables and Non-dominated Sorting Genetic Algorithm have been implemented to solve both single/multi-objective function optimization problems. For proposed methodology effectiveness verification, it is tested on 33-bus and 69-bus radial distribution systems then compared with previous works.

Optimum Selection of Hydraulic Devices for Water Hammer Control in the Pipeline Systems Using Genetic Algorithm

2003 ◽  
Author(s):  
Bong Seong Jung ◽  
Bryan W. Karney
Keyword(s):  
Genetic Algorithm ◽  
Steady State ◽  
Optimization Problems ◽  
System Optimization ◽  
Water Hammer ◽  
Pipeline System ◽  
Optimal Size ◽  
Protection Strategy ◽  
Hydraulic Devices ◽  
Selection Of

Genetic algorithms have been used to solve many water distribution system optimization problems, but have generally been limited to steady state or quasi-steady state optimization. However, transient events within pipe system are inevitable and the effect of water hammer should not be overlooked. The purpose of this paper is to optimize the selection, sizing and placement of hydraulic devices in a pipeline system considering its transient response. A global optimal solution using genetic algorithm suggests optimal size, location and number of hydraulic devices to cope with water hammer. This study shows that the integration of a genetic algorithm code with a transient simulator can improve both the design and the response of a pipe network. This study also shows that the selection of optimum protection strategy is an integrated problem, involving consideration of loading condition, device and system characteristics, and protection strategy. Simpler transient control systems are often found to outperform more complex ones.

A Mixed-Integer Fractional Optimization Approach to Best Subset Selection

2021 ◽  
Author(s):  
Andrés Gómez ◽  
Oleg A. Prokopyev
Keyword(s):  
Optimization Problems ◽  
Subset Selection ◽  
Quadratic Optimization ◽  
Data Partitioning ◽  
Information Criteria ◽  
Computational Experiments ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Fractional Optimization ◽  
Recent Advances

We consider the best subset selection problem in linear regression—that is, finding a parsimonious subset of the regression variables that provides the best fit to the data according to some predefined criterion. We are primarily concerned with alternatives to cross-validation methods that do not require data partitioning and involve a range of information criteria extensively studied in the statistical literature. We show that the problem of interest can be modeled using fractional mixed-integer optimization, which can be tackled by leveraging recent advances in modern optimization solvers. The proposed algorithms involve solving a sequence of mixed-integer quadratic optimization problems (or their convexifications) and can be implemented with off-the-shelf solvers. We report encouraging results in our computational experiments, with respect to both the optimization and statistical performance. Summary of Contribution: This paper considers feature selection problems with information criteria. We show that by adopting a fractional optimization perspective (a well-known field in nonlinear optimization and operations research), it is possible to leverage recent advances in mixed-integer quadratic optimization technology to tackle traditional statistical problems long considered intractable. We present extensive computational experiments, with both synthetic and real data, illustrating that the new fractional optimization approach is orders of magnitude faster than existing approaches in the literature.

Study on the Optimize Strategies of Gene Expression Programming

2013 ◽  
Vol 432 ◽  
pp. 565-570
Author(s):  
Xin Wen Gao ◽  
Ben Bo Guan ◽  
Xing Jian Guan
Keyword(s):  
Gene Expression ◽  
Genetic Algorithm ◽  
Variable Selection ◽  
Genetic Programming ◽  
Evolutionary Computation ◽  
Local Convergence ◽  
Gene Expression Programming ◽  
Optimal Solution ◽  
Fitness Calculation ◽  
Selection Of

The purpose of this paper is to improve the efficiency of the Gene Expression Programming (GEP) algorithm. The GEP algorithm is an evolutionary computation. It inherits the characteristics of Genetic Algorithm and Genetic Programming. Through its own characteristics, the GEP algorithm can get the optimal solution of the complicated problem. So, the GEP algorithm has achieved good results in many areas. However, there are also some inevitable drawbacks about the GEP algorithm itself. This paper proposes 5 deficiencies aspects of the GEP algorithm (expression meaning, fitness calculation, local convergence, variable selection, genetic operations, selection of genetic operation rates), and gives the corresponding solutions.

scholarly journals SOLVING THE NONLINEAR DISCRETE TRANSPORTATION PROBLEM BY MINLP OPTIMIZATION

Transport ◽  
2013 ◽  
Vol 29 (1) ◽  
pp. 1-11 ◽  
Author(s):  
Uroš Klanšek
Keyword(s):  
Transportation Problem ◽  
Optimization Problems ◽  
Relaxation Method ◽  
Optimization Method ◽  
Critical Issue ◽  
Branch And Cut ◽  
Mixed Integer ◽  
Cut Method ◽  
Optimum Solution ◽  
Selection Of

The Nonlinear Discrete Transportation Problem (NDTP) belongs to the class of the optimization problems that are generally difficult to solve. The selection of a suitable optimization method by which a specific NDTP can be appropriately solved is frequently a critical issue in obtaining valuable results. The aim of this paper is to present the suitability of five different Mixed-Integer Nonlinear Programming (MINLP) methods, specifically for the exact optimum solution of the NDTP. The evaluated MINLP methods include the extended cutting plane method, the branch and reduce method, the augmented penalty/outer-approximation/equality-relaxation method, the branch and cut method, and the simple branch and bound method. The MINLP methods were tested on a set of NDTPs from the literature. The gained solutions were compared and a correlative evaluation of the considered MINLP methods is shown to demonstrate their suitability for solving the NDTPs.

Sign in / Sign up

Export Citation Format

Share Document