Seleksi Peubah menggunakan Algoritme Genetika pada Data Rancangan Faktorial Pecahan Lewat Jenuh Dua Taraf

2020 ◽  
Vol 10 (1) ◽  
pp. 55-69
Author(s):  
Ani Safitri ◽  
Rahma Anisa ◽  
Bagus Sartono

In certain fields, experiments involve many factors and are constrained by costs. Reducing runs is one of the solutions to reduce experiment costs. But that can cause the number of runs to become less than the number of factors. This case of experimental design also is known as a supersaturated design. The important factors in this design are generally estimated by involving variable selection such as forward selection, stepwise regression, and penalized regression. Genetic algorithm is one of the methods that can be used for variable selection, especially for high dimensional data or supersaturated design. This study aims to use a genetic algorithm for variable selection in the supersaturated design and compare the genetic algorithm results with a stepwise regression which is generally used for a simple design. This study also involved fractional factorial design principles. The result showed that the main factors and interactions of the genetic algorithm and stepwise regression were quite different. But the principle was the same because the variables correlated. The genetic algorithm model had a smaller AIC and BIC and all of the main factors and interactions which had chosen were significant on the 0.1%. Therefore genetic algorithm model was chosen although computation time was much longer than stepwise regression.

2020 ◽  
Vol 2 (2) ◽  
Author(s):  
Antoni Susin ◽  
Yiwen Wang ◽  
Kim-Anh Lê Cao ◽  
M Luz Calle

Abstract Though variable selection is one of the most relevant tasks in microbiome analysis, e.g. for the identification of microbial signatures, many studies still rely on methods that ignore the compositional nature of microbiome data. The applicability of compositional data analysis methods has been hampered by the availability of software and the difficulty in interpreting their results. This work is focused on three methods for variable selection that acknowledge the compositional structure of microbiome data: selbal, a forward selection approach for the identification of compositional balances, and clr-lasso and coda-lasso, two penalized regression models for compositional data analysis. This study highlights the link between these methods and brings out some limitations of the centered log-ratio transformation for variable selection. In particular, the fact that it is not subcompositionally consistent makes the microbial signatures obtained from clr-lasso not readily transferable. Coda-lasso is computationally efficient and suitable when the focus is the identification of the most associated microbial taxa. Selbal stands out when the goal is to obtain a parsimonious model with optimal prediction performance, but it is computationally greedy. We provide a reproducible vignette for the application of these methods that will enable researchers to fully leverage their potential in microbiome studies.


Procedia CIRP ◽  
2020 ◽  
Vol 88 ◽  
pp. 503-508
Author(s):  
Gennaro Salvatore Ponticelli ◽  
Stefano Guarino ◽  
Oliviero Giannini ◽  
Flaviana Tagliaferri ◽  
Simone Venettacci ◽  
...  

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Chenghua Shi ◽  
Tonglei Li ◽  
Yu Bai ◽  
Fei Zhao

We present the vehicle routing problem with potential demands and time windows (VRP-PDTW), which is a variation of the classical VRP. A homogenous fleet of vehicles originated in a central depot serves customers with soft time windows and deliveries from/to their locations, and split delivery is considered. Also, besides the initial demand in the order contract, the potential demand caused by conformity consuming behavior is also integrated and modeled in our problem. The objective of minimizing the cost traveled by the vehicles and penalized cost due to violating time windows is then constructed. We propose a heuristics-based parthenogenetic algorithm (HPGA) for successfully solving optimal solutions to the problem, in which heuristics is introduced to generate the initial solution. Computational experiments are reported for instances and the proposed algorithm is compared with genetic algorithm (GA) and heuristics-based genetic algorithm (HGA) from the literature. The comparison results show that our algorithm is quite competitive by considering the quality of solutions and computation time.


Sign in / Sign up

Export Citation Format

Share Document