As the interest in electric heavy-duty vehicles has grown, so has the need for route planning tools to coordinate fleets of electric vehicles. This problem is called the Electric Vehicle Routing Problem (EVRP) and it can be solved using a Branch-Price-and-Cut method, where routes for individual vehicles are iteratively generated using information from the coordinated problem. These routes are computed in a pricing problem, which is a Resource Constrained Elementary Shortest Path Problem (RCESPP). Because of its iterative nature, the Branch-Price-and-Cut method is dependent on a fast solver for this RCSPP to get a good computational performance. In this thesis, we have implemented a labeling algorithm for the RCESSP for electric vehicles with state-of-the-art acceleration strategies. We further suggest a new bounding method that exploits the electric aspects of the problem. The algorithm's performance and the effect of the different acceleration strategies are evaluated on benchmark instances for the EVRP, and we report significantly improved computational times when using our bounding method for all types of instances. We find that route relaxation methods (ng-routes) were particularly advantageous in test instances with a combination of clustered and randomly distributed customers. Interestingly, for test instances with only randomly distributed customers, ng-relaxation required longer processing time to achieve elementary optimal routes and for these instances, the bounding methods gave better computational performance.

This thesis addresses the Vehicle Routing Problem with Interdiction (VRPI), an extension of the classic Vehicle Routing Problem (VRP) that incorporates the risk of route interdiction due to events such as natural disasters, armed conflicts, and infrastructural failures, among others. These interdictions introduce uncertainty and complexity into logistics planning, requiring innovative approaches to the routing process. This research employs both exact methods, using the CPLEX solver, and heuristic methods, particularly using the Greedy Randomized Adaptive Search Procedure (GRASP), to solve VRPI with different instance sizes. This research’s key contributions include successfully implementing the GRASP algorithm on large-scale benchmark instances, representing a significant advancement over prior implementations that focused on smaller, randomly generated instances. A flexible framework was also developed to adapt the GRASP methodology for different VRP variants, including the Capacitated Vehicle Routing Problem (CVRP) and Split Delivery Vehicle Routing Problem (SDVRP), with and without interdiction. A feasibility analysis for small instances was developed using CPLEX, highlighting the sensitivity of VRPI solutions to interdiction probabilities, particularly in scenarios with tight capacity constraints. The findings of this analysis are extended to large instances. Additionally, a 3-fold logic was incorporated in the GRASP implementation—focused on minimizing cost, minimizing interdiction, and minimizing demand—proved crit- ical in facing the VRPI challenges, and provided high-quality solutions with reduced computational effort. Including the minimum demand logic in GRASP was instrumen- tal during the implementation and numerical experimentation for large benchmark in- stances. The implications of this thesis are significant for operational research (OR), particularly in high-risk environments where route interdictions can occur. Future research directions include generating more diverse benchmark instances for VRPI, exploring the impact of variability in interdiction probabilities on solution quality and computational time, and applying exact methods like dynamic programming to solve large VRP instances. / Thesis / Master of Science (MSc)

Les activités de transport jouent un rôle crucial autant dans le domaine de la production que dans celui des services. En particulier, elles permettent d’assurer la distribution de biens et de services entre fournisseurs, unités de production, entrepôts, distributeurs, et clients finaux. Plus spécifiquement, les problèmes de tournées de véhicules (VRP) considèrent la mise au point d’un ensemble de tournées de coût minimal servant la demande en biens ou en services d’un ensemble de clients distribués géographiquement, tout en vérifiant un ensemble de contraintes opérationnelles. Alors qu’il s’agissait d’un problème statique, des avancées technologiques récentes permettent aux organisations de gérer leur flotte de véhicules en temps réel. Cependant, ces nouvelles technologies introduisent également une plus grande complexité dans les tâches de gestion de flotte, révélant une demande pour des outils d’aide à la décision dédiés aux problèmes de tournées de véhicules dynamiques. Dans ce contexte, les contributions de la présente thèse de doctorat s’organisent autour de trois axes : (i) elle présente un état de l’art détaillé des problèmes de tournées dynamiques; (ii) elle introduit des frameworks d’optimisation génériques adaptés à une grande variété de problèmes ; (iii) elle définit un problème de tournées novateur et aux nombreuses applications. / Within the wide scope of logistics management,transportation plays a central role and is a crucialactivity in both production and service industry.Among others, it allows for the timely distributionof goods and services between suppliers, productionunits, warehouses, retailers, and final customers.More specifically, Vehicle Routing Problems(VRPs) deal with the design of a set of minimal costroutes that serve the demand for goods orservices of a set of geographically spread customers,satisfying a group of operational constraints.While it was traditionally a static problem, recenttechnological advances provide organizations withthe right tools to manage their vehicle fleet in realtime. Nonetheless, these new technologies alsointroduce more complexity in fleet managementtasks, unveiling the need for decision support systemsdedicated to dynamic vehicle routing. In thiscontext, the contributions of this Ph.D. thesis arethreefold : (i) it presents a comprehensive reviewof the literature on dynamic vehicle routing ; (ii)it introduces flexible optimization frameworks thatcan cope with a wide variety of dynamic vehiclerouting problems ; (iii) it defines a new vehicle routingproblem with numerous applications.

Various types of transportation issues are a common practice. The issue may be approached mainly as the distribution of products from suppliers to consumers while minimising distribution costs. The difference of real transportation issues predominantly relates to the considered restrictions, such as capacities of vehicles and orders, time windows and other special distribution restrictions. Transportation issues were already defined by F.L. Hitchcock in 1941 and since then, a wide range of stochastic and non- determinist methods providing solutions to transportation issues have been developed. Nevertheless, introducing distribution restrictions in resolving real-life problems makes it difficult for such methods to be applied. This thesis provides a compilation of the well-known determinist methods that may be used to resolve transportation issues. The methods that are appropriate for resolving real issues are discussed in more detail. The solution procedure of the selected method is demonstrated using simple examples and the results are compared with the results of other methods. An analysis of the above methods is used to design and implement new methods to resolve real transportation issues, their results being compared with the methods provided by the commercial software product.

The thesis deals with optimization problems which arise at distribution planning. These problems can often be easily formulated as integer programming problems, but rarely can be solved using mixed integer programming techniques. Therefore, it is necessary to study the efficiency of heuristic algorithms. The main focus of the thesis is on the vehicle routing problem with time windows. A tabu search algorithm for this problem was developed and implemented. It uses integer programming to solve the set partitioning problem in order to find optimal distribution of all customers into feasible routes found during the search. The results of the classical integer programming approach, basic insertion heuristic and presented tabu search algorithm are compared in a numerical study.

In this Dissertation, the Vehicle Routing Problem with Drones (VRPD), motivated by the growing interest on Unmanned Aerial Vehicles (UAVs, or Drones) by the industry and their applications in logistics is studied. A pioneer work by (MURRAY; CHU, 2015) shows a combination between UAV and a truck to deliver products, presenting an adaptation to the Traveling Salesman Problem (TSP). After a literature review, an extension of the model from Murray and Chu (2015) we present a model for the problem with multiple vehicles. This model is developed as a Mixed Integer Linear Programming (MILP) problem and solved with the solver CPLEX. A heuristic based on a Hybrid Genetic Algorithm (HGA) is also developed and presented. Our results show that the use of drones reduces the total mileage of the trucks by a significant percentage. / Nessa monografia estuda-se o Problema do Roteamento de Veículos com Drones (PRVD), motivado pelo crescente interesse da indústria em Veículos Aéreos Não Tripulados (VANTs) e suas aplicações em logística. O trabalho pioneiro de (MURRAY; CHU, 2015) mostra uma combinação entre VANT e um caminhão para realização de entregas de produtos, no qual foi proposta uma adaptação do Problema do Caixeiro Viajante (PCV). Após uma revisão de literatura, apresenta-se uma extensão do modelo de Murray and Chu (2015) para o problema com múltiplos veículos. Desenvolveu-se um modelo de Programação Linear Inteira Mista que foi resolvido com o solver CPLEX. Uma heurística basead em um Algoritmo Genético Híbrido também foi desenvolvido e é apresentada. Resultados mostram que a utilização dos VANTs reduzem a quilometragem dos caminhões significativamente.

Il y a soixante ans, le 4 octobre 1957, Spoutnik, le premier satellite artificiel conçu par l’homme, est envoyé dans l’espace. Sa seule fonction est d’émettre un bip radio à des fréquences de 20 et 40 MHz pour démontrer la puissance spatiale de l’URSS. Depuis cette époque les satellites se sont multipliés et leurs missions se sont diversifiées. Aujourd’hui, les missions des satellites sont si variées que certains quittent l’orbite terrestre. On parle dans ce cas de sondes, même si, dans le reste de cette thèse, ils seront inclus dans le terme "satellite". La mission des satellites la plus connue du grand public est la découverte de l’univers et l’exploration interplanétaire avec de célèbres satellites comme le télescope spatial international Hubble ou des sondes comme Rosetta, Voyager 1 et 2, ... Cependant de nos jours, même si l’exploration spatiale reste un enjeu majeur de l’humanité, la plupart des satellites ont des missions plus modestes qui ont pourtant un impact important sur la vie économique et politique. Les satellites en question ont aujourd’hui deux buts : la défense et le commercial. Dans les deux cas on peut diviser les satellites en deux groupes distincts : les satellites d’observation et les satellites de télécommunication. Pour fonctionner tous ces satellites utilisent un harnais électrique. Le harnais électrique regroupe tous les câbles présents dans le satellite et qui ne transportent pas de données client. Dans le cadre de cette thèse nous nous intéressons à l’optimisation de la conception du harnais électrique des satellites. / Sixty years ago, on October 4, 1957, Sputnik, the first man-made artificial satellite, was sent into space. Its only function is to emit a radio beep at frequencies of 20 and 40 MHz to demonstrate the space power of the USSR. Since then, satellites have been multiple and their missions have diversified. Today, the missions of the satellites are so varied that some leave Earth's orbit. We speak in the case of probes, even if, in the rest of this thesis, they will be included in the term "satellite". The best-known satellite mission of the general public is the discovery of the universe and interplanetary exploration with satellite satellites such as the Hubble International Space Telescope or probes such as Rosetta, Voyager 1 and 2, ... nevertheless nowadays Although space exploration remains a major issue for humanity, most satellites have smaller missions that have a significant impact on economic and political life. The satellites in question today have two goals: defense and commercial. In both cases the satellites can be divided into two distinct groups: observation satellites and telecommunication satellites. To operate all these satellites, use an electrical harness. The electrical harness includes all the cables present in the satellite and which does not carry any customer data. As part of this we are interested in optimizing the design of the electrical harness of satellites.

Cette thèse, présente des contributions à la résolution (sur les GPUs) de problèmes d'optimisations réels de grandes tailles. Les problèmes de tournées de véhicules (VRP) et ceux de localisation des hubs (HLP) sont traités. Diverses approches et leur implémentions sur GPU pour résoudre des variantes du VRP sont présentées. Un algorithme génétique (GA) parallèle sur GPU est proposé pour résoudre différentes variantes du HLP. Le GA adapte son codage, sa solution initiale, ses opérateurs génétiques et son implémentation à chacune des variantes traitées. Enfin, nous avons utilisé le GA pour résoudre le HLP avec des incertitudes sur les données.Les tests numériques montrent que les approches proposées exploitent efficacement la puissance de calcul du GPU et ont permis de résoudre de larges instances jusqu'à 6000 nœuds. / This thesis presents contributions to the resolution (on GPUs) of real optimization problems of large sizes. The vehicle routing problems (VRP) and the hub location problems (HLP) are treated. Various approaches implemented on GPU to solve variants of the VRP. A parallel genetic algorithm (GA) on GPU is proposed to solve different variants of the HLP. The proposed GA adapts its encoding, initial solution, genetic operators and its implementation to each of the variants treated. Finally, we used the GA to solve the HLP with uncertainties on the data.The numerical tests show that the proposed approaches effectively exploit the computing power of the GPU and have made it possible to resolve large instances up to 6000 nodes.

Le but de ce travail de thèse réside dans la planification de la distribution urbaine des marchandises dans un système de transport collaboratif. Cette collaboration consiste à échanger les demandes de transport entre transporteurs afin d'améliorer l'efficacité de leurs opérations. Cela revient à minimiser la distance parcourue par les camions et à maximiser le profit collecté des clients, notamment en recourant à des variantes du problème de tournées de véhicules plus adaptées au contexte collaboratif. Le problème opérationnel sous-jacent est donc le problème de tournées de véhicules sélectives dans lequel le service de tous les clients n'est pas obligatoire par contre un "profit" est collecté lors du service d'un client. Dans cette thèse, nous traitons le problème de tournées de véhicules sélectives avec contraintes de temps et de capacité (Capacitated Team Orienteering Problem - CTOP). Nous proposons une métaheuristique qui alterne entre deux espaces de recherche. Des procédures de découpage optimal et de concaténation permettent de passer d'un espace à un autre. D'autre part, en considérant des demandes de collecte et de livraison, nous traitons deux variantes sélectives du problème de collecte et de livraison (Pickup and Delivery Problem - PDP) : le PDP avec fenêtres de temps et demandes obligatoires (PDPTWPR) et le PDPTWPR avec demandes groupées. La première variante consiste à choisir parmi les demandes de transport optionnelles quelles demandes à servir en plus des demandes obligatoires. Nous développons des métaheuristiques pour traiter les cas mono-objectif et multi-objectif du problème. Le PDPTWPR avec demandes groupées prend en considération les demandes de transport qui doivent être servies par un même transporteur. Finalement, nous considérons la variante sélective dans laquelle les marchandises sont distribuées d'un même dépôt vers les clients (Capacitated Profitable Tour Problem - CPTP). L'objectif est de maximiser la différence entre le coût et le profit. Pour résoudre ce problème, nous proposons un algorithme de résolution exacte basé sur la programmation linéaire en nombres entiers à laquelle nous ajoutons plusieurs inégalités valides spécifiques à ce problème. Des expérimentations ont été conduites sur plusieurs classes d'instances afin de montrer l'efficacité de nos approches. / The goal of this thesis is to plan urban freight distribution in a collaborative logistic system. The collaboration consists in exchanging transportation requests between carriers to increase the efficiency of their operations. More precisely, when solving variants of the wellknown vehicle's routing problems in collaborative context, less kilometers can be driven and higher prices can be collected. The underlying operational problem is therefore the selective vehicle routing problem in which not all customers can be served, but a "profit" is gained for each served one. In this thesis, we firstly address the Capacitated Team Orienteering Problem (CTOP), a selective variant of the VRP in which capacity and travel time limitations are imposed to vehicles. We propose a variable space search metaheuristic that alternates between two different search spaces to solve CTOP. Then, we consider pickup and delivery requests to study two variants of the selective pickup and delivery problem: the PDP with Time Windows and Reserved requests (PDPTWPR) and the Clustered PDPTWPR. The first aims to choose suitable selective requests to be transported in addition to reserved ones. Metaheuristics are proposed to deal with the single-objective and the multi-objective sides of the problem. The second takes into consideration groups of requests that must be served by only one carrier. Finally, we consider the Capacitated Profitable Tour Problem (CPTP) in which goods need to be distributed from the depot to customers. We propose an exact method based on Integer Linear Programming to solve this problem. A set of cuts specific to CPTP is proposed in order to speed up the solution process. Experiments were conducted on a variety of instances of different sizes to demonstrate the effectiveness of our solution methods.

O transporte rodoviário é uma das atividades econômicas do homem que mais contribuem para a emissão de Gases de Efeito Estufa (GEE) na atmosfera. Sabe-se que a emissão de CO2 está diretamente vinculada ao consumo de combustível. Por isso, é possível encontrar uma série de trabalhos que objetivam diminuir as emissões por meio da redução do consumo de combustível dos veículos. A otimização de rotas é uma importante ferramenta para essa redução e, consequentemente, possibilita minimizar as emissões dos veículos. Esta pesquisa tem como objetivo aplicar em uma empresa líder na distribuição de revistas no país o PRP, que é um modelo de minimização do consumo de combustível/emissão de GEE por meio de ajustes das variáveis como velocidade média, quantidade de carga transportada, distância percorrida e inclinações das vias. Como a maioria das metodologias de estimativa de combustível existentes na literatura não considera a inclinação das vias nos seus cálculos, neste trabalho foi necessário desenvolver uma metodologia para incluí-la no modelo. Testes foram efetuados com variações nas janelas de tempo, e o modelo mostrou-se sensível a cada uma das variáveis analisadas, gerando economias em 100% das rotas estudadas. / Road transport is one of the biggest contributors of Greenhouse Gases emissions of all humans economic activities. It is known that CO2 emissions are directly related to fuel consumption, so that is why it is possible to find a series of studies that aims to reduce emissions by reducing vehicles fuel consumption. Route optimization is an important tool for reducing fuel consumption and hence emissions. This research aims to implement the PRP model in a leading company in the country, which is a model that minimizes fuel consumption/GHG emissions through adjustments of variables such as average speed, pay load, distance traveled and slopes of the road. Most existing fuel estimation methodologies found in the literature does not consider the slope of the roads in their calculations. So in this research it was necessary to develop a methodology to include it in the model. Tests were performed with variations in the time windows and the model was sensitive to each of the variables analyzed, generating savings on 100% of the studied routes.