Operational optimization of large-scale parallel-unit SWRO desalination plant using differential evolution algorithm.
Ontology highlight
ABSTRACT:
SUBMITTER: Wang J
PROVIDER: S-EPMC3948477 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:BACKGROUNDS: Recent explosion of biological data brings a great challenge for the traditional clustering algorithms. With increasing scale of data sets, much larger memory and longer runtime are required for the cluster identification problems. The affinity propagation algorithm outperforms many other classical clustering algorithms and is widely applied into the biological researches. However, the time and space complexity become a great bottleneck when handling the large-scale data sets. Moreover, the similarity matrix, whose constructing procedure takes long runtime, is required before running the affinity propagation algorithm, since the algorithm clusters data sets based on the similarities between data pairs. METHODS: Two types of parallel architectures are proposed in this paper to accelerate the similarity matrix constructing procedure and the affinity propagation algorithm. The memory-shared architecture is used to construct the similarity matrix, and the distributed system is taken for the affinity propagation algorithm, because of its large memory size and great computing capacity. An appropriate way of data partition and reduction is designed in our method, in order to minimize the global communication cost among processes. RESULT: A speedup of 100 is gained with 128 cores. The runtime is reduced from serval hours to a few seconds, which indicates that parallel algorithm is capable of handling large-scale data sets effectively. The parallel affinity propagation also achieves a good performance when clustering large-scale gene data (microarray) and detecting families in large protein superfamilies.
| S-EPMC3976248 | biostudies-literature
Project description:The reconstruction of gene regulatory networks (GRNs) from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE)-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM), experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.
| S-EPMC4373852 | biostudies-literature
Project description:Combined Heat and Power Units Economic Dispatch (CHPUED) is a challenging non-convex optimization challenge in the power system that aims at decreasing the production cost by scheduling the heat and power generation outputs to dedicated units. In this article, a Kepler optimization algorithm (KOA) is designed and employed to handle the CHPUED issue under valve points impacts in large-scale systems. The proposed KOA is used to forecast the position and motion of planets at any given time based on Kepler's principles of planetary motion. The large 48-unit, 96-unit, and 192-unit systems are considered in this study to manifest the superiority of the developed KOA, which reduces the fuel costs to 116,650.0870 USD/h, 234,285.2584 USD/h, and 487,145.2000 USD/h, respectively. Moreover, the dwarf mongoose optimization algorithm (DMOA), the energy valley optimizer (EVO), gray wolf optimization (GWO), and particle swarm optimization (PSO) are studied in this article in a comparative manner with the KOA when considering the 192-unit test system. For this large-scale system, the presented KOA successfully achieves improvements of 19.43%, 17.49%, 39.19%, and 62.83% compared to the DMOA, the EVO, GWO, and PSO, respectively. Furthermore, a feasibility study is conducted for the 192-unit test system, which demonstrates the superiority and robustness of the proposed KOA in obtaining all operating points between the boundaries without any violations.
| S-EPMC10741829 | biostudies-literature
Project description:This paper examines the cost competitiveness of an extra-large-scale (275,000 m3/d) solar-powered desalination, taking as a case study the Chtouka Ait Baha plant in Morocco. It assesses the conditions at which solar Photovoltaics (PV) and Concentrated Solar Power (CSP) would be competitive with a grid (mainly fossil) driven desalination plant for the reference year and by 2030. The paper considers also a scenario where battery storage complements PV power generation. To conduct the analysis, a simple model of water cost calculation is built. Second, the cost related to energy consumption is calculated for different power supply options to evaluate the impact of energy provision cost on the final cost of water. The first main result of this paper is that desalinated water can be obtained at an acceptable cost of around 1 $/m3. The second one is that PV without storage remains the cheapest power supply option today and by 2030. Storage based solution appears less competitive today but can be more attractive in a framework of increasing electricity grid prices and higher flexibility requirements in the future. The paper gives recommendations regarding the implication of different technology choices in the framework of the future Moroccan energy system.
| S-EPMC7442029 | biostudies-literature
Project description:Motivated by the hunting strategies of cheetahs, this paper proposes a nature-inspired algorithm called the cheetah optimizer (CO). Cheetahs generally utilize three main strategies for hunting prey, i.e., searching, sitting-and-waiting, and attacking. These strategies are adopted in this work. Additionally, the leave the pray and go back home strategy is also incorporated in the hunting process to improve the proposed framework's population diversification, convergence performance, and robustness. We perform intensive testing over 14 shifted-rotated CEC-2005 benchmark functions to evaluate the performance of the proposed CO in comparison to state-of-the-art algorithms. Moreover, to test the power of the proposed CO algorithm over large-scale optimization problems, the CEC2010 and the CEC2013 benchmarks are considered. The proposed algorithm is also tested in solving one of the well-known and complex engineering problems, i.e., the economic load dispatch problem. For all considered problems, the results are shown to outperform those obtained using other conventional and improved algorithms. The simulation results demonstrate that the CO algorithm can successfully solve large-scale and challenging optimization problems and offers a significant advantage over different standards and improved and hybrid existing algorithms. Note that the source code of the CO algorithm is publicly available at https://www.optim-app.com/projects/co .
| S-EPMC9243145 | biostudies-literature
Project description:Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein-protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL's scalability to cluster large datasets still remains a bottleneck due to high running times and memory demands. Here, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ?70 million nodes with ?68 billion edges in ?2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license.
| S-EPMC5888241 | biostudies-literature
Project description:This paper presents a new distributed constraint optimization algorithm called LSPA, which can be used to solve large scale distributed constraint optimization problem (DCOP). Different from the access of local information in the existing algorithms, a new criterion called local stability is defined and used to evaluate which is the next agent whose value needs to be changed. The propose of local stability opens a new research direction of refining initial solution by finding key agents which can seriously effect global solution once they modify assignments. In addition, the construction of initial solution could be received more quickly without repeated assignment and conflict. In order to execute parallel search, LSPA finds final solution by constantly computing local stability of compatible agents. Experimental evaluation shows that LSPA outperforms some of the state-of-the-art incomplete distributed constraint optimization algorithms, guaranteeing better solutions received within ideal time.
| S-EPMC4106159 | biostudies-other
Project description:Identifying genomic regions that descended from a common ancestor helps us study the gene function and genome evolution. In distantly related genomes, clusters of homologous gene pairs are evidently used in function prediction, operon detection, etc. Currently, there are many kinds of computational methods that have been proposed defining gene clusters to identify gene families and operons. However, most of those algorithms are only available on a data set of small size. We developed an efficient gene clustering algorithm that can be applied on hundreds of genomes at the same time. This approach allows for large-scale study of evolutionary relationships of gene clusters and study of operon formation and destruction. An analysis of proposed algorithms shows that more biological insight can be obtained by analyzing gene clusters across hundreds of genomes, which can help us understand operon occurrences, gene orientations and gene rearrangements.
| S-EPMC3218420 | biostudies-other
Project description: Not available
| S-BSST207 | biostudies-other
Project description:Hospitals operate 24 h a day, and it is assumed that important clinical decisions occur continuously around the clock. However, many aspects of hospital operation occur at specific times of day, including medical team rounding and shift changes. It is unclear whether this impacts patient care, as no studies have addressed this. We analyzed the daily distribution of ∼500,000 doses of 12 separate drugs in 1,546 inpatients at a major children's hospital in the United States from 2010 to 2017. We tracked both order time (when a care provider places an electronic request for a drug) and dosing time (when the patient receives the drug). Order times were time-of-day-dependent, marked by distinct morning-time surges and overnight lulls. Nearly one-third of all 103,847 orders for treatment were placed between 8:00 AM and 12:00 PM. First doses from each order were also rhythmic but shifted by 2 h. These 24-h rhythms in orders and first doses were remarkably consistent across drugs, diagnosis, and hospital units. This rhythm in hospital medicine coincided with medical team rounding time, not necessarily immediate medical need. Lastly, we show that the clinical response to hydralazine, an acute antihypertensive, is dosing time-dependent and greatest at night, when the fewest doses were administered. The prevailing dogma is that hospital treatment is administered as needed regardless of time of day. Our findings challenge this notion and reveal a potential operational barrier to best clinical care.
| S-EPMC6800314 | biostudies-literature