Decomposition strategies for large scale multi depot vehicle routing problems

Das Umfeld in der heutigen Wirtschaft verlangt nach immer bessern Ansätzen, um Transportprobleme möglichst effizient zu lösen. Die Klasse der ”Vehicle Routing Problems” (VRP) beschäftigt sich speziell mit der Optimierung von Tourenplanungsproblemen in dem ein Service-Leister seine Kunden möglichst effizient beliefern muss. Eine der VRP-Varianten ist das ”Multi Depot Vehicle Routing Problem with Time Windows” (MDVRPTW), in dem Kunden von verschiedenen Depots in einem fix vorgegebenen Zeitintervall beliefert beliefert werden müssen. Das MDVRPTW ist im realen Leben dank seiner realitätsnahen Restriktionen sehr oft vertreten. Typische Transportprobleme, wie sie in der Wirklichkeit auftreten, sind jedoch oftmals so groß, dass sie von optimalen Lösungsansätzen nicht zufriedenstellend gelöst werden können. In der vorliegenden Dissertation werden zwei Lösungsansätze präsentiert, wie diese riesigen, realitätsnahen Probleme zufriedenstellend bewältigt werden können. Beide Ansätze benutzen die POPMUSIC Grundstruktur, um das Problem möglichst intelligent zu dekomponieren. Die Dekomponierten und damit kleineren Subprobleme können dann von speziell entwickelten Algorithmen effizienter bearbeitet und letztendlich gelöst werden. Mit dem ersten Ansatz präsentieren wir eine Möglichkeit Transportprobleme zu dekomponieren, wenn populationsbasierte Algorithmen als Problemlöser eingesetzt werden. Dazu wurde ein maßgeschneiderter Memetischer Algorithmus (MA) entwickelt und in das Dekompositionsgerüst eingebaut um ein reales Problem eines österreichischen Transportunternehmens zu lösen. Wir zeigen, dass die Dekomponierung und Optimierung der resultierenden Subprobleme, im Vergleich zu den Ergebnissen des MA ohne Dekomposition, eine Verbesserung der Zielfunktion von rund 20% ermöglicht. Der zweite Ansatz beschäftigt sich mit der Entwicklung einer Dekomponierungsmethode für Lösungsalgorithmen, die nur an einer einzigen Lösung arbeiten. Es wurde ein ”Variable Neigborhood Search” (VNS) als Optimierer in das POPMUSIC Grundgerüst implementiert, um an das vorhandene Echtwelt-Problem heranzugehen. Wir zeigen, dass dieser Ansatz rund 7% bessere Ergebnisse liefert als der pure VNS Lösungsansatz. Außerdem präsentieren wir Ergebnisse des VNS Dekompositionsansatzes die um rund 6% besser sind als die des MA Dekompositionsansatzes. Ein weiterer Beitrag dieser Arbeit ist das Vorstellen von zwei komplett verschiedenen Ansätzen um das Problem in kleinere Sub-Probleme zu zerteilen. Dazu wurden acht verschiedene Nähe-Maße definiert und betrachtet. Es wurde der 2,3 und 4 Depot Fall getestet und im Detail analysiert. Die Ergebnisse werden präsentiert und wir stellen einen eindeutigen Gewinner vor, der alle Testinstanzen am Besten lösen konnte. Wir weisen auch darauf hin, wie einfach die POPMUSIC Dekomponierung an reale Bedürfnisse, wie zum Beispiel eine möglichst schnelle Ergebnisgenerierung, angepasst werden kann. Wir zeigen damit, dass die vorgestellten Dekomponierungsstrategien sehr effizient und flexibel sind, wenn Transportprobleme, wie sie in der realen Welt vorkommen gelöst werden müssen.The optimization of transportation activities is of high importance for companies in today’s economy. The Vehicle Routing Problem (VRP) class is dealing with the routing of vehicles so that the customer base of a company can be served in the most efficient way. One of the many variants in the VRP class is the Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) which extends the VRP by additional depots from which customers can be served, as well as an individual time window for each customer in which he is allowed to be served. Modern carrier fleet operators often encounter these MDVRPTW in the real world, and usually they are of very large size so that exact approaches cannot solve them efficiently. This thesis presents two different approaches how this real world large scale MDVRPTWs can be solved. Both approaches are based on the POPMUSIC framework, which intelligently tries to decompose the large scale problem into much smaller sub-problems. The resulting sub-problems can then be solved more efficiently by specialized optimizers. The first approach in this thesis was developed for population based optimizers. A Memetic Algorithm (MA) was developed and used as an optimizer in the framework to solve a real world MDVPRTW from an Austrian carrier fleet operator. We show that decomposing the complete problem and solving the resulting sub-problems improves the solution quality by around 20% compared to using the MA without any decomposition. The second approach specially focuses on decomposition strategies for single solution methods. More precisely, a Variable Neighborhood Search (VNS) was implemented in the POPMUSIC framework to solve the real world instances. We show that decomposing the problem can yield improvements of around 7% compared to using the pure VNS method. Compared to the POPMUSIC MA approach the second approach can further improve the solution quality by around 6%. Another contribution in this thesis is the development of two generally different ways to measure proximity when creating sub-problems. In detail we tested eight different proximity measures and analyzed how good they decompose the problem in different environments. We tested the two, three and four depot case and present a clear winner that can outperform all other measures. Further we demonstrate that the POPMUSIC approach can flexibly be adjusted to real world demands, like a faster solution finding process, while at the same time maintaining high quality solutions. We show that a decomposition strategies combined with state of the art metaheuristic solvers are a very efficient and flexible tool to tackle real world problems with regards to solution quality as well as runtime

Constraint Programming-Based Heuristics for the Multi-Depot Vehicle Routing Problem with a Rolling Planning Horizon

Der Transportmarkt ist sowohl durch einem intensiven Kostenwettbewerb als auch durch hohe Erwartungen der Kunden an den Service geprägt. Die vorliegende Dissertation stellt zwei auf Constraint Programming basierende heuristische Frameworks vor, die eine Reoptimierung bereits geplanter Touren zu festgelegten Zeitpunkten erlauben und so eine Reaktion auf die gesteigerte Wettbewerbsdynamik und den Kostendruck ermöglichen.Actors on the transportation market currently face two contrary trends: Cost pressure caused by intense competition and a need for prompt service. We introduce two heuristic solution frameworks to enable freight carriers to deal with this situation by reoptimizing tours at predefined points in time. Both heuristics are based on Constraint Programming techniques

Approches générales de résolution pour les problèmes multi-attributs de tournées de véhicules et confection d'horaires

Thèse réalisée en cotutelle entre l'Université de Montréal et l'Université de Technologie de TroyesLe problème de tournées de véhicules (VRP) implique de planifier les itinéraires d'une flotte de véhicules afin de desservir un ensemble de clients à moindre coût. Ce problème d'optimisation combinatoire NP-difficile apparait dans de nombreux domaines d'application, notamment en logistique, télécommunications, robotique ou gestion de crise dans des contextes militaires et humanitaires. Ces applications amènent différents contraintes, objectifs et décisions supplémentaires ; des "attributs" qui viennent compléter les formulations classiques du problème. Les nombreux VRP Multi-Attributs (MAVRP) qui s'ensuivent sont le support d'une littérature considérable, mais qui manque de méthodes généralistes capables de traiter efficacement un éventail significatif de variantes. Par ailleurs, la résolution de problèmes "riches", combinant de nombreux attributs, pose d'importantes difficultés méthodologiques. Cette thèse contribue à relever ces défis par le biais d'analyses structurelles des problèmes, de développements de stratégies métaheuristiques, et de méthodes unifiées. Nous présentons tout d'abord une étude transversale des concepts à succès de 64 méta-heuristiques pour 15 MAVRP afin d'en cerner les "stratégies gagnantes". Puis, nous analysons les problèmes et algorithmes d'ajustement d'horaires en présence d'une séquence de tâches fixée, appelés problèmes de "timing". Ces méthodes, développées indépendamment dans différents domaines de recherche liés au transport, ordonnancement, allocation de ressource et même régression isotonique, sont unifiés dans une revue multidisciplinaire. Un algorithme génétique hybride efficace est ensuite proposé, combinant l'exploration large des méthodes évolutionnaires, les capacités d'amélioration agressive des métaheuristiques à voisinage, et une évaluation bi-critère des solutions considérant coût et contribution à la diversité de la population. Les meilleures solutions connues de la littérature sont retrouvées ou améliorées pour le VRP classique ainsi que des variantes avec multiples dépôts et périodes. La méthode est étendue aux VRP avec contraintes de fenêtres de temps, durée de route, et horaires de conducteurs. Ces applications mettent en jeu de nouvelles méthodes d'évaluation efficaces de contraintes temporelles relaxées, des phases de décomposition, et des recherches arborescentes pour l'insertion des pauses des conducteurs. Un algorithme de gestion implicite du placement des dépôts au cours de recherches locales, par programmation dynamique, est aussi proposé. Des études expérimentales approfondies démontrent la contribution notable des nouvelles stratégies au sein de plusieurs cadres méta-heuristiques. Afin de traiter la variété des attributs, un cadre de résolution heuristique modulaire est présenté ainsi qu'un algorithme génétique hybride unifié (UHGS). Les attributs sont gérés par des composants élémentaires adaptatifs. Des expérimentations sur 26 variantes du VRP et 39 groupes d'instances démontrent la performance remarquable de UHGS qui, avec une unique implémentation et paramétrage, égalise ou surpasse les nombreux algorithmes dédiés, issus de plus de 180 articles, révélant ainsi que la généralité ne s'obtient pas forcément aux dépends de l'efficacité pour cette classe de problèmes. Enfin, pour traiter les problèmes riches, UHGS est étendu au sein d'un cadre de résolution parallèle coopératif à base de décomposition, d'intégration de solutions partielles, et de recherche guidée. L'ensemble de ces travaux permet de jeter un nouveau regard sur les MAVRP et les problèmes de timing, leur résolution par des méthodes méta-heuristiques, ainsi que les méthodes généralistes pour l'optimisation combinatoire.The Vehicle Routing Problem (VRP) involves designing least cost delivery routes to service a geographically-dispersed set of customers while taking into account vehicle-capacity constraints. This NP-hard combinatorial optimization problem is linked with multiple applications in logistics, telecommunications, robotics, crisis management in military and humanitarian frameworks, among others. Practical routing applications are usually quite distinct from the academic cases, encompassing additional sets of specific constraints, objectives and decisions which breed further new problem variants. The resulting "Multi-Attribute" Vehicle Routing Problems (MAVRP) are the support of a vast literature which, however, lacks unified methods capable of addressing multiple MAVRP. In addition, some "rich" VRPs, i.e. those that involve several attributes, may be difficult to address because of the wide array of combined and possibly antagonistic decisions they require. This thesis contributes to address these challenges by means of problem structure analysis, new metaheuristics and unified method developments. The "winning strategies" of 64 state-of-the-art algorithms for 15 different MAVRP are scrutinized in a unifying review. Another analysis is targeted on "timing" problems and algorithms for adjusting the execution dates of a given sequence of tasks. Such methods, independently studied in different research domains related to routing, scheduling, resource allocation, and even isotonic regression are here surveyed in a multidisciplinary review. A Hybrid Genetic Search with Advanced Diversity Control (HGSADC) is then introduced, which combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and a bi-criteria evaluation of solutions based on cost and diversity measures. Results of remarkable quality are achieved on classic benchmark instances of the capacitated VRP, the multi-depot VRP, and the periodic VRP. Further extensions of the method to VRP variants with constraints on time windows, limited route duration, and truck drivers' statutory pauses are also proposed. New route and neighborhood evaluation procedures are introduced to manage penalized infeasible solutions w.r.t. to time-window and duration constraints. Tree-search procedures are used for drivers' rest scheduling, as well as advanced search limitation strategies, memories and decomposition phases. A dynamic programming-based neighborhood search is introduced to optimally select the depot, vehicle type, and first customer visited in the route during local searches. The notable contribution of these new methodological elements is assessed within two different metaheuristic frameworks. To further advance general-purpose MAVRP methods, we introduce a new component-based heuristic resolution framework and a Unified Hybrid Genetic Search (UHGS), which relies on modular self-adaptive components for addressing problem specifics. Computational experiments demonstrate the groundbreaking performance of UHGS. With a single implementation, unique parameter setting and termination criterion, this algorithm matches or outperforms all current problem-tailored methods from more than 180 articles, on 26 vehicle routing variants and 39 benchmark sets. To address rich problems, UHGS was included in a new parallel cooperative solution framework called "Integrative Cooperative Search (ICS)", based on problem decompositions, partial solutions integration, and global search guidance. This compendium of results provides a novel view on a wide range of MAVRP and timing problems, on efficient heuristic searches, and on general-purpose solution methods for combinatorial optimization problems

A unified matheuristic for solving multi-constrained traveling salesman problems with profits

International audienceIn this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search. Our approach combines several removal and insertion routing neighborhoods and efficient constraint checking procedures. The loading problem related to the use of a multi-compartment vehicle is addressed carefully. Two loading neighborhoods based on the solution of mathematical programs are proposed to intensify the search. They interact with the routing neighborhoods as it is commonly done in matheuristics. The performance of the proposed matheuristic is assessed on various instances proposed for the Orienteer-ing Problem and the Orienteering Problem with Time Window including up to 288 customers. The computational results show that the proposed matheuristic is very competitive compared with the state-of-the-art methods. To better evaluate its performance, we generate a new testbed including instances with various attributes. Extensive computational experiments on the new testbed confirm the efficiency of the matheuristic. A sensitivity analysis highlights which components of the matheuristic contribute most to the solution quality

DEVELOPING AN OPTIMAL MODEL FOR INFANT HOME VISITATION

The United States, Great Britain, Denmark, Canada and many other countries have accepted home visitation (HV) as a promising strategy for interventions for infants after births and for their mothers. Prior HV studies have focused on theoretical foundations, evaluations of programs, cost/benefit analysis and cost estimation by using hospital/payer/insurance data to prove its effectiveness and high cost. As governments and private organizations continue to fund HVs, it is an opportune time to develop and formulate operations research (OR) models of HV coverage, quality and cost so they might be used in program implementation as done for adult home healthcare (HHC) and home care (HC). This dissertation introduces a new modeling approach and proposes a solution methodology which helps to determine the schedules of follow-up nursing care providers (NCP) to visit discharged patients in order to minimize total follow-up cost at the planning and operational level, and to improve the quality of care. The model improves the quality of treatment of infants and mothers during pregnancy, after birth and discharge from the hospital by maximizing the quality of assignment of the right NCP with the right skill, nurse type and years of experience to the right patient with the specific health need. The modeling approach is based on a mixed-interger programming (MIP) formulation that represents the dynamics of the system comprising aspects such as visit schedules and total program’s cost while satisfying a variety of requirements modeled as constraints. The model is tested and validated with real life data. Computational results for the formulation for real life instances of the problem with the Nurse Family Partnership Program (NFP) obtained using IBM CPLEX optimization Studio version 12.6.1 are presented. The intent is to enhance the administrative and deployment process of HV programs, minimize risks, allow planners to explore the best scenarios under different conditions related to cost, treatment and coverage requirements, and highlight the best course of action when assigning NCPs to clients. Results show significant cost savings and enhanced quality treatment in several cases studied and tested. Finally, the study identifies and presents fertile avenues for future research for this field

Otimização de processos logísticos e planeamento de rotas mizusumashi

Mestrado em Engenharia e Gestão IndustrialEsta dissertação retrata o trabalho desenvolvido numa empresa portuguesa, com o intuito de otimizar um processo de separação e embalamento de material injetado e também melhorar as rotas diárias dos comboios logísticos (mizusumashi). O objetivo principal do projeto passa por reduzir o tempo de ambos os processos e consequentemente aumentar a produtividade fabril. Relativamente à separação e embalamento de peças, cada operador tem a seu cargo cerca de 13 máquinas, onde tem de organizar o seu posto de trabalho, para cada uma das diferentes máquinas, de maneira eficiente. Como não existia qualquer guia para este processo foi então elaborado um plano de standard work para resolver este problema. Deste modo todos os operadores realizam as tarefas de maneira idêntica e da forma mais eficiente. De acordo com as necessidades de produção, são definidas diariamente rotas para os diversos mizusumashis, que entregam e recolhem material em pontos pré-definidos das linhas. Para isso, as rotas têm de ser calculadas de acordo com as necessidades produtivas, os pontos de carga e descarga, os tempos de serviço em cada ponto, os tempos de deslocação entre os pontos e precedências na ordem de visita dos mesmos. Foi então desenvolvida uma abordagem que recorre a um modelo de programação linear, para cálculo das rotas diárias. Deste modo o operador é capaz de adaptar as diferentes rotas existentes às mais diversas necessidades diárias da fábrica. Para validação das abordagens desenvolvidas, foram testados vários cenários possíveis, recorrendo sempre a dados reais e concretos da empresa. Estes resultados obtidos são posteriormente comparados com os dados históricos da empresa, verificando-se uma melhoria significativa em termos de redução de tempos totais dos dois processos.This dissertation shows the work developed in a Portuguese company, and it’s focused on the optimization of the process for separate and packing parts and also improving the daily routes of the logistic trains (mizusumashi). The main goal of the project is to minimize the time of both processes and improve the productivity of the company. About the separation and the packing of the produced parts, each operator is responsible for 13 machines, where he has to organize the work place, for each one of the different machines, in an efficient way. The company didn’t have any kind of guide for this process, so a plan of standard work was elaborated to solve the problem. This way all the operators made the same tasks in the same way and efficiently. According to the production necessities, daily routes are defined for all the mizusumashi that deliver and take material in pre-defined points. For that, the routes have to be calculated according to: production necessities, the points of pick up and deliver, the time of service in each point, the time between two points and the precedence’s in the visiting order. It was developed an approach that uses a linear programming model, for calculating the daily routes. In this way the operator is capable of adapting the different routes to the daily necessities of the factory. For validating the developed approaches, various sceneries were tested, always using real data form the company. This results where compared with historic data from the company, and it was verified a significant improvement in the total time of both processes

Criação de uma ferramenta de optimização dos circuitos logísticos

Mestrado em Engenharia e Gestão IndustrialA crescente complexidade e incerteza do séc. XXI no que concerne à volatilidade e competitividade dos mercados mundiais, gerou desafios inerentes à gestão e optimização dos processos industriais. Neste contexto, as indústrias devem impor uma mudança de paradigmas e de métodos de gestão tradicionais. A aplicação dos conceitos Lean, principalmente no que diz respeito à melhoria contínua, redução de desperdícios e criação de valor permite o desenvolvimento sustentável das organizações. O desafio deste trabalho consiste na procura de processos mais eficazes e eficientes, nomeadamente na área da logística interna, recorrendo não só mas também aos princípios desta filosofia. O presente projecto, efectuado na Faurecia Assentos Automóveis, teve como objectivo principal, o desenvolvimento de uma ferramenta intuitiva para a optimização dos circuitos de abastecimento internos de forma a reduzir desperdício na actividade dos mesmos, quer em termos de capital humano, como em utilização de equipamento. A ferramenta desenvolvida permitiu optimizar os circuitos estudados e poderá de igual forma ser útil no planeamento de novos circuitos de abastecimento. De forma complementar elaboraram-se melhorias pontuais nos circuitos, assim como nas variáveis com eles relacionadas de forma a melhorar não só a sua actividade funcional, como também tornar o processo de abastecimento das linhas de montagem mais eficiente.The increasing complexity and uncertainty of the XXI century concerning to volatility and competitiveness in world markets has generated challenges inherent to the industrial methods management and optimization. Within this context, industries must impose a change of paradigms and methods of traditional management. The application of Lean concepts, mainly regarding continuous improvement, waste reduction and value generation allows a sustainable development of organizations. The challenge of this work consists in searching efficient and effective processes, particularly in the area of logistics using, not only but also, the principles of this philosophy. The current work, performed at Faurecia Automotive Seating had, as its main objective, the development of an intuitive tool for the optimization of internal supply chains to reduce waste in the same activity, both in terms of human capital, as in use of equipment. The tool developed allowed the optimization of the studied routes and can be equally useful in the planning of new supply routes. Complementarily occasional improvements in the routes are drawn up as well as the variables associated with them in order to improve their functional activity but also to make the process of supplying the assembly lines more efficient

ATHENA Research Book, Volume 2

ATHENA European University is an association of nine higher education institutions with the mission of promoting excellence in research and innovation by enabling international cooperation. The acronym ATHENA stands for Association of Advanced Technologies in Higher Education. Partner institutions are from France, Germany, Greece, Italy, Lithuania, Portugal and Slovenia: University of Orléans, University of Siegen, Hellenic Mediterranean University, Niccolò Cusano University, Vilnius Gediminas Technical University, Polytechnic Institute of Porto and University of Maribor. In 2022, two institutions joined the alliance: the Maria Curie-Skłodowska University from Poland and the University of Vigo from Spain. Also in 2022, an institution from Austria joined the alliance as an associate member: Carinthia University of Applied Sciences. This research book presents a selection of the research activities of ATHENA University's partners. It contains an overview of the research activities of individual members, a selection of the most important bibliographic works of members, peer-reviewed student theses, a descriptive list of ATHENA lectures and reports from individual working sections of the ATHENA project. The ATHENA Research Book provides a platform that encourages collaborative and interdisciplinary research projects by advanced and early career researchers