scholarly journals Linear Integer Model for the Course Timetabling Problem of a Faculty in Rio de Janeiro

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Valdecy Pereira ◽  
Helder Gomes Costa
Keyword(s):  
Integer Programming ◽  
Response Time ◽  
Rio De Janeiro ◽  
Programming Model ◽  
Specific Weight ◽  
Timetabling Problem ◽  
Linear Integer Programming ◽  
Integer Linear Model ◽  
Course Timetabling Problem ◽  
Conflicting Goals

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.

scholarly journals Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem

2014 ◽  
Vol 2 (5) ◽  
pp. 451-460 ◽  
Author(s):  
Jianming Zhu
Keyword(s):  
Integer Programming ◽  
Facility Location ◽  
Shortest Path ◽  
Location Problem ◽  
Programming Model ◽  
Maximum Clique ◽  
Facility Location Problem ◽  
Linear Integer Programming ◽  
Non Linear ◽  
The Cost

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.

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
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Sequence Data ◽  
Ground Truth ◽  
Human Papillomaviruses ◽  
Clustering Methods ◽  
Distance Threshold ◽  
Phylogenetic Clustering ◽  
Linear Integer Programming ◽  
Patristic Distance

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.

scholarly journals MODEL PENJADWALAN KEBERANGKATAN BUS DENGAN STRATEGI ALTERNATING DEADHEADING: STUDI KASUS DI PO RAYA

2013 ◽  
Vol 12 (2) ◽  
pp. 1
Author(s):  
R. A. CAHYADI ◽  
A. AMAN ◽  
F. HANUM
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Integer Programming Model ◽  
Linear Integer Programming

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.

View Materialization in a Data Cube

2009 ◽  
pp. 204-223
Author(s):  
Vikas Agrawal ◽  
P. S. Sundararaghavan ◽  
Mesbah U. Ahmed ◽  
Udayan Nandkeolyar
Keyword(s):  
Integer Programming ◽  
Response Time ◽  
Data Warehouse ◽  
Data Cube ◽  
Decision Makers ◽  
Efficient Design ◽  
Linear Integer Programming ◽  
Query Response Time ◽  
View Materialization ◽  
The Right

Data warehouse has become an integral part in developing a DSS in any organization. One of the key architectural issues concerning the efficient design of a data warehouse is to determine the “right” number of views to be materialized in order to minimize the query response time experienced by the decision makers in the organization. We consider a bottleneck objective in designing such a materialization scheme which has the effect of guaranteeing a certain level of performance. We examine linear integer programming formulations, and develop heuristics and report on the performance of these heuristics. We also evaluate heuristics reported in the literature for the view materialization problem with a simpler objective.

scholarly journals University Course Timetabling Problem with Professor Assignment

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Nancy Maribel Arratia-Martinez ◽  
Cristina Maya-Padron ◽  
Paulina A. Avila-Torres
Keyword(s):  
Programming Model ◽  
Fixed Number ◽  
Full Time ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Part Time ◽  
Course Timetabling Problem ◽  
University Course ◽  
The University

One of the decision problems in many organizations and institutions is to decide how to schedule different tasks, in particular, in higher education institutions. One of the main problems is the university course timetabling problem (UCTP): this problem consists of the allocation of events (courses, professors, and students) to a number of fixed time slots and rooms, this at the beginning of each academic period of the universities. The existent formulations include particular requirements from different educational levels and institutions, as in our case. In this paper, we focus on the university course timetabling problem with the assignment of professor-course-time slot for an institution in Mexico. Timetabling is constructed for the disciplinary courses that are offered by one of the academic departments. The main characteristics are as follows: (1) there are full-time and part-time professors; (2) a mandatory fixed number of courses has to be assigned to each full-time professor according to their academic profile; (3) there is a maximum number of courses assigned to part-time professors; (4) a professor-course matrix that specifies the valid assignation is defined; and (5) mandatory time periods for courses in different semesters are established and other traditional constraints. We present the integer linear programming model proposed to solve the case studied. The optimal solution was obtained with low computational effort through the classical branch-and-bound algorithm. We describe the complete timetable to show the model effectiveness.

scholarly journals Considering Section Balance in an Integer Optimization Model for the Curriculum-Based Course Timetabling Problem

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1763
Author(s):  
Cristian D. Palma ◽  
Patrick Bornhardt
Keyword(s):  
Programming Model ◽  
Educational Institution ◽  
Integer Optimization ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Proposed Model ◽  
Actual Solution ◽  
Course Timetabling Problem ◽  
University Course

University course timetabling is a complex and time-consuming duty that every educational institution faces regularly. It consists of scheduling a set of lectures in predefined time slots so as to avoid student conflicts, meet teacher and room availability, and manage several institution-specific operational rules. In this paper, we schedule courses based on a curriculum, that is, before the students’ registration. Unlike other curriculum-based models, the proposed model considers two practical aspects when managing the conflicts between lectures: (i) it schedules sections of subjects so that each section is evenly likely to be registered by the students, and (ii) it considers the failure rates and periodicity a subject is taught. We present a multi-objective integer programming model that maximizes the use of specific time slots, the symmetry in which the lectures of a course are scheduled during a week, and the flexibility for straggler students to take courses. The model is solved using commercial software, and it is applied to a real course-timetabling problem. We show the advantages of its use by comparing the model’s solution with the actual solution obtained by the manual scheduling.

Sign in / Sign up

Export Citation Format

Share Document