scholarly journals Phylogenetic Clustering by Linear Integer Programming (PhyCLIP)

2018 ◽  
Author(s):  
Alvin X. Han ◽  
Edyth Parker ◽  
Frits Scholer ◽  
Sebastian Maurer-Stroh ◽  
Colin A. Russell

AbstractSub-species 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 inter-cluster 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 parameterises the intra- and inter-cluster divergence limits as statistical bounds in an integer linear programming model which is subsequently optimised to cluster as many sequences as possible. When applied to the haemagglutinin 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 generalised 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.

2014 ◽  
Vol 2 (5) ◽  
pp. 451-460 ◽  
Author(s):  
Jianming Zhu

AbstractIn this paper, a new location analysis method is presented. Given a connected graphG= (V, E)with nonnegative edge costcefor each edgee∊E,dijis the cost of the shortest path between verticesiandjin the graph. TheConnected p-facility Location Problem(CpLP) is to choosepvertices fromVso as to minimize the total cost of shortest path of pair-wise of thesepvertices. This problem is proved to be NP-hard and non-linear integer programming is formulated. Then, two algorithms are designed for solving the CpLP. One is a heuristic algorithm based on classical maximum clique approach, while the second one is genetic algorithm. Finally, computational results show the comparison between these two algorithms.


2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Valdecy Pereira ◽  
Helder Gomes Costa

This work presents a linear integer programming model that solves a timetabling problem of a faculty in Rio de Janeiro, Brazil. The model was designed to generate solutions that meet the preferences of the faculty’s managers, namely, allocating the maximum number of lecturers with highest academic title and minimising costs by merging courses with equivalent syllabuses. The integer linear model also finds solutions that meet lecturers’ scheduling preferences, thereby generating more practical and comfortable schedules for these professionals. Preferences were represented in the objective function, each with a specific weight. The model outperformed manual solutions in terms of response time and quality. The model was also able to demonstrate that lecturers’ scheduling preferences are actually conflicting goals. The model was approved by the faculty’s managers and has been used since the second semester of 2011.


2013 ◽  
Vol 12 (2) ◽  
pp. 1
Author(s):  
R. A. CAHYADI ◽  
A. AMAN ◽  
F. HANUM

Penjadwalan keberangkatan bus merupakan salah satu hal yang penting dalam pengelolaan perusahaan otobus untuk menekan biaya operasional. Masalah penjadwalan ini diformulasikan sebagai suatu model linear integer programming. Model ini bertujuan untuk mengatur banyaknya bus yang akan diberangkatkan dari masing-masing kota untuk memenuhi permintaan transportasi. Strategi yang digunakan untuk mengatur penjadwalan bus yaitu strategi deadheading. Strategi deadheading merupakan strategi penjadwalan bus yang dilakukan apabila terjadi ketidakseimbangan akan banyaknya penumpang di suatu kota dan adanya keterbatasan bus yang beroperasi. Model penjadwalan dengan deadheading ini merupakan salah satu upaya untuk menurunkan frekuensi keberangkatan bus sehingga dapat meningkatkan efisiensi biaya operasional.


Author(s):  
Santosh Kumar ◽  
Elias Munapo ◽  
Philimon Nyamugure

This article enhances properties and applications associated with the characteristic equation (CE) developed to find an optimal and other ranked-optimal solutions of linear integer programming model. These enhanced properties have applications in the analysis of the multi-objective linear integer programs. The paper also identifies why the CE approach is not possible for some special linear programming (LP) models and creates a challenge for further investigation.


2021 ◽  
Vol 15 (1) ◽  
pp. 93-107
Author(s):  
Hande C. Kazanç ◽  
Mehmet Soysal ◽  
Mustafa Çimen

Aims: This study proposes a bi-objective linear integer programming model for heterogeneous fleet VAP with emissions considerations. Profit maximization and emissions minimization objectives are employed to handle economic and environmental sustainability purposes. Background: Our literature survey shows that there is no model for the heterogeneous fleet VAP with emissions considerations that simultaneously consider vehicle heterogeneity, penalty costs for unmet demands, and emissions from transportation operations. Objective: The model is employed to also make several scenario analyses on sustainable freight logistics management to understand the trade-offs among economic and environmental objectives. In freight transportation problems, decision-makers need to be able to maintain profitability and to reduce emissions. Methods: In this study, a bi-objective linear integer programming model is proposed for a heterogeneous fleet Vehicle Allocation Problem (VAP) with emissions considerations encountered in the field of sustainable freight transportation. Results: In the numerical analyses, various practical assumptions that can be confronted by decision-makers in real life are discussed. In each analysis, total profit and emissions amounts are revealed along with several other KPIs. The results of the analyses provided in this study could also be useful in terms of understanding the relations among pillars of sustainability in VAPs. Conclusion: It is thought that the proposed model has the potential to aid decision-making processes in sustainable logistics management. In the base case analyses, the total profit obtained under profit maximization is about nine times higher than that obtained under emissions minimization. When the aim is to minimize emissions, the total emissions are found to be nearly one-tenth of that of profit maximization. Supported by also additional scenario analyses, it can be concluded that it might not economically viable to be environmentally-friendly for companies. Therefore, companies have to be encouraged or forced to take environmentally and socially responsible actions through legislation. The analyses demonstrated that various legislative policies on emissions may affect the transportation plans differently in such vehicle allocation systems.


Author(s):  
ZhiJian Ye ◽  
YanWei Li ◽  
JingTing Bai ◽  
Xinxin Zheng

The purpose of this study was to ascertain the effect of weight setting of objectives on displacement and implementation difficulty in slot allocation model. A linear integer programming model including three kinds of evaluation objectives with different weight is designed to compare and analysis displacement and implementation difficulty in slot allocation model. The average difficulty is very sensitive to the average displacement. The difficulty of implementation can be significantly reduced by weight setting with a little increase of displacement. Movements list descent according to priority or not have great impact on displacement and implementation difficulty in slot allocation model. Capacity is a key factor affecting displacement and implementation difficulties. The difficulty index proposed in this work is very useful in identifying which slot allocation scheme is better for decision maker. Our research can promote regulator to upgrade slot allocation policies.


Information ◽  
2019 ◽  
Vol 10 (6) ◽  
pp. 188
Author(s):  
ZhiJian Ye ◽  
YanWei Li ◽  
JingTing Bai ◽  
XinXin Zheng

The purpose of this study is to ascertain whether implementation difficulty can be used in a slot allocation model as a new mechanism for slightly weakening grandfather rights; according to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within the slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.


Sign in / Sign up

Export Citation Format

Share Document