Genetic Algorithm-based Approach Research Articles

A genetic algorithm-based feature selection approach for diabetes prediction

<p>Genetic algorithms have emerged as a powerful optimization technique for feature selection due to their ability to search through a vast feature space efficiently. This study discusses the importance of feature selection for prediction in healthcare and prominently focuses on diabetes mellitus. Feature selection is essential for improving the performance of prediction models, by finding significant features and removing unnecessary among them. The study aims to identify the most informative subset of features. Diabetes is a chronic metabolic disorder that poses significant health challenges worldwide. For the experiment, two datasets related to diabetes were downloaded from Kaggle and the results of both (datasets) with and without feature selection using the genetic algorithm were compared. Machine learning classifiers and genetic algorithms were combined to increase the precision of diabetes risk prediction. In the preprocessing phase, feature selection, machine learning classifiers, and performance metrics methods were applied to make this study feasible. The results of the experiment showed that genetic algorithm + logistic regression i.e., 80% (accuracy) works better for PIMA diabetes, and for Germany diabetes dataset genetic algorithm + random forest and genetic algorithm + K-Nearest Neighbor i.e., 98.5% performed better than other chosen classifiers. The researchers can better comprehend the importance of feature selection in healthcare through this study.</p>

Dynamic content layout optimization for news website front pages

Purpose The home page design of a digital news website is a key factor in determining its attractiveness to readers. This study aims to propose an approach to manage the frequent adjustment of the dynamic layout of the news content on the website home page in a real-time environment to increase its attractiveness to readers. Design/methodology/approach This paper shows that this news website layout design problem can be modeled as an optimization problem based on the information of news contents that change within a multiple-period planning horizon similar to the dynamic facility layout problem. A hybrid genetic algorithm-based approach integrated with local search heuristic methods is also proposed to improve the solution. Findings This paper finds that the DPLP model is effective in modeling the changing layout of a digital news website. The problem can solved in a timely manner using the proposed hybrid genetic algorithm. Research limitations/implications This paper was based on hypothetical data and on the assumption of equal section size. Actual data would help fine-tune the application of the dynamic facility layout model. As well the algorithm could be enhanced for unequal size sections. Practical implications The model should help online newspapers apply sophisticated algorithms to optimize the layout of news websites dynamically in a timely manner. Social implications News websites are increasingly the desired medium to consume news. So it has an important role in educating society. Thus optimizing and improving the process will help in this regard. Originality/value To the best of the authors’ knowledge, this paper is the first one to apply the DPLP model to the digital newspaper website dynamic design problem.

A Genetic Algorithm-based approach for placement in the fog of latency-sensitive multiplayer game servers

A Genetic Algorithm-based approach for placement in the fog of latency-sensitive multiplayer game servers

A genetic algorithm-based approach for the prediction of metabolic drug-drug interactions involving CYP2C8 or CYP2B6

Background and objectivesA genetic algorithm (GA) approach was developed to predict drug-drug interactions (DDIs) caused by cytochrome P450 2C8 (CYP2C8) inhibition or cytochrome P450 2B6 (CYP2B6) inhibition or induction. Nighty-eight DDIs, obtained from published in vivo studies in healthy volunteers, have been considered using the area under the plasma drug concentration–time curve (AUC) ratios (i.e., ratios of AUC of the drug substrate administered in combination with a DDI perpetrator to AUC of the drug substrate administered alone) to describe the extent of DDI. MethodsThe following parameters were estimated in this approach: the contribution ratios (CRCYP2B6 and CRCYP2C8, i.e., the fraction of the dose metabolized via CYP2B6 or CYP2C8, respectively) and the inhibitory or inducing potency of the perpetrator drug (IRCYP2B6, IRCYP2C8 and ICCYP2B6, for inhibition of CYP2B6 and CYP2C8, and induction of CYP2B6, respectively). The workflow consisted of three main phases. First, the initial estimates of the parameters were estimated through GA. Then, the model was validated using an external validation. Finally, the parameter values were refined via a Bayesian orthogonal regression using all data. ResultsThe AUC ratios of 5 substrates, 11 inhibitors and 19 inducers of CYP2B6, and the AUC ratios of 19 substrates and 23 inhibitors of CYP2C8 were successfully predicted by the developed methodology within 50–200% of observed values. ConclusionsThe approach proposed in this work may represent a useful tool for evaluating the suitable doses of a CYP2C8 or CYP2B6 substrates co-administered with perpetrators.

Algorithmic material selection for wearable medical devices a genetic algorithm-based framework with multiscale modeling

This research presents a novel algorithmic material selection framework for wearable medical devices, utilizing a genetic algorithm-based approach with multiscale modeling. The study employs a comprehensive research methodology encompassing computational modeling, data visualization, and performance assessment. Initially, a diverse set of materials is defined, and their performance scores are assigned to establish a baseline for evaluation. The ensuing data visualization includes a bar chart, a scatter plot, and a line chart, providing insights into material performance, cost-performance relationships, and the convergence of the genetic algorithm, respectively. Performance metrics such as accuracy, precision, and recall are calculated to gauge the algorithm’s efficacy, presented in a bar chart for a nuanced evaluation. Furthermore, a receiver operating characteristic (ROC) curve and a confusion matrix are employed for discriminative ability assessment and detailed classification performance analysis. The results showcase the algorithm’s proficiency in material selection, emphasizing the importance of accuracy, precision, and recall in the complex landscape of wearable medical device development. The abstract concludes with a summary of the implications drawn from each visualization, highlighting the potential of the proposed algorithmic framework to enhance the precision and efficiency of material selection processes for wearable medical devices. This research contributes to the advancement of materials science in healthcare applications, presenting a holistic approach that integrates computational techniques and data-driven methodologies for optimized material selection

A Markov Chain Genetic Algorithm Approach for Non-Parametric Posterior Distribution Sampling of Regression Parameters

This paper proposes a genetic algorithm-based Markov Chain approach that can be used for non-parametric estimation of regression coefficients and their statistical confidence bounds. The proposed approach can generate samples from an unknown probability density function if a formal functional form of its likelihood is known. The approach is tested in the non-parametric estimation of regression coefficients, where the least-square minimizing function is considered the maximum likelihood of a multivariate distribution. This approach has an advantage over traditional Markov Chain Monte Carlo methods because it is proven to converge and generate unbiased samples computationally efficiently.

Resource-aware fog service placement using deferred acceptance in edge computing

Fog computing aims at reducing network latency, bandwidth and processing delay by bringing computation resources closer to the data sources. Modern IoT applications, such as smart surveillance systems, remote health monitoring applications, ambient-aware applications etc., are time-critical and computationally intensive. For such applications, it is ideal to consider an intermediate layer of processing i.e a fog layer in addition to cloud. However, processing the workload of such IoT applications with an intermediate layer of fog nodes has several challenges. The significant challenges include the mobility of end-user nodes, dynamic patterns of workload generation leading to highly-variant resource requirements and sensitive quality of service (QOS) requirements. Hence a dynamic approach is required to precisely map the service requests from end-user devices to a suitable fog node. The optimality of a fog node for service placement depends on several factors, including location, resource utilization rates such as CPU, Memory and Disk utilization % and energy consumption. Several meta-heuristic techniques and evolutionary algorithms have been proposed in the past for optimal service placement among fog nodes. This paper investigates the applicability of a game theory-based approach called Deferred acceptance (DA) for the same. The DA algorithm, originally designed as a stable matching mechanism for the marriage market is adapted for service placement problems in fog-based IoT systems. The effectiveness of optimized service placement through the DA approach is validated experimentally. The experiment is carried out by creating a test bed that mimics a fog computing-based intelligent traffic management application. The proposed approach's performance is evaluated through parameters such as the startup time for the DA approach to produce outcomes, total execution time and handshake latency. The numerical results of the DA approach are compared with those of a simple scheduling algorithm ( FIFO) and a basic genetic algorithm-based approach. The DA approach appears to perform on par with the genetic algorithm in terms of start-up time, but exceeds the genetic algorithm with respect to stability of the outcomes produced.

Fractional PID with Genetic Algorithm Approach for Industrial Tank Level Control Process

Process control is used in various types of industries to boost production while using current resources, product quality, and safety, with level control being one of the most important schemes. It is suggested that study be conducted on nonlinear continuous processes, particularly in process control applications such as conical tank level control. Initially, each process receives one set of Proportional-Integral (PI) controller settings and a First Order Plus Dead-Time (FOPDT) model using the Ziegler Nicholas (ZN) step response tuning method. The numerous FOPDT models and parameter sets are also obtained. Responses obtained with a single set of parameters and responses obtained with many sets of parameters are compared. By creating a Fractional PID Controller (FPID) with Genetic Algorithm (GA), a simulation-based tuning strategy is proposed. The step responses are acquired through experimental research using fine-tuned settings. At most operational points, the Fractional PID Controller with Genetic Algorithm-based tuning approach outperforms, with lowest oscillation, extremely tiny overshoot, minimum average ISE, and minimum average IAE. The proposed FPID with GA method provides better setpoint and regulatory tracking performance compared to ZN-PID.

Genetic algorithm for multilayer shield optimization with a custom parallel computing architecture

This paper introduces a novel architecture for optimizing radiation shielding using a genetic algorithm with dynamic penalties and a custom parallel computing architecture. A practical example focuses on minimizing the Total Ionizing Dose for a silicon slab, considering only the layer number and the total thickness (additional constraints, e.g., cost and density, can be easily added). Genetic algorithm coupled with Geant4 simulations in a custom parallel computing architecture demonstrates convergence for the Total Ionizing Dose values. To address genetic algorithm issues (premature convergence, not perfectly fitted search parameters), a Total Ionizing Dose Database Vault object was introduced to enhance search speed (data persistence) and to preserve all solutions’ details independently. The Total Ionizing Dose Database Vault analysis highlights boron carbide as the best material for the first layer for neutron shielding and high-Z material (e.g., Tungsten) for the last layers to stop secondary gammas. A validation point between Geant4 and MCNP was conducted for specific simulation conditions. The advantages of the custom parallel computing architecture introduced here, are discussed in terms of resilience, scalability, autonomy, flexibility, and efficiency, with the benefit of saving computational time. The proposed genetic algorithm-based approach optimizes radiation shielding materials and configurations efficiently benefiting space exploration, medical devices, nuclear facilities, radioactive sources, and radiogenic devices.

Energy-Efficient Joint User and Power Allocation in 5G Millimeter Wave Networks: A Genetic Algorithm-Based Approach

Energy-Efficient Joint User and Power Allocation in 5G Millimeter Wave Networks: A Genetic Algorithm-Based Approach

A Genetic Algorithm-based Approach for Design-level Class Decomposition

A Genetic Algorithm-based Approach for Design-level Class Decomposition

Finansal Piyasalarda Algoritmik Ticaret İçin Genetik Algoritma Temeli Yaklaşım

Software that enables realtime buy and sell transactions in financial markets according to predetermined conditions is called algorithmic trading. When developing algorithmic trading robots, indicators used in technical analysis are generally used. For the strategy selection of the robot, a process called Backtest is performed on the historical time series. The purpose of the Backtest process is the process of obtaining and interpreting values such as the number of successful/unsuccessful trades, the portfolio cash value after the commission to be paid to the intermediary institution, the profit factor and the sharpe ratio. The biggest disadvantage in this process is the selection of the appropriate stock, period, indicator and their parameters. Linear programming approaches are mostly used in the selection of these parameters that optimize the Backtest process optimally. However, according to the strategy to be used, the coding of these algorithms can have a linear, quadratic or polynomial complexity. This requires more long testing times for investors and algorithmic robot developers. Genetic algorithm-based approaches inspired by nature, on the other hand, converge to the optimal solution with much less iteration and require less processing power and time. In this study, a genetic programming-based approach is proposed for the selection of optimal conditions in algorithmic trading. In the experimental studies section, it has been seen that the use of traditional and genetic algorithm-based approaches in algorithmic trading operations has advantages when comparing complexity.

A genetic algorithm-based approach for the time, cost, and quality trade-off problem for construction projects

A genetic algorithm-based approach for the time, cost, and quality trade-off problem for construction projects

Genetic Algorithm-Based Optimization Approach for Solving a Class of Inverse Problems with Tikhonov Regularization

In this paper, we are interested in solving the data completion problem for the Laplace equation. It consists to determine the missing data on the inaccessible part of the boundary from overspecified conditions in the accessible part. Knowing that this problem is severely ill-posed, we consider its formulation as an optimization problem using Tikhonov regularization. Then, we consider an optimization approach based on adapted Real Coded Genetic Algorithm (RCGA) to minimize the cost function and recover the missing data. The performed numerical simulations, with different domains, illustrate the accuracy and efficiency of the proposed method with an adequate regularization parameter, in addition to the good agreement between the numerical solutions and different noise level of the given data.

Imbalance-learning road crash assessment under reduced visibility settings: A proactive multicriteria decision-making system

Road crash prediction is a fundamental key in designing efficient intelligent transportation systems. There has been a pronounced progress in the use of machine learning models for crash events assessment by the transportation safety research community in recent years. However, little attention has been paid so far to evaluating reduced-visibility crash occurrences within a heuristic ensemble system. This study presents a proactive multicriteria decision-making system that can predict crash occurrences based on real-time roadway properties, land zones’ characteristics, vehicle telemetry, driver inputs and weather conditions collected using a desktop driving simulator. A key novelty of this work is implementing a genetic algorithm-based feature selection approach along with ensemble modeling strategies using AdaBoost, XGBoost and RF techniques to establish effective crash predictions. Furthermore, since crash events occur in rare instances tending to be underrepresented in the dataset, an imbalance-learning methodology to overcome the issue was adopted on the basis of several data resampling approaches to increase the predictive performance namely SMOTE, Borderline-SMOTE, SMOTE-Tomek Links and ADASYN strategies. To our knowledge, there has been a limited interest at adopting an ensemble-based imbalance-learning strategy examining the impact of real-time features’ combinations on the prediction of road crash events under reduced visibility settings.

Optimizing power transfer in selective wireless charging systems: A genetic algorithm-based approach

This paper presents a novel approach to optimize selective wireless power transmission to multiple receivers utilizing a single transmitter. The primary focus is on achieving target power levels at specific resonant frequencies on each receiver while ensuring maximum transmission efficiency. To address this, an analytical model based on magnetic coupling between coils is employed to explore different solutions, and a Genetic Algorithm (GA) is applied to identify the optimal configuration. The application of a GA for system design optimization is introduced, which proves highly effective, especially when dealing with multiple receivers where analytical models become difficult to manage. The GA-based approach facilitates the discovery of numerical solutions that might be challenging to deduce analytically. The validity of the proposed approach is confirmed through simulation and experimental measurements.

Automated Guided Vehicle (AGV) Scheduling in Automated Container Terminals (ACTs) Focusing on Battery Swapping and Speed Control

Because they are environmentally friendly and safe, automated guided vehicles (AGVs) are increasingly used in newly constructed automated container terminals. However, their scheduling strategy is constrained by their limited battery capacity. When batteries reach their charging threshold, the AGVs need to be returned to battery-swapping stations. Moreover, the movement speed of AGVs has a significant impact on their energy consumption and operating times. Therefore, in this paper, a speed control strategy that considers the traffic environment of the terminal is proposed from the perspective of energy conservation and emission reduction. In addition, the charging capacity of the terminal is discretized to model its limited handling capacity to avoid congestion in the battery-swapping stations. To minimize the costs of delays and carbon emissions of AGV operations, a mixed integer programming model is established. It optimizes the efficiency and carbon emissions of the operations by assigning and prioritizing container transportation and AGV battery-swapping tasks. An improved genetic algorithm-based approach is designed where a better initial solution is obtained through a greedy strategy, while simulated annealing is adopted for population selection to prevent the algorithm from falling into local optima. Furthermore, an adaptive adjustment strategy for crossover and mutation probabilities is adopted to improve the algorithm’s convergence. Finally, a series of numerical experiments is conducted to verify the efficiency of the proposed method. The experimental results indicate that considering the variability of AGV speed can more accurately characterize their energy consumption, and increasing the number of AGVs and enhancing the battery-swapping capacity can effectively reduce the costs of delays and carbon emissions.

Body landmarks and genetic algorithm-based approach for non-contact detection of head forward posture among Chinese adolescents: revitalizing machine learning in medicine

Addressing the current complexities, costs, and adherence issues in the detection of forward head posture (FHP), our study conducted an exhaustive epidemiologic investigation, incorporating a comprehensive posture screening process for each participant in China. This research introduces an avant-garde, machine learning-based non-contact method for the accurate discernment of FHP. Our approach elevates detection accuracy by leveraging body landmarks identified from human images, followed by the application of a genetic algorithm for precise feature identification and posture estimation. Observational data corroborates the superior efficacy of the Extra Tree Classifier technique in FHP detection, attaining an accuracy of 82.4%, a specificity of 85.5%, and a positive predictive value of 90.2%. Our model affords a rapid, effective solution for FHP identification, spotlighting the transformative potential of the convergence of feature point recognition and genetic algorithms in non-contact posture detection. The expansive potential and paramount importance of these applications in this niche field are therefore underscored.

A Genetic Algorithm-based Group Formation to Assign Student with Academic Advisor: A Study on User Acceptance using UTAUT

Group formation to assign students with academic advisors based on student demography can be exhaustive as various possibilities and combinations can be formed. Hence, this paper proposed a genetic algorithm-based approach to automate group formation based on student demography to assign students to their academic advisors. The genetic algorithm (GA) will optimize the group formation of students with a balanced number of nationalities, races, and genders. Also, this paper examines the user acceptance of the proposed genetic algorithm-based application to automate group formation using the Unified Theory of Acceptance and Use of Technology (UTAUT) framework. The survey aims to study the impact of independent and moderating variables on dependent variables. The result proved that all the independent variables, Performance Expectancy (PE), Effort Expectancy (EE), Social Influence (SI), and Facilitating Condition (FC), have a positive impact on the dependent variable, Behavioral Intention (BI). In contrast, the moderating variable Experience (EX) and Voluntariness of Use (VU) have a negative impact on Behavioral Intention (BI). Thus, this paper concludes that the proposed application can increase the performance and efficiency of group formation and automatically assign students to academic advisors. However, respondents are reluctant and not ready to use the system. Thus, training and workshops can be conducted to introduce and train the users to utilize the system. Future works can be done where the application of the proposed genetic algorithm-based system can be further expanded to different academic purposes such as team formation for group assignment and team member selection for competition.

A genetic algorithm-based approach for flexible job shop rescheduling problem with machine failure interference

Rescheduling is the guarantee to maintain the reliable operation of production system process. In production system, the original scheduling scheme cannot be carried out when machine breaks down. It is necessary to transfer the production tasks in the failure cycle and replan the production path to ensure that the production tasks are completed on time and maintain the stability of production system. To address this issue, in this paper, we studied the event-driven rescheduling policy in dynamic environment, and established the usage rules of right-shift rescheduling and complete rescheduling based on the type of interference events. And then, we proposed the rescheduling decision method based on genetic algorithm for solving flexible job shop scheduling problem with machine fault inter-ference. In addition, we extended the "mk" series of instances by introducing the machine fault interference information. The solution data show that the complete rescheduling method can respond effectively to the rescheduling of flexible job shop scheduling problem with machine failure interference.