CONSTRAINED MULTI-GROUP PROJECT ALLOCATION USING MAHALANOBIS DISTANCE

Optimal allocation is one of the most active research areas in operation research using binary integer variables. The allocation of multi constrained projects among several options available along a given planning horizon is an especially significant problem in the general area of item classification. The main goal of this dissertation is to develop an analytical approach for selecting projects that would be most attractive from an economic point of view to be developed or allocated among several options, such as in-house engineers and private contractors (in transportation projects). A relevant limiting resource in addition to the availability of funds is the in-house manpower availability. In this thesis, the concept of Mahalanobis distance (MD) will be used as the classification criterion. This is a generalization of the Euclidean distance that takes into account the correlation of the characteristics defining the scope of a project. The desirability of a given project to be allocated to an option is defined in terms of its MD to that particular option. Ideally, each project should be allocated to its closest option. This, however, may not be possible because of the available levels of each relevant resource. The allocation process is formulated mathematically using two Binary Integer Programming (BIP) models. The first formulation maximizes the dollar value of benefits derived by the traveling public from those projects being implemented subject to a budget, total sum of MD, and in-house manpower constraints. The second formulation minimizes the total sum of MD subject to a budget and the in-house manpower constraints. The proposed solution methodology for the BIP models is based on the branchand- bound method. In particular, one of the contributions of this dissertation is the development of a strategy for branching variables and node selection that is consistent with allocation priorities based on MD to improve the branch-and-bound performance level as well as handle a large scale application. The suggested allocation process includes: (a) multiple allocation groups; (b) multiple constraints; (c) different BIP models. Numerical experiments with different projects and options are considered to illustrate the application of the proposed approach

Data-driven optimization of bus schedules under uncertainties

Plusieurs sous-problèmes d’optimisation se posent lors de la planification des transports publics. Le problème d’itinéraires de véhicule (PIV) est l’un d’entre eux et consiste à minimiser les coûts opérationnels tout en assignant exactement un autobus par trajet planifié de sorte que le nombre d’autobus entreposé par dépôt ne dépasse pas la capacité maximale disponible. Bien que les transports publics soient sujets à plusieurs sources d’incertitude (à la fois endogènes et exogènes) pouvant engendrer des variations des temps de trajet et de la consommation d’énergie, le PIV et ses variantes sont la plupart du temps résolus de façon déterministe pour des raisons de résolubilité. Toutefois, cette hypothèse peut compromettre le respect de l’horaire établi lorsque les temps des trajets considérés sont fixes (c.-à-d. déterministes) et peut produire des solutions impliquant des politiques de gestion des batteries inadéquates lorsque la consommation d’énergie est aussi considérée comme fixe. Dans cette thèse, nous proposons une méthodologie pour mesurer la fiabilité (ou le respect de l’horaire établi) d’un service de transport public ainsi que des modèles mathématiques stochastiques et orientés données et des algorithmes de branch-and-price pour deux variantes de ce problème, à savoir le problème d’itinéraires de véhicule avec dépôts multiples (PIVDM) et le problème d’itinéraires de véhicule électrique (PIV-E). Afin d’évaluer la fiabilité, c.-à-d. la tolérance aux délais, de certains itinéraires de véhicule, nous prédisons d’abord la distribution des temps de trajet des autobus. Pour ce faire, nous comparons plusieurs modèles probabilistes selon leur capacité à prédire correctement la fonction de densité des temps de trajet des autobus sur le long terme. Ensuite, nous estimons à l'aide d'une simulation de Monte-Carlo la fiabilité des horaires d’autobus en générant des temps de trajet aléatoires à chaque itération. Nous intégrons alors le modèle probabiliste le plus approprié, celui qui est capable de prédire avec précision à la fois la véritable fonction de densité conditionnelle des temps de trajet et les retards secondaires espérés, dans nos modèles d'optimisation basés sur les données. Deuxièmement, nous introduisons un modèle pour PIVDM fiable avec des temps de trajet stochastiques. Ce problème d’optimisation bi-objectif vise à minimiser les coûts opérationnels et les pénalités associées aux retards. Un algorithme heuristique basé sur la génération de colonnes avec des sous-problèmes stochastiques est proposé pour résoudre ce problème. Cet algorithme calcule de manière dynamique les retards secondaires espérés à mesure que de nouvelles colonnes sont générées. Troisièmement, nous proposons un nouveau programme stochastique à deux étapes avec recours pour le PIVDM électrique avec des temps de trajet et des consommations d’énergie stochastiques. La politique de recours est conçue pour rétablir la faisabilité énergétique lorsque les itinéraires de véhicule produits a priori se révèlent non réalisables. Toutefois, cette flexibilité vient au prix de potentiels retards induits. Une adaptation d’un algorithme de branch-and-price est développé pour évaluer la pertinence de cette approche pour deux types d'autobus électriques à batterie disponibles sur le marché. Enfin, nous présentons un premier modèle stochastique pour le PIV-E avec dégradation de la batterie. Le modèle sous contrainte en probabilité proposé tient compte de l’incertitude de la consommation d’énergie, permettant ainsi un contrôle efficace de la dégradation de la batterie grâce au contrôle effectif de l’état de charge (EdC) moyen et l’écart de EdC. Ce modèle, combiné à l’algorithme de branch-and-price, sert d’outil pour balancer les coûts opérationnels et la dégradation de la batterie.The vehicle scheduling problem (VSP) is one of the sub-problems of public transport planning. It aims to minimize operational costs while assigning exactly one bus per timetabled trip and respecting the capacity of each depot. Even thought public transport planning is subject to various endogenous and exogenous causes of uncertainty, notably affecting travel time and energy consumption, the VSP and its variants are usually solved deterministically to address tractability issues. However, considering deterministic travel time in the VSP can compromise schedule adherence, whereas considering deterministic energy consumption in the electric VSP (E-VSP) may result in solutions with inadequate battery management. In this thesis, we propose a methodology for measuring the reliability (or schedule adherence) of public transport, along with stochastic and data-driven mathematical models and branch-and-price algorithms for two variations of this problem, namely the multi-depot vehicle scheduling problem (MDVSP) and the E-VSP. To assess the reliability of vehicle schedules in terms of their tolerance to delays, we first predict the distribution of bus travel times. We compare numerous probabilistic models for the long-term prediction of bus travel time density. Using a Monte Carlo simulation, we then estimate the reliability of bus schedules by generating random travel times at each iteration. Subsequently, we integrate the most suitable probabilistic model, capable of accurately predicting both the true conditional density function of the travel time and the expected secondary delays, into the data-driven optimization models. Second, we introduce a model for the reliable MDVSP with stochastic travel time minimizing both the operational costs and penalties associated with delays. To effectively tackle this problem, we propose a heuristic column generation-based algorithm, which incorporates stochastic pricing problems. This algorithm dynamically computes the expected secondary delays as new columns are generated. Third, we propose a new two-stage stochastic program with recourse for the electric MDVSP with stochastic travel time and energy consumption. The recourse policy aims to restore energy feasibility when a priori vehicle schedules are unfeasible, which may lead to delays. An adapted algorithm based on column generation is developed to assess the relevance of this approach for two types of commercially available battery electric buses. Finally, we present the first stochastic model for the E-VSP with battery degradation. The proposed chance-constraint model incorporates energy consumption uncertainty, allowing for effective control of battery degradation by regulating the average state-of-charge (SOC) and SoC deviation in each discharging and charging cycle. This model, in combination with a tailored branch-and-price algorithm, serves as a tool to strike a balance between operational costs and battery degradation

A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set

Operational Research: Methods and Applications

Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first aims to summarise the up-to-date knowledge and provide an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion. It should be used as a point of reference or first-port-of-call for a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order. The authors dedicate this paper to the 2023 Turkey/Syria earthquake victims. We sincerely hope that advances in OR will play a role towards minimising the pain and suffering caused by this and future catastrophes

14th Conference on DATA ANALYSIS METHODS for Software Systems

DAMSS-2023 is the 14th International Conference on Data Analysis Methods for Software Systems, held in Druskininkai, Lithuania. Every year at the same venue and time. The exception was in 2020, when the world was gripped by the Covid-19 pandemic and the movement of people was severely restricted. After a year’s break, the conference was back on track, and the next conference was successful in achieving its primary goal of lively scientific communication. The conference focuses on live interaction among participants. For better efficiency of communication among participants, most of the presentations are poster presentations. This format has proven to be highly effective. However, we have several oral sections, too. The history of the conference dates back to 2009 when 16 papers were presented. It began as a workshop and has evolved into a well-known conference. The idea of such a workshop originated at the Institute of Mathematics and Informatics, now the Institute of Data Science and Digital Technologies of Vilnius University. The Lithuanian Academy of Sciences and the Lithuanian Computer Society supported this idea, which gained enthusiastic acceptance from both the Lithuanian and international scientific communities. This year’s conference features 84 presentations, with 137 registered participants from 11 countries. The conference serves as a gathering point for researchers from six Lithuanian universities, making it the main annual meeting for Lithuanian computer scientists. The primary aim of the conference is to showcase research conducted at Lithuanian and foreign universities in the fields of data science and software engineering. The annual organization of the conference facilitates the rapid exchange of new ideas within the scientific community. Seven IT companies supported the conference this year, indicating the relevance of the conference topics to the business sector. In addition, the conference is supported by the Lithuanian Research Council and the National Science and Technology Council (Taiwan, R. O. C.). The conference covers a wide range of topics, including Applied Mathematics, Artificial Intelligence, Big Data, Bioinformatics, Blockchain Technologies, Business Rules, Software Engineering, Cybersecurity, Data Science, Deep Learning, High-Performance Computing, Data Visualization, Machine Learning, Medical Informatics, Modelling Educational Data, Ontological Engineering, Optimization, Quantum Computing, Signal Processing. This book provides an overview of all presentations from the DAMSS-2023 conference

Operational Research: Methods and Applications

Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first aims to summarise the up-to-date knowledge and provide an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion. It should be used as a point of reference or first-port-of-call for a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order