RESUMEN
Shell and tube heat exchangers are pivotal for efficient heat transfer in various industrial processes. Effective control of these structures is essential for optimizing energy usage and ensuring industrial system reliability. In this regard, this study focuses on adopting a fractional-order proportional-integral-derivative (FOPID) controller for efficient control of shell and tube heat exchanger. The novelty of this work lies in the utilization of an enhanced version of cooperation search algorithm (CSA) for FOPID controller tuning, offering a novel approach to optimization. The enhanced optimizer (en-CSA) integrates a control randomization operator, linear transfer function, and adaptive p-best mutation integrated with original CSA. Through rigorous testing on CEC2020 benchmark functions, en-CSA demonstrates robust performance, surpassing other optimization algorithms. Specifically, en-CSA achieves an average convergence rate improvement of 23% and an enhancement in solution accuracy by 17% compared to standard CSAs. Subsequently, en-CSA is applied to optimize the FOPID controller for steam condenser pressure regulation, a crucial aspect of heat exchanger operation. Nonlinear comparative analysis with contemporary optimization algorithms confirms en-CSA's superiority, achieving up to 11% faster settling time and up to 55% reduced overshooting. Additionally, en-CSA improves the steady-state error by 8% and enhances the overall stability margin by 12%.
Asunto(s)
Algoritmos , Presión , Vapor , Dinámicas no LinealesRESUMEN
Deploying distributed generators (DGs) supplied by renewable energy resources poses a significant challenge for efficient power grid operation. The proper sizing and placement of DGs, specifically photovoltaics (PVs) and wind turbines (WTs), remain crucial due to the uncertain characteristics of renewable energy. To overcome these challenges, this study explores an enhanced version of a meta-heuristic technique called the prairie dog optimizer (PDO). The modified prairie dogs optimizer (mPDO) incorporates a novel exploration phase inspired by the slime mold algorithm (SMA) food approach. The mPDO algorithm is proposed to analyze the substantial effects of different dynamic load characteristics on the performance of the distribution networks and the designing of the PV-based and WT-based DGs. The optimization problem incorporates various operational constraints to mitigate energy loss in the distribution networks. Further, the study addresses uncertainties related to the random characteristics of PV and WT power outputs by employing appropriate probability distributions. The mPDO algorithm is evaluated using cec2020 benchmark suit test functions and rigorous statistical analysis to mathematically measure its success rate and efficacy while considering different type of optimization problems. The developed mPDO algorithm is applied to incorporate both PV and WT units, individually and simultaneously, into the IEEE 69-bus distribution network. This is achieved considering residential, commercial, industrial, and mixed time-varying voltage-dependent load demands. The efficacy of the modified algorithm is demonstrated using the standard benchmark functions, and a comparative analysis is conducted with the original PDO and other well-known algorithms, utilizing various statistical metrics. The numerical findings emphasize the significant influence of load type and time-varying generation in DG planning. Moreover, the mPDO algorithm beats the alternatives and improves distributed generators' technical advantages across all examined scenarios.
RESUMEN
A comprehensive study of fruits and leaves extracts of Citrus medica var. sarcodactylis Swingle and Limonia acidissima L. family Rutaceae was accomplished to investigate their antiviral activity along with their zinc oxide nanoparticles formulation (ZnONPs) against the avian influenza H5N1 virus. A thorough comparative phytochemical investigation of C. medica and L.acidissima leaves and fruits was performed using UPLC-QTOF-MS-MS. Antiviral effects further aided by molecular docking proved the highly significant potential of using C. medica and L.acidissima extracts as medicinal agents. Antiviral potency is ascendingly arranged as L. acidissima leaves (LAL) > L. acidissima fruits (LAF) > C. medica leaves (CML) at 160 µg. Nano formulation of LAF has the most splendid antiviral upshot. The metabolomic profiling of CMF and LAL revealed the detection of 48 & 74 chromatographic peaks respectively. Docking simulation against five essential proteins in survival and replication of the influenza virus revealed that flavonoid di-glycosides (hesperidin, kaempferol-3-O-rutinoside, and kaempferol-7-neohesperidoside) have shown great affinity toward the five investigated proteins and achieved docking scores which approached or even exceeded that achieved by the native ligands. Hesperidin has demonstrated the best binding affinity toward neuraminidase (NA), haemagglutinin (HA), and polymerase protein PB2 (-10.675, -8.131, and -10.046 kcal/mol respectively. We propose using prepared crude methanol extracts of both plants as an antiviral agent.
RESUMEN
The Artificial Electric Field Algorithm (AEFA) stands out as a physics-inspired metaheuristic, drawing inspiration from Coulomb's law and electrostatic force; however, while AEFA has demonstrated efficacy, it can face challenges such as convergence issues and suboptimal solutions, especially in high-dimensional problems. To overcome these challenges, this paper introduces a modified version of AEFA, named mAEFA, which leverages the capabilities of Lévy flights, simulated annealing, and the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms. While Lévy flights enhance exploration potential and simulated annealing improves search exploitation, the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms are employed to add more diversity. The integration of these mechanisms in AEFA aims to expand its search space, enhance exploration potential, avoid local optima, and achieve improved performance, robustness, and a more equitable equilibrium between local intensification and global diversification. In this study, a comprehensive assessment of mAEFA is carried out, employing a combination of quantitative and qualitative measures, on a diverse range of 29 intricate CEC'17 constraint benchmarks that exhibit different characteristics. The practical compatibility of the proposed mAEFA is evaluated on five engineering benchmark problems derived from the civil, mechanical, and industrial engineering domains. Results from the mAEFA algorithm are compared with those from seven recently introduced metaheuristic algorithms using widely adopted statistical metrics. The mAEFA algorithm outperforms the LCA algorithm in all 29 CEC'17 test functions with 100% superiority and shows better results than SAO, GOA, CHIO, PSO, GSA, and AEFA in 96.6%, 96.6%, 93.1%, 86.2%, 82.8%, and 58.6% of test cases, respectively. In three out of five engineering design problems, mAEFA outperforms all the compared algorithms, securing second place in the remaining two problems. Results across all optimization problems highlight the effectiveness and robustness of mAEFA compared to baseline metaheuristics. The suggested enhancements in AEFA have proven effective, establishing competitiveness in diverse optimization problems.
RESUMEN
Antimicrobial potential of Citrus medica var. sarcodactylis (Siebold ex Hoola van Nooten) Swingle and Limonia acidissima L. fruits and leaves extracts CMF, CML, LAF and LAL, respectively were evaluated. Gas chromatography-mass spectrometry (GC-MS) analysis for lipoidal matters revealed a high percentage of non-oxygenated compounds. Phytol was the major in LAL. Palmitic and linoleic acid were the major in CML and LAL, respectively. Rutin and P-hydroxy benzoic acid were the main compounds identified by High-performance liquid chromatography (HPLC) analysis. The antibacterial and antifungal activities of the plants extract were determined by the well diffusion method. Antimicrobial investigation for different successive fractions of active methanol extracts of CML, LAL, LAF and CMF showed the highest activity (CML), whereas the petroleum ether (CML PE) and MeOH (CML) fractions exhibit a significant antifungal activity against Candida albicans minimum inhibitory concentration (MIC) 12 and 15 µg/mL, respectively. The antifungal activity prevailed by C. medica leaves may be attributed to its polyphenolics (rutin, chlorogenic and rosmarinic acid) in addition to phenylated hydrocarbon.
RESUMEN
The rapid growth of data generated by several applications like engineering, biotechnology, energy, and others has become a crucial challenge in the high dimensional data mining. The large amounts of data, especially those with high dimensions, may contain many irrelevant, redundant, or noisy features, which may negatively affect the accuracy and efficiency of the industrial data mining process. Recently, several meta-heuristic optimization algorithms have been utilized to evolve feature selection techniques for dealing with the vast dimensionality problem. Despite optimization algorithms' ability to find the near-optimal feature subset of the search space, they still face some global optimization challenges. This paper proposes an improved version of the sooty tern optimization (ST) algorithm, namely the ST-AL method, to improve the search performance for high-dimensional industrial optimization problems. ST-AL method is developed by boosting the performance of STOA by applying four strategies. The first strategy is the use of a control randomization parameters that ensure the balance between the exploration-exploitation stages during the search process; moreover, it avoids falling into local optimums. The second strategy entails the creation of a new exploration phase based on the Ant lion (AL) algorithm. The third strategy is improving the STOA exploitation phase by modifying the main equation of position updating. Finally, the greedy selection is used to ignore the poor generated population and keeps it from diverging from the existing promising regions. To evaluate the performance of the proposed ST-AL algorithm, it has been employed as a global optimization method to discover the optimal value of ten CEC2020 benchmark functions. Also, it has been applied as a feature selection approach on 16 benchmark datasets in the UCI repository and compared with seven well-known optimization feature selection methods. The experimental results reveal the superiority of the proposed algorithm in avoiding local minima and increasing the convergence rate. The experimental result are compared with state-of-the-art algorithms, i.e., ALO, STOA, PSO, GWO, HHO, MFO, and MPA and found that the mean accuracy achieved is in range 0.94-1.00.
RESUMEN
The increasing use of Internet of Things (IoT) applications in various aspects of our lives has created a huge amount of data. IoT applications often require the presence of many technologies such as cloud computing and fog computing, which have led to serious challenges to security. As a result of the use of these technologies, cyberattacks are also on the rise because current security methods are ineffective. Several artificial intelligence (AI)-based security solutions have been presented in recent years, including intrusion detection systems (IDS). Feature selection (FS) approaches are required for the development of intelligent analytic tools that need data pretreatment and machine-learning algorithm-performance enhancement. By reducing the number of selected features, FS aims to improve classification accuracy. This article presents a new FS method through boosting the performance of Gorilla Troops Optimizer (GTO) based on the algorithm for bird swarms (BSA). This BSA is used to boost performance exploitation of GTO in the newly developed GTO-BSA because it has a strong ability to find feasible regions with optimal solutions. As a result, the quality of the final output will increase, improving convergence. GTO-BSA's performance was evaluated using a variety of performance measures on four IoT-IDS datasets: NSL-KDD, CICIDS-2017, UNSW-NB15 and BoT-IoT. The results were compared to those of the original GTO, BSA, and several state-of-the-art techniques in the literature. According to the findings of the experiments, GTO-BSA had a better convergence rate and higher-quality solutions.
Asunto(s)
Internet de las Cosas , Algoritmos , Inteligencia Artificial , Nube Computacional , Aprendizaje AutomáticoRESUMEN
The DNA motif discovery is a primary step in many systems for studying gene function. Motif discovery plays a vital role in identification of Transcription Factor Binding Sites (TFBSs) that help in learning the mechanisms for regulation of gene expression. Over the past decades, different algorithms were used to design fast and accurate motif discovery tools. These algorithms are generally classified into consensus or probabilistic approaches that many of them are time-consuming and easily trapped in a local optimum. Nature-inspired algorithms and many of combinatorial algorithms are recently proposed to overcome these problems. This paper presents a general classification of motif discovery algorithms with new sub-categories that facilitate building a successful motif discovery algorithm. It also presents a summary of comparison between them.