Search

In this study, a new hybrid metaheuristic algorithm named Chaotic Sand Cat Swarm Optimization (CSCSO) is proposed for constrained and complex optimization problems. This algorithm combines the features of the recently introduced SCSO with the concept of chaos. The basic aim of the proposed algorithm is to integrate the chaos feature of non-recurring locations into SCSO's core search process to improve global search performance and convergence behavior. Thus, randomness in SCSO can be replaced by a chaotic map due to similar randomness features with better statistical and dynamic properties. In addition to these advantages, low search consistency, local optimum trap, inefficiency search, and low population diversity issues are also provided. In the proposed CSCSO, several chaotic maps are implemented for more efficient behavior in the exploration and exploitation phases. Experiments are conducted on a wide variety of well-known test functions to increase the reliability of the results, as well as real-world problems. In this study, the proposed algorithm was applied to a total of 39 functions and multidisciplinary problems. It found 76.3% better responses compared to a best-developed SCSO variant and other chaotic-based metaheuristics tested. This extensive experiment indicates that the CSCSO algorithm excels in providing acceptable results. [ABSTRACT FROM AUTHOR]

Food needs are increasing day by day, and traditional agricultural methods are not responding efficiently. Moreover, considering other important global challenges such as energy sufficiency and migration crises, the need for sustainable agriculture has become essential. For this, an integrated smart and mechanism-application-based model is proposed in this study. This model consists of three stages. In the first phase (cultivation), the proposed model tried to plant crops in the most optimized way by using an automized algorithmic approach (Sand Cat Swarm Optimization algorithm). In the second stage (control and monitoring), the growing processes of the planted crops was tracked and monitored using Internet of Things (IoT) devices. In the third phase (harvesting), a new method (Reverse Ant Colony Optimization), inspired by the ACO algorithm, was proposed for harvesting by autonomous robots. In the proposed model, the most optimal path was analyzed. This model includes maximum profit, maximum quality, efficient use of resources such as human labor and water, the accurate location for planting each crop, the optimal path for autonomous robots, finding the best time to harvest, and consuming the least power. According to the results, the proposed model performs well compared to many well-known methods in the literature. [ABSTRACT FROM AUTHOR]

The increasing need for food in recent years means that environmental protection and sustainable agriculture are necessary. For this, smart agricultural systems and autonomous robots have become widespread. One of the most significant and persistent problems related to robots is 3D path planning, which is an NP-hard problem, for mobile robots. In this paper, efficient methods are proposed by two metaheuristic algorithms (Incremental Gray Wolf Optimization (I-GWO) and Expanded Gray Wolf Optimization (Ex-GWO)). The proposed methods try to find collision-free optimal paths between two points for robots without human intervention in an acceptable time with the lowest process costs and efficient use of resources in large-scale and crowded farmlands. Thanks to the methods proposed in this study, various tasks such as tracking crops can be performed efficiently by autonomous robots. The simulations are carried out using three methods, and the obtained results are compared with each other and analyzed. The relevant results show that in the proposed methods, the mobile robots avoid the obstacles successfully and obtain the optimal path cost from source to destination. According to the simulation results, the proposed method based on the Ex-GWO algorithm has a better success rate of 55.56% in optimal path cost. [ABSTRACT FROM AUTHOR]

RNA-protein interactions of a virus play a major role in the replication of RNA viruses. The replication and transcription of these viruses take place in the cytoplasm of the host cell; hence, there is a probability for the host RNA-viral protein and viral RNA-host protein interactions. The current study applies a high-throughput computational approach, including feature extraction and machine learning methods, to predict the affinity of protein sequences of ten viruses to three categories of RNA sequences. These categories include RNAs involved in the protein-RNA complexes stored in the RCSB database, the human miRNAs deposited at the mirBase database, and the lncRNA deposited in the LNCipedia database. The results show that evolution not only tries to conserve key viral proteins involved in the replication and transcription but also prunes their interaction capability. These proteins with specific interactions do not perturb the host cell through undesired interactions. On the other hand, the hypermutation rate of NSP3 is related to its affinity to host cell RNAs. The Gene Ontology (GO) analysis of the miRNA with affiliation to NSP3 suggests that these miRNAs show strongly significantly enriched GO terms related to the known symptoms of COVID-19. Docking and MD simulation study of the obtained miRNA through high-throughput analysis suggest a non-coding RNA (an RNA antitoxin, ToxI) as a natural aptamer drug candidate for NSP5 inhibition. Finally, a significant interplay of the host RNA-viral protein in the host cell can disrupt the host cell's system by influencing the RNA-dependent processes of the host cells, such as a differential expression in RNA. Furthermore, our results are useful to identify the side effects of mRNA-based vaccines, many of which are caused by the off-label interactions with the human lncRNAs., (Copyright © 2021 Elsevier Ltd. All rights reserved.)