Hybrid biogeography-based optimization for integer programming.
Ontology highlight
ABSTRACT:
SUBMITTER: Wang ZC
PROVIDER: S-EPMC4065689 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Remote or stranded areas that cannot be supplied by natural gas through transmission pipelines can access gas through terminals for liquefied natural gas (LNG), from where LNG is distributed by trucks or compressed and regasified into regional distribution networks. The gas supply may be further augmented by local biogas or synthetic natural gas. A model for optimization of such regional gas supply chains is presented in the paper, considering a combination of pipeline and truck delivery to a set of customers with given energy demands. After linearization, the task is formulated as a mixed integer linear programming (MILP) problem and is solved by state-of-the-art software. The model is illustrated on a regional energy supply problem considering seasonal variations in the demands. The results of the study demonstrate the role of the price of the local and alternative fuels and the price margins at which it is feasible to build an extensive pipeline network instead of supplying the fuel by trucks to storages connected to pipeline islands. The findings also give information about the influence on investment versus operation costs on the optimal design of the supply chain. The sensitivity of the optimal supply chain on the price of local and alternative fuels as well as on the unit price of pipes and storage tanks is studied to illustrate how optimization can be used to shed light on the feasibility of investment in new infrastructure and to support the decision making processes in the energy sector.
| S-EPMC6156097 | biostudies-literature
Project description:Understanding the mechanisms of cell function and drug action is a major endeavor in the pharmaceutical industry. Drug effects are governed by the intrinsic properties of the drug (i.e., selectivity and potency) and the specific signaling transduction network of the host (i.e., normal vs. diseased cells). Here, we describe an unbiased, phosphoproteomic-based approach to identify drug effects by monitoring drug-induced topology alterations. With our proposed method, drug effects are investigated under diverse stimulations of the signaling network. Starting with a generic pathway made of logical gates, we build a cell-type specific map by constraining it to fit 13 key phopshoprotein signals under 55 experimental conditions. Fitting is performed via an Integer Linear Program (ILP) formulation and solution by standard ILP solvers; a procedure that drastically outperforms previous fitting schemes. Then, knowing the cell's topology, we monitor the same key phosphoprotein signals under the presence of drug and we re-optimize the specific map to reveal drug-induced topology alterations. To prove our case, we make a topology for the hepatocytic cell-line HepG2 and we evaluate the effects of 4 drugs: 3 selective inhibitors for the Epidermal Growth Factor Receptor (EGFR) and a non-selective drug. We confirm effects easily predictable from the drugs' main target (i.e., EGFR inhibitors blocks the EGFR pathway) but we also uncover unanticipated effects due to either drug promiscuity or the cell's specific topology. An interesting finding is that the selective EGFR inhibitor Gefitinib inhibits signaling downstream the Interleukin-1alpha (IL1alpha) pathway; an effect that cannot be extracted from binding affinity-based approaches. Our method represents an unbiased approach to identify drug effects on small to medium size pathways which is scalable to larger topologies with any type of signaling interventions (small molecules, RNAi, etc). The method can reveal drug effects on pathways, the cornerstone for identifying mechanisms of drug's efficacy.
| S-EPMC2776985 | biostudies-literature
Project description:MotivationSignal-transduction networks are often aberrated in cancer cells, and new anti-cancer drugs that specifically target oncogenes involved in signaling show great clinical promise. However, the effectiveness of such targeted treatments is often hampered by innate or acquired resistance due to feedbacks, crosstalks or network adaptations in response to drug treatment. A quantitative understanding of these signaling networks and how they differ between cells with different oncogenic mutations or between sensitive and resistant cells can help in addressing this problem.ResultsHere, we present Comparative Network Reconstruction (CNR), a computational method to reconstruct signaling networks based on possibly incomplete perturbation data, and to identify which edges differ quantitatively between two or more signaling networks. Prior knowledge about network topology is not required but can straightforwardly be incorporated. We extensively tested our approach using simulated data and applied it to perturbation data from a BRAF mutant, PTPN11 KO cell line that developed resistance to BRAF inhibition. Comparing the reconstructed networks of sensitive and resistant cells suggests that the resistance mechanism involves re-establishing wild-type MAPK signaling, possibly through an alternative RAF-isoform.Availability and implementationCNR is available as a python module at https://github.com/NKI-CCB/cnr. Additionally, code to reproduce all figures is available at https://github.com/NKI-CCB/CNR-analyses.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6129277 | biostudies-literature
Project description:Subspecies nomenclature systems of pathogens are increasingly based on sequence data. The use of phylogenetics to identify and differentiate between clusters of genetically similar pathogens is particularly prevalent in virology from the nomenclature of human papillomaviruses to highly pathogenic avian influenza (HPAI) H5Nx viruses. These nomenclature systems rely on absolute genetic distance thresholds to define the maximum genetic divergence tolerated between viruses designated as closely related. However, the phylogenetic clustering methods used in these nomenclature systems are limited by the arbitrariness of setting intra and intercluster diversity thresholds. The lack of a consensus ground truth to define well-delineated, meaningful phylogenetic subpopulations amplifies the difficulties in identifying an informative distance threshold. Consequently, phylogenetic clustering often becomes an exploratory, ad hoc exercise. Phylogenetic Clustering by Linear Integer Programming (PhyCLIP) was developed to provide a statistically principled phylogenetic clustering framework that negates the need for an arbitrarily defined distance threshold. Using the pairwise patristic distance distributions of an input phylogeny, PhyCLIP parameterizes the intra and intercluster divergence limits as statistical bounds in an integer linear programming model which is subsequently optimized to cluster as many sequences as possible. When applied to the hemagglutinin phylogeny of HPAI H5Nx viruses, PhyCLIP was not only able to recapitulate the current WHO/OIE/FAO H5 nomenclature system but also further delineated informative higher resolution clusters that capture geographically distinct subpopulations of viruses. PhyCLIP is pathogen-agnostic and can be generalized to a wide variety of research questions concerning the identification of biologically informative clusters in pathogen phylogenies. PhyCLIP is freely available at http://github.com/alvinxhan/PhyCLIP, last accessed March 15, 2019.
| S-EPMC6573476 | biostudies-literature
Project description:Background and purposePatients received by radiotherapy departments are diverse and may be diagnosed with different cancers. Therefore, they need different radiotherapy treatment plans and thus have different needs for medical resources. This research aims to explore the best method of scheduling the admission of patients receiving radiotherapy so as to reduce patient loss and maximize the usage efficiency of service resources.Materials and methodsA mix integer programming (MIP) model integrated with special features of radiotherapy is constructed. The data used here is based on the historical data collected and we propose an exact method to solve the MIP model.ResultsCompared with the traditional First Come First Served (FCFS) method, the new method has boosted patient admission as well as the usage of linear accelerators (LINAC) and beds.ConclusionsThe integer programming model can be used to describe the complex problem of scheduling radio-receiving patients, to identify the bottleneck resources that hinder patient admission, and to obtain the optimal LINAC-bed radio under the current data conditions. Different management strategies can be implemented by adjusting the settings of the MIP model. The computational results can serve as a reference for the policy-makers in decision making.
| S-EPMC5503264 | biostudies-literature
Project description:A novel framework for inverse quantitative structure-activity relationships (inverse QSAR) has recently been proposed and developed using both artificial neural networks and mixed integer linear programming. However, classes of chemical graphs treated by the framework are limited. In order to deal with an arbitrary graph in the framework, we introduce a new model, called a two-layered model, and develop a corresponding method. In this model, each chemical graph is regarded as two parts: the exterior and the interior. The exterior consists of maximal acyclic induced subgraphs with bounded height, the interior is the connected subgraph obtained by ignoring the exterior, and the feature vector consists of the frequency of adjacent atom pairs in the interior and the frequency of chemical acyclic graphs in the exterior. Our method is more flexible than the existing method in the sense that any type of graphs can be inferred. We compared the proposed method with an existing method using several data sets obtained from PubChem database. The new method could infer more general chemical graphs with up to 50 non-hydrogen atoms. The proposed inverse QSAR method can be applied to the inference of more general chemical graphs than before.
| S-EPMC8002091 | biostudies-literature
Project description:MotivationCombinatorial therapies play increasingly important roles in combating complex diseases. Owing to the huge cost associated with experimental methods in identifying optimal drug combinations, computational approaches can provide a guide to limit the search space and reduce cost. However, few computational approaches have been developed for this purpose, and thus there is a great need of new algorithms for drug combination prediction.ResultsHere we proposed to formulate the optimal combinatorial therapy problem into two complementary mathematical algorithms, Balanced Target Set Cover (BTSC) and Minimum Off-Target Set Cover (MOTSC). Given a disease gene set, BTSC seeks a balanced solution that maximizes the coverage on the disease genes and minimizes the off-target hits at the same time. MOTSC seeks a full coverage on the disease gene set while minimizing the off-target set. Through simulation, both BTSC and MOTSC demonstrated a much faster running time over exhaustive search with the same accuracy. When applied to real disease gene sets, our algorithms not only identified known drug combinations, but also predicted novel drug combinations that are worth further testing. In addition, we developed a web-based tool to allow users to iteratively search for optimal drug combinations given a user-defined gene set.AvailabilityOur tool is freely available for noncommercial use at http://www.drug.liuzlab.org/.Contactzhandong.liu@bcm.eduSupplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC4016706 | biostudies-literature
Project description:The increase in data amount makes the traditional Internet of Vehicles (IoV) fail to meet users' needs. Hence, the IoV is explored in series. To study the construction of freight integer linear programming (ILP) model based on fog computing (FG), and to analyze the application of the model in the optimization of the networking deployment (ND) of the IoV. FG and ILP are combined to build a freight computing ILP model. The model is used to analyze the application of ND optimization in the IoV system through simulations. The results show that while analyzing the ND results in different scenarios, the model is more suitable for small-scale scenarios and can optimize the objective function; however, its utilization rate is low in large-scale scenarios. While comparing and analyzing the network cost and running time, compared with traditional cloud computing solutions, the ND solution based on FG requires less cost, shorter running time, and has apparent effectiveness and efficiency. Therefore, it is found that the FG-based model has low cost, short running time, and apparent efficiency, which provides an experimental basis for the application of the later deployment of freight vehicles (FVs) in the Internet of Things (IoT) system for ND optimization. The results will provide important theoretical support for the overall deployment of IoV.
| S-EPMC7514103 | biostudies-literature
Project description:BackgroundCurrently, intensity-modulated radiation therapy (IMRT) is commonly used in radiotherapy clinics. However, designing a treatment plan with multiple beam angles depends on the experience of human planners, and is mostly achieved using a trial-and-error approach. It is preferrable but challenging to solve this issue automatically and mathematically using an optimization approach. The goal of this study is to develop a mixed-integer linear programming (MILP) approach for the beam angle optimization (BAO) of non-coplanar IMRT for liver cancer.MethodsMILP models for the BAO of both coplanar and non-coplanar IMRT treatment plans were developed. The beam angles of the IMRT plans were first selected by the MILP model built using mathematical optimization software. Next, the IMRT plans with the selected beam angles was created in a commercial treatment planning system. Finally, the fluence map and dose distribution of the IMRT plans were generated under pre-defined dose-volume constraints. The IMRT plans of 10 liver cancer patients previously treated at our institute were used to assessed the proposed MILP models. For each patient, both coplanar and non-coplanar IMRT plans with beam angles optimized by the MILP models were compared with the IMRT plan clinically approved by physicians.ResultsThe MILP model-guided IMRT plans showed reduced doses for most of the organs at risk (OARs). Compared with the IMRT plans clinically approved by physicians, the doses for the spinal cord (28.5 vs. 36.1, P=0.001<0.05) and liver (27.6 vs. 29.1, P=0.005<0.05) decreased significantly in the IMRT plans with non-coplanar beams selected by the MILP models.ConclusionsThe MILP model is an effective tool for the BAO in coplanar and non-coplanar IMRT treatment planning. It facilitates the automation of IMRT treatment planning for current high-precision radiotherapy.
| S-EPMC11320540 | biostudies-literature
Project description:Nuclear magnetic resonance (NMR) spectroscopy is an important experimental technique that allows one to study protein structure and dynamics in solution. An important bottleneck in NMR protein structure determination is the assignment of NMR peaks to the corresponding nuclei. Structure-based assignment (SBA) aims to solve this problem with the help of a template protein which is homologous to the target and has applications in the study of structure-activity relationship, protein-protein and protein-ligand interactions. We formulate SBA as a linear assignment problem with additional nuclear overhauser effect constraints, which can be solved within nuclear vector replacement's (NVR) framework (Langmead, C., Yan, A., Lilien, R., Wang, L. and Donald, B. (2003) A Polynomial-Time Nuclear Vector Replacement Algorithm for Automated NMR Resonance Assignments. Proc. the 7th Annual Int. Conf. Research in Computational Molecular Biology (RECOMB), Berlin, Germany, April 10-13, pp. 176-187. ACM Press, New York, NY. J. Comp. Bio., (2004), 11, pp. 277-298; Langmead, C. and Donald, B. (2004) An expectation/maximization nuclear vector replacement algorithm for automated NMR resonance assignments. J. Biomol. NMR, 29, 111-138). Our approach uses NVR's scoring function and data types and also gives the option of using CH and NH residual dipolar coupling (RDCs), instead of NH RDCs which NVR requires. We test our technique on NVR's data set as well as on four new proteins. Our results are comparable to NVR's assignment accuracy on NVR's test set, but higher on novel proteins. Our approach allows partial assignments. It is also complete and can return the optimum as well as near-optimum assignments. Furthermore, it allows us to analyze the information content of each data type and is easily extendable to accept new forms of input data, such as additional RDCs.
| S-EPMC4287374 | biostudies-literature