Literatura científica selecionada sobre o tema "Problème de Routage de Véhicules (VRP)"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Problème de Routage de Véhicules (VRP)".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Teses / dissertações sobre o assunto "Problème de Routage de Véhicules (VRP)"
Ait, Mamoun Khadija. "Vehicle rοuting prοblem under uncertainty : case οf pharmaceutical supply chain". Electronic Thesis or Diss., Normandie, 2024. http://www.theses.fr/2024NORMIR08.
Texto completo da fonteThe enhancement of logistics distribution performance and the optimization of transportation have emerged as critical concerns in recent years. The pharmaceutical distribution sector faces significant challenges in route planning and transport network optimization, with uncertainties often leading to delays and losses. The multifaceted challenges encompass the imperative to elevate product quality, reduce costs, minimize total travel distance, and streamline transportation time for effective planning. Within this context, the Vehicle Routing Problem (VRP) stands out as one of the extensively analysed problems in the realms of transportation, distribution, and logistics. Achieving a delicate equilibrium between cost considerations and delivering high-quality pharmaceutical products is a primary objective in pharmaceutical distribution. This research delves into both the Static Vehicle Routing Problem (SVRP) and the Dynamic Vehicle Routing Problem (DVRP). Real-world logistical planning frequently encounters uncertainties at the outset, including uncertain customer demand, delivery quantities, time constraints, and more. This thesis introduces the "temperature condition" as a fundamental constraint in pharmaceutical distribution, representing a source of uncertainty that directly impacts drug quality, thereby influencing logistics distribution and overall supply chain performance. Furthermore, the thesis incorporates uncertainty quantification for modelling uncertain travel times in both recurrent and non-recurrent congestion scenarios. The methodology employed for this purpose is the collocation method, initially validated through Monte Carlo Simulation (MCS). By addressing these multifaceted challenges and uncertainties, this research seeks to contribute to the development of robust strategies in pharmaceutical distribution, ensuring the optimization of routes, reduction of costs, and maintenance of high-quality product standards. The findings of this study offer valuable insights for logistics managers and planners aiming to navigate the complexities of pharmaceutical distribution, fostering efficiency and resilience in the face of uncertainties
Augerat, Philippe. "Approche polyédrale du problème de tournées de véhicules". Grenoble INPG, 1995. http://tel.archives-ouvertes.fr/tel-00005026.
Texto completo da fonteHaj, Rachid Mais. "Les problèmes de tournées de véhicules en planification industrielle : classification et comparaison d’opérateurs évolutionnaires". Besançon, 2010. http://www.theses.fr/2010BESA2033.
Texto completo da fonteSolving vehicle routing problems have been some of the most studied problems in combinatorial optimization because they have many applications in the field of industrial planning. The related literature is diversified both in terms of variants of the problems and in terms of solving approaches. Identifying which class of problems a given real-world problem belongs to, in order to gather related works and determine the most relevant resolution method, is a difficult task. The present thesis constitutes a feasibility study of a project to make these tasks easier, privileging evolutionary solving approaches. This project relies on three essential bases: a notation of the variants of VRP, a compilation of evolutionary operators from the literature, a set of rules linking VRP variants to evolutionary operators according to the efficiency. The objective is to find guidelines to design a solving algorithm according to the characteristics of the problem by identifying the subset of operators showing the greater estimated efficiency. Putting the proposed notation into practice using several papers demonstrated that anyone using this notation can classify accurately papers and can recognize easily approaches and results that are similar to their own. The experimental methodology proposed is illustrated by considering three types of crossover and three types of mutation. This study confirms that is possible to determine which elements of an algorithm have a discernable impact on the performance. It reveals relationships between choices in the design of the algorithm or between the variant of problem and the efficiency of the operators
Zhao, Xin. "Une méthode génétique pour la résolution du problème dynamique de routage de véhicules avec temps de parcours variables". Artois, 2008. http://www.theses.fr/2008ARTO0204.
Texto completo da fonteWe treat the dynamic vehicle routing problem with time windows (DVRPTW) and the partially dynamic travelling repairman problem (PDTRP) where the inclusion of new customers during the routing execution is possible. In a first approach, we consider speed profiles based on average travel time depending on the time period (morning, noon, afternoon) to reflect the evolution of road traffic. Depending on the connection type between two customers, several profiles can be considered (feeder road, arterial road and freeway). In a second approach, we integrate traffic information obtained in real time to change the speed profile according to the accidents of the road network (congestion, etc. ). The analysis of the results of these experiments shows that our method with real-time traffic information provides a good performance, a better robustness against a simple model with time dependent travel time
Hernandez, Florent. "Méthodes de résolution exactes pour le problème de routage de véhicules avec fenêtres de temps et routes multiples". Thesis, Montpellier 2, 2010. http://www.theses.fr/2010MON20215.
Texto completo da fonteThe multi-trip vehicle routing problem with time windows (MTVRPTW) is a generalization of the vehicle routing problem with time windows (VRPTW). In the MTVRPTW, one vehicle can perform several trips during a planning period. This allows optimizing the transport when the number of vehicles is limited and small.We propose here the first exact method for solving this problem.Our model is designed as a coverage problem for customers where the variables are trips. Mutual exclusion constraints express the availability of vehicles. We use a column generation scheme in which the sub-problem is an elementary shortest path problem with resource constraints (ESPPRC). Our dynamic programming method for ESPPRC takes into account dependencies of several resources through the concept of representative label. It is thus more efficient than a conventional approach. The column generation method is included in a Branch and Price scheme with two types of branching. One is based on arc selection, and the other on solving a VRPTW. We have implemented various accelerating methods which are specific to MTVRPTW. We give the results of our algorithm on Solomon instances.Results from exact methods were available in the literature for the MTVRPTW with time limit on the trips. We proposed a new and more efficient algorithm, based on our methods, to solve this variant of the problem
Roynette, Eliott. "Optimisation de la conception du design du harnais de commande des véhicules spatiaux". Thesis, Toulouse, ISAE, 2018. http://www.theses.fr/2018ESAE0011/document.
Texto completo da fonteSixty 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
Turki, Mezghani Emna. "Problème de localisation-routage multi-dépôts, multi-véhicules à deux niveaux avec gestion de stock : application réelle de la société GIPA". Electronic Thesis or Diss., Paris 8, 2021. http://www.theses.fr/2021PA080088.
Texto completo da fonteThis thesis presents a new problems inspired by a real case, we introduce two-echelon multi-depot, multi-vehicles Inventory-Location-Routing problem (2E-MDILRP) for a specific type of perishable product, proved to be NP-hard. In addition, we studied the taxonomy of the sub problems of 2E-MDILRP, and we propose the different constraints of perishable products. This taxonomy would, on the one hand, provide better understanding of the 2E-MDILRP of the perishable products, and on the second hand identify promising further research topics. So, a mathematical model has been proposed and validated using the OPL\Cplex solver for this new variant. Also, we proposed a specific heuristic developed with iterated local search algorithm (ILS) using to solve the new 2E-MDILRP problem. This is tested within a theoretical framework, the under a real empirical framework. The latter consists in optimizing the perishable product distribution and inventory. These developed methods have been tested on sets of instances of up to 4 main depots, 20 potential satellites and 200 customers, with two fleets of heterogeneous vehicles available at a rate of one fleet for each level. The results of our exact and approximate method show the efficiency of the approach
Bahri, Oumayma. "A fuzzy framework for multi-objective optimization under uncertainty". Thesis, Lille 1, 2017. http://www.theses.fr/2017LIL10030/document.
Texto completo da fonteThis thesis is devoted to the study of multi-objective combinatorial optimization under uncertainty. In particular, we address multi-objective problems with fuzzy data, in which fuzziness is expressed by fuzzy triangular numbers. To handle such problems, our main idea is to extend the classical multi-objective concepts to fuzzy context. To handle such problems, we proposed a new Pareto approach between fuzzy-valued objectives (i.e. vectors of triangular fuzzy numbers). Then, an extension of Pareto-based metaheuristics is suggested as resolution methods. The proposed approach is thereafter illustrated on a bi-objective vehicle routing problem with fuzzy demands. At the second stage, we address robustness aspect in the multi-objective fuzzy context by proposing a new methodology of robustness evaluation of solutions. Finally, the experimental results on fuzzy benchmarks of vehicle routing problem prove the effectiveness and reliability of our approach
Berrajaa, Achraf. "Parallélisation d'heuristiques d'optimisation sur les GPUs". Thesis, Normandie, 2018. http://www.theses.fr/2018NORMLH31/document.
Texto completo da fonteThis 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
Landrieu, Antoine. "Logistique inverse et collecte des produits techniques en fin de vie : tournées de véhicules avec contraintes". Phd thesis, Grenoble INPG, 2001. http://tel.archives-ouvertes.fr/tel-00198400.
Texto completo da fonte