Dissertations / Theses on the topic 'Vehicle routing problem with drone delivery'
To see the other types of publications on this topic, follow the link: Vehicle routing problem with drone delivery.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Vehicle routing problem with drone delivery.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Slaviša, Dumnić. "Модел оптимизације доставе пошиљака у системима са хетерогеним доставним возилима." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2019. https://www.cris.uns.ac.rs/record.jsf?recordId=110781&source=NDLTD&language=en.
Full textAbstract:
Машинско учење и неуронске мреже су алати који налазе све већупримену у решавању практичних проблема. За креирање неуронскемреже потребан је скуп података, који може бити прикупљен наразличите начине. У овој тези је показано да се подаци за тренингнеуронске мреже могу успешно прикупити креирањем веб игре.Сакупљени скуп података садржи стратегије решавања проблематрговачког путника и проблема рутирања возила.Mašinsko učenje i neuronske mreže su alati koji nalaze sve većuprimenu u rešavanju praktičnih problema. Za kreiranje neuronskemreže potreban je skup podataka, koji može biti prikupljen narazličite načine. U ovoj tezi je pokazano da se podaci za treningneuronske mreže mogu uspešno prikupiti kreiranjem veb igre.Sakupljeni skup podataka sadrži strategije rešavanja problematrgovačkog putnika i problema rutiranja vozila.
Machine learning and neural networks are the tools that are finding more andmore fields of application in solving practical problems. For the creation ofthe neural networks, data can be successfully collected by creating a webgame. The data collected in this manner has strategic solutions for theproblems of Travel salesperson problem and vehicle routing problem.
2
Liu, Kai. "A study on the Split Delivery Vehicle Routing Problem." Diss., Mississippi State : Mississippi State University, 2005. http://sun.library.msstate.edu/ETD-db/ETD-browse/browse.
Full text
3
Min, Hokey. "The vehicle routing problem with product/spatial consolidation and backhauling." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1314819600.
Full text
4
Aleman, Rafael E. "A Guided Neighborhood Search Applied to the Split Delivery Vehicle Routing Problem." Wright State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=wright1237575805.
Full text
5
Cetiner, Selim. "An Iterative Hub Location And Routing Problem For Postal Delivery Systems." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/4/759399/index.pdf.
Full textAbstract:
In this study, we consider the Turkish postal delivery system and develop
an effective solution approach for the combined hub location and routing problem
where the location of hub nodes are determined, the nonhub regional postal
offices are allocated to the hubs, and the optimal set of routes are determined for
each hub. Since the realized post-routing distances between origin-destination
pairs are different from those used in the hub-location model, we develop an
algorithm that finds the route-compatible hub configuration and allocation paths.
The algorithm is the one that iterates between the hub-location phase and a routing
phase. Our strategy consists of updating the distances used in the first phase in
order to produce a solution that contains the cognition of routes. Some special
structures in the routed network are also identified and used for improving the
solution. Computational experience is reported.
6
Mohamed, Nurum Huda binti. "Hybridisation of heuristics and exact methods for the split delivery vehicle routing problem." Thesis, University of Kent, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.591103.
Full textAbstract:
Due to the worldwide of petrol prices crises that have been rising inevitably over the past years, any reduction in the transportation cost will benefit most companies. The purpose of this research is to contribute in solving this problem by alleviating some afthis burden. This thesis is about the Split Delivery Vehicle Routing Problem (SDVRP) and some of its variants. The SDVRP is a relaxed version of the classical VRP where customers can be visited more than once. It is also applicab le to problems with customers' demands larger than the vehicle capacity. These types of split routing problems can be found app licable in many real-world logistical problems. The total cost and the number of vehicles required could be reduced by allowing split deliveries. The savings are found to be the most in those problems with customers' demands nearly as large as the vehicle capacity limit. Some constructive heuristics adapted from the savings, the sweep and the insertion methods are first put forward to solve the SDVRP. These sets of solutions are then used in several set covering-based models which are proposed to so lve the problem. Both the heuristics and the set covering-based approaches are tested on two large sets of published data set from the literature with encouraging results. Similarly on the second data set, 12 best solutions are found from the 42 instances with an average deviation of 1.37%. As split deliveries may increase customers' administration cost and inconvenience, some models to cater for this drawback are proposed and their implementations are tested and evaluated against the classical SDVRP for guidance. This thesis is organised as follows: In the first chapter, a brief overview of logistics and distribution management, in particular with respect to vehicle routing, is provided. A brief explanation about the TSP, the VRP and its variants is also presented. Methodologies for solving these kinds of problems are also given. This is then followed by an example to illustrate the benefit of sp lit deliveries in Chapter 2 together with the SDVRP mathematical formulations and a review of the methods used to tackle the SDVRP and its variants. A brief introduction to the two benchmark SDVRP data sets used is given at the end of this chapter. Several constructive heuristics are first implemented in the third chapter. These are adapted from the Savings, the Sweep and the Insertion methods to include split deliveries. These methods are coded in C++ Language and tested on the two SDVRP data sets taken from the literature and their performance is evaluated against the best published resu lts showing encouraging results. In Chapter 4, an existing mathematical programming approach based on the set covering is implemented using ILOO CPLEX Callable Library. This approach uses several sets of routes from the obtained solutions by the constructive heuristics in Chapter 3. New mathematical ILP based models are adapted and a pi lot test is conducted within a limited time to select the most appropriate model and corresponding CPLEX parameters. New best results are discovered by the selected model on the two large data sets. In Chapter 5, the dual information relating to both customers and routes, is obtained by relaxing the selected set covering-based problem as a Linear Programming. The customers' dual information is incorporated in both the classical insertion cost formula and the well-known savings formulae and is proved to be beneficial. Route reduction schemes are then designed to inc lude those promising routes only. At the end of this chapter, a new set of routes is then constructed by combining the new generated routes and those subsets of routes found previously. This set is then used in the selected model where some new best results are obtained. A new variant of the SDVRP is introduced in Chapter 6 where an incentive scheme is incorporated to overcome the inconvenience of those affected customers that have split deliveries. Two new models are then explored and adapted from the previous set covering-based models. Given that no published results exist for these variants, as a guide, those results originated from the classical SDVRP are used for comparison purpose. Our find ings and suggestions for potential future research are highlighted in the final chapter.
7
Nowak, Maciek A. "The Pickup and Delivery Problem with Split Loads." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.
Full textAbstract:
This dissertation focuses on improvements in vehicle routing that can be gained by allowing multiple vehicles to service a common load. We explore how costs can be reduced through the elimination of the constraint that a load must be serviced by only one vehicle. Specifically, we look at the problem of routing vehicles to service loads that have distinct origins and destinations, with no constraint on the amount of a load that a vehicle may service. We call this the Pickup and Delivery Problem with Split Loads (PDPSL). We model this problem as a dynamic program and introduce structural results that can help practitioners implement the use of split loads, including the definition of an upper bound on the benefit of split loads. This bound indicates that the routing cost can be reduced by at most one half when split loads are allowed. Furthermore, the most benefit occurs when load sizes are just above one half of vehicle capacity.
We develop a heuristic for the solution of large scale problems, and apply this heuristic to randomly generated data sets. Various load sizes are tested, with the experimental results supporting the finding that most benefit with split loads occurs for load sizes just above one half vehicle capacity. Also, the average benefit of split loads is found to range from 6 to 7% for most data sets. The heuristic was also tested on a real world example from the trucking industry. These tests reveal the benefit of both using split loads and allowing fleet sharing. The benefit for split loads is not as significant as with the random data, and the various business rules added for this case are tested to find those that have the most impact. It is found that an additional cost for every stop the vehicle makes strictly limits the potential for benefit from split loads. Finally, we present a simplified version of the PDPSL in which all origins are visited prior to any destination on a route, generalizing structural results from the Split Delivery Vehicle Routing Problem for this problem.
8
Rahmani, Younes. "The Multi-product Location-Routing Problem with Pickup and Delivery." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331/document.
Full textAbstract:
Dans les problèmes de localisation-routage classiques (LRP), il s'agit de combiner des décisions stratégiques liées aux choix des sites à ouvrir (centres de traitement) avec des décisions tactiques et opérationnelles liées à l'affectation des clients aux sites sélectionnés et a la confection des tournées associées. Cette thèse propose de nouveaux modèles de localisation-routage permettant de résoudre des problématiques issues de réseaux logistiques, devenus aujourd'hui de plus en plus complexes vu la nécessité de mutualisation de ressources pour intégrer des contraintes de développement durable et des prix de carburants qui semblent augmenter de manière irrémédiable. Plus précisément, trois aspects ont été intégrés pour généraliser les modèles LRP classiques de la littérature : 1) l'aspect pickup and delivery, 2) l'aspect multi-produits, et 3) la possibilité de visiter un ou plusieurs centres de traitement dans une tournée donnée. Nous avons étudié deux schémas logistiques, qui ont donné lieu à deux nouveaux modèles de localisation et de routage, le MPLRP-PD (LRP with multi-product and pickup and delivery), qui peut être vu comme une extension des problèmes de tournées de véhicules avec collecte et livraison, intégrant une décision tactique liée à la localisation des centres de traitement (noeud avec collecte et livraison) dans un réseau de distribution à un seul échelon, et le 2E-MPLRP-PD (Two-echelon LRP with multi-product and pickup and delivery) qui est une généralisation du LRP à deux échelons avec les contraintes citées plus-haut. Ces deux modèles ont été formalisés par des programmes linéaires en variables mixtes (MIP). Des techniques de résolution, basées sur des méthodes de type heuristique, clustering, métaheuristique, ont été proposées pour résoudre le MPLRP-PD et le 2E-MPLRP-PD. Les jeux d'essais de la littérature ont été généralisés pour tester et valider les algorithmes proposésIn the framework of Location-Routing Problem (LRP), the main idea is to combine strategic decisions related to the choice of processing centers with tactical and operational decisions related to the allocation of customers to selected processing centers and computing the associated routes. This thesis proposes a new location-routing model to solve problems which are coming from logistics networks, that became nowadays increasingly complex due to the need of resources sharing, in order to integrate the constraints of sustainable development and fuels price, which is increasing irreversibly. More precisely, three aspects have been integrated to generalize the classical LRP models already existed in the literature: 1) pickup and delivery aspect, 2) multi-product aspect, and 3) the possibility to use the processing centers as intermediate facilities in routes. We studied two logistics schemes gives us two new location-routing models: (i) MPLRP-PD (Multi-product LRP with pickup and delivery), which can be viewed as an extension of the vehicle routing problem with pick-up and delivery, including a tactical decision related to the location of processing centers (node with pick-up and delivery), and (ii) 2E-MPLRP-PD (Two-echelon multi-product LRP with pickup and delivery), which is a generalization of the two-echelon LRP. Both models were formalized by mixed integer linear programming (MIP). Solving techniques, based on heuristic methods, clustering approach and meta-heuristic techniques have been proposed to solve the MPLRP-PD and the 2E-MPLRP-PD. The benchmarks from the literature were generalized to test and to validate the proposed algorithms
9
Rahimi, Mohammad. "Inventory routing problem under dynamic, uncertain and green considerations." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI049/document.
Full textAbstract:
La gestion des stocks et la maîtrise de la distribution sont les deux activités importantes dans le management de la chaîne logistique. L’optimisation simultanée de ces deux activités est connue sous l’intitulé du problème de gestion de stock et de tournée de livraison (Inventory Routing Problem, IRP). L’IRP traditionnelle est confronté aux différents problèmes, causé principalement par le manque d'informations complètes et/ou temps réel, tels que les changements de la demande, l’embouteillage soudain causé par un accident, etc. Le partage et la mise à jour d'information logistique peut améliorer l'efficacité d’IRP. De plus, en raison de la spécificité de l'IRP dans la logistique urbaine, il est important de considérer d'autres critères comme les critères sociaux, environnementaux et le niveau de service qui pourraient être en conflictuel. L’objectif principal de cette thèse est de développer des modèles et des méthodes des IRP avec la prise en compte des incertitudes, du niveau de service et de l’impact environnemental, social en finalement les informations du temps réel (IRP dynamique). Dans cette thèse, trois modèles mathématiques sont proposés. Le premier modèle multi-objectif est pour identifier un compromis entre le niveau de service, les critères environnementaux et économiques. Pour gérer des paramètres incertains, on applique une approche floue. Dans le deuxième modèle, nous avons étudié l'impact des critères sociaux sur les IRPs en proposant un modèle mathématique bi-objectif. Une approche stochastique basée sur des scénarios est développée pour faire face à l'incertitude dans le modèle. Enfin, le troisième model concerne l'impact de l'utilisation d'informations du temps réel dans les IRP. Il est à noter que, selon la durée de vie du produit tant sur le plan financier que sur le plan écologique, les produits périssables sont considérés dans les trois modèles proposés. Les résultats montrent une gestion dynamique est beaucoup plus efficace que la statiqueThe inventory management and transportation are two main activities of supply chain management. The joint optimization of these two activities is known as Inventory Routing Problem (IRP). The main objective of IRP is to determine the set of retailers to be delivered to in each period, the delivery sequence for each vehicle, and the quantities of goods delivered to each retailer for each period of a planning horizon. The traditional IRPs are faced different problems, caused mainly by lack of complete and/or timely information such as shifts in demand, traffic caused by a sudden vehicles accident, etc. sharing of updated and reliable logistics information can meaningful improve the efficiency of IRP. Moreover, because of the specificity of IRP in urban logistic, it is important to tack into account other criteria as social, environmental criteria and service level that could be in conflict. The main objective of this thesis is to (i) choose appropriate social, environmental and service level criteria, (ii) integrate them in mathematical models, and (iii) study the impact of these criteria on dynamic optimization of IRPs for perishable products under uncertain parameters. For this purpose, three mathematical models are proposed. The first model is multi-objective mathematical model in order to make a trade-off between service level, environmental criteria and economic. To decrease quantity of expired products, a nonlinear step function as holding cost function is integrated in the model. Moreover, to solve the problem a fuzzy possibilistic approach is applied to handle uncertain parameters. In the second model, a bi-objective mathematical model is proposed to study impact of social issues on the IRPs. In the proposed model, first objective function concerns economic criteria while the second one social issues. A scenario-based stochastic approach is developed to cope with uncertainty in the model. Finally, the third model concerns impact of using real-time information in efficiency of IRPs. It is noteworthy that, according significant role of perishable products in the both financially and ecology sides of IRPs, perishable products are considered in all three proposed model while even proposed models are appropriate to nonperishable ones as well. The results show that a dynamic management is more efficient than the static one
10
Kaja, Sai Chandana. "A New Approach for Solving the Disruption in Vehicle Routing Problem During the Delivery : A Comparative Analysis of VRP Meta-Heuristics." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-19576.
Full textAbstract:
Context. The purpose of this research paper is to describe a new approach for solving the disruption in the vehicle routing problem (DVRP) which deals with the disturbance that will occur unexpectedly within the distribution area when executing the original VRP plan. The paper then focuses further on the foremost common and usual problem in real-time scenarios i.e., vehicle-breakdown part. Therefore, the research needs to be accomplished to deal with these major disruption in routing problems in transportation. Objectives. The study first investigates to find suitable and efficient metaheuristic techniques for solving real-time vehicle routing problems than an experiment is performed with the chosen algorithms which might produce near-optimal solutions. Evaluate the performance of those selected algorithms and compare the results among each other. Methods. To answer research questions, firstly, a literature review has been performed to search out suitable meta-heuristic techniques for solving vehicle routing problems. Then based on the findings an experiment is performed to evaluate the performance of selected meta-heuristic algorithms. Results. Results from the literature review showed that the meta-heuristic approaches such as. Tabu Search, Ant Colony Optimization, and Genetic Algorithmare suitable and efficient algorithms for solving real-time vehicle routing problems. The performance of those algorithms has been calculated and compared with one another with standard benchmarks. Conclusions. The performance of a Tabu Search algorithm is best among the other algorithms, followed by Ant Colony Optimization and Genetic Algorithm. Therefore, it has been concluded that the Tabu Search is the best algorithm for solving real-time disruption problems in VRP. The results are similar to the performance comparison of the selected algorithms and standard benchmarks are presented within the research.
11
De, Boer Jeroen Wouter. "Approximate Models And Solution Approaches For The Vehicle Routing Problem With Multiple Use Of Vehicles And Time Windows." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609620/index.pdf.
Full textAbstract:
In this study we discuss the Vehicle Routing Problem with multiple use of vehicles (VRPM). In this variant of the routing problem the vehicles may replenish at any time at the depot.
We present a detailed review of existing literature and propose two mathematical models to solve the VRPM. For these two models and their several variants we provide computational
results based on the test problems taken from the literature. We also discuss a case study in which we are simultaneously dealing with side constraints such as time windows, working hour limits, backhaul customers and a heterogeneous vehicle fleet.
12
Plášková, Pavlína. "Strategické rozhodnutí společnosti Baťa, a.s." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-3836.
Full textAbstract:
In this thesis we report several of delivery problems. Here it is mostly describe Vehicle Routing Problem and Split Delivery Problem as suitable methods for the case study of the company Baťa a.s.In this thesis we used one of the most sofisticated software Roadnet Transportation Suite as effective program for distribution and planning routes.Finally we construct analysis as a support to find the optimal solution for the final strategical decision of the company Baťa a.s.
13
Kretschmann, Endel. "Uma abordagem ao Vehicle Routing Problem with pickup and delivery with time windows em navios : um caso de uma indústria química." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2018. http://hdl.handle.net/10183/184352.
Full textAbstract:
Os objetivos desta dissertação são comprovar empiricamente os benefícios da modelagem matemática como uma ferramenta de apoio ao processo decisório e apresentar uma forma de minimizar o custo do transporte marítimo de matérias-primas a granel, atendendo aos prazos e às demandas de quantidade de uma indústria química do ramo de fertilizantes em sua operação no Brasil. Isso será possível mediante o desenvolvimento de um modelo de programação linear inteira mista com as características do Vehicle Routing Problem with Pickup and Delivery with Time Windows (VRPPDTW) para representar as características do problema. O VRPPDTW é uma subclasse do clássico Vehicle Routing Problem que encontra grande aderência aos desafios industriais, ao poder encontrar soluções para o transporte de bens e pessoas. Para essa aplicação, diversas restrições de roteamento de navios heterogêneos, de agendamento das coletas e descargas das matérias-primas, de oferta e demanda por diferentes tipos de insumos e de capacidade de cargas de portos e navios foram elaboradas e implementadas para caracterizar situações às quais o processo de planejamento de entregas está atualmente submetido. Diferentes instâncias com dados cedidos pela companhia foram processadas e resolvidas em tempos aceitáveis, a partir da utilização do solver IBM ILOG CPLEX© 12.1.0. Resultados econômicos mais eficazes dos que aqueles atualmente percebidos pela empresa foram encontrados.This thesis purposes are to prove empirically the mathematical modeling benefits as a support tool to the decision-making process and to present a way to minimize bulk raw materials maritime transport costs, attending to deadlines and quantity demand of a chemical fertilizer industry in its operations in Brazil. This will be possible through the development of a mixed linear and integer programming model with the characteristics of the Vehicle Routing Problem with Pickup and Delivery with Time Windows (VRPPDTW) to represent the problem characteristics. The VRPPDTW is a subclass of the classic Vehicle Routing Problem that finds great adhesion to industrial challenges, to be able to find solutions for the transport of goods and people. For this application, several constraints for heterogeneous ship routing, scheduling for raw material charges and discharges, supply and demand for different types of products and ports’ and ships’ cargo capacity were elaborated and implemented to characterize situations to which the delivery planning process is currently submitted. Different instances with data provided by the company were processed and solved in acceptable times, using the IBM ILOG CPLEX © 12.1.0 solver. Economic results more effective than those currently perceived by the company were found.
14
Uyar, Emrah. "Routing in stochastic environments." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26554.
Full textAbstract:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.Committee Co-Chair: Erera, Alan L.; Committee Co-Chair: Savelsbergh, Martin W. P.; Committee Member: Ergun, Ozlem; Committee Member: Ferguson, Mark; Committee Member: Kleywegt, Anton J.. Part of the SMARTech Electronic Thesis and Dissertation Collection.
15
Gabonay, Michal. "Metody optimalizace plánování nákladní přepravy." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417240.
Full textAbstract:
The following work concerns the study of the evolutionary algorithm, which optimizes freight transport planning. The demand for freight transport is constantly increasing nowadays and with creating, implementing and using proper route planning we are able to significantly reduce transportation costs. However, it is preferably to implement it in companies with large numbers of served customers and with a sufficiently large fleet of vehicles. The study starts by defining what fright transport planning problem is and by characterizing its existing specifications and variants. My work proceeds to give a background of the possible solutions to the multifaceted aspects of the problem. The specific subproblem I choose to focus on is the Vehicle routing problem with Pickup and Delivery for which I apply the optimization solution. In the main body of my thesis, I will elaborate on the chosen optimization solution which encompasses the genetic algorithm and evolutionary strategy. The aim of the study is to measure the suitability of the algorithms and techniques used, for which reason the final part of my work will deal with the analysis and evaluation of the experiments.
16
Juříčková, Ivana. "Optimalizace tras při rozvozu europalet." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-194529.
Full textAbstract:
This diploma thesis describes a logistic problem of the company JACER-CZ Ltd. The main focus is on identifying optimal routes about the Euro pallets distribution. The Euro pallets are standardized at length replaceable transport pallets which are in Europe. The aim of this thesis is to find a solution which will meet requirements of all thirteen customers and simultaneously a total route length of all vans will be minimalized. At first there is the mathematical model about the delivery assignment with the split delivery vehicle calculated by solvers CPLEX and Gurobi. Then the original and the modified example is solved manually by heuristic algorithms. It is concerned the nearest neighbour algorithm, savings algorithm, the insertion algorithm and the heuristic method for the split delivery vehicle routing problem.
17
Williams, Matthew J. "A Heuristic Solution to the Pickup and Delivery Problem with Applications to the Outsized Cargo Market." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1238514369.
Full text
18
Šimáně, Čestmír. "Optimalizace rozvozu léčiv ze skladu společnosti Movianto s.r.o." Master's thesis, Vysoká škola ekonomická v Praze, 2012. http://www.nusl.cz/ntk/nusl-197096.
Full textAbstract:
Nowadays, when great emphasis is put on cost savings, transport optimization is necessary part of every company life in which transportation costs produce significant part. There are optimization methods and possibilities presented in this thesis. In the first chapter there are explained methods such as the travelling salesman problem, the vehicle routing problem, the multiple vehicle routing problem and the split delivery vehicle routing problem and then the reader gets to know the heuristics methods in the chapter two where description of the nearest neighbour method, Clarke-Wright method and split delivery heuristic is mentioned. In the last but one chapter author applies previous methods on concrete distribution arranged by Movianto Česká republika s.r.o. on 5th September, 2013. Based on gained outputs, analysis and comparison of results (including the original distribution) are provided in the fourth chapter. Obtained results of analysis lead to recommendation on how the company should plan its future distribution.
19
Filho, CÃsar Augusto Chaves e. Sousa. "Genetic algorithm for vehicle routing problem with heterogeneous fleet and separate collection and delivery: a case in the Secretariat of Labor and Social Development of the State of CearÃ." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=13744.
Full textAbstract:
A concern of logistics management is the correct and efficient use of the available fleet. The central focus of fleet management is determining the routes that will be used in customer service and the efficient allocation of available resources (vehicles). The correct fleet management can generate a competitive advantage. There is a problem in the Operations Research dedicated to working this type of situation, the Vehicle Routing Problem (VRP). The VRP tries to generate the most economical route to efficient use of the available fleet. The case study discussed in this work was a particular situation VRP where there is a heterogeneous fleet and where the collections and deliveries of passengers are carried at separate times. To solve this problem we designed a Genetic Algorithm. Additionally, three different crossover operators were tested in the search for better results. At the end of the study, the Genetic Algorithm was capable of solving the problem in a short time and finding the most economical way to generate routes, using efficiently the fleet and fulfilling all requests.Uma das preocupaÃÃes da gestÃo logÃstica à a correta e eficiente utilizaÃÃo da frota disponÃvel. O foco central da gestÃo da frota està em determinar as rotas que serÃo utilizadas no atendimento aos clientes e a alocaÃÃo eficiente dos recursos (veÃculos) disponÃveis. A gestÃo correta da frota pode gerar um diferencial competitivo. Existe na Pesquisa Operacional um problema dedicado a trabalhar este tipo de situaÃÃo, denominado Problema de Roteamento de VeÃculos (PRV). O PRV procura gerar a rota mais econÃmica com utilizaÃÃo eficiente da frota disponÃvel. No estudo de caso, realizado neste trabalho, foi abordada uma situaÃÃo particular do PRV onde hà uma frota heterogÃnea e as coletas e entregas de passageiros sÃo realizadas em momentos separados. Para a resoluÃÃo deste problema foi desenvolvido e implementado um Algoritmo GenÃtico (AG). Adicionalmente, trÃs operadores de cruzamento diferentes foram testados na busca dos melhores resultados encontrados pelo AG. Ao final, o Algoritmo GenÃtico conseguiu se mostrar capaz de resolver o problema em tempo hÃbil e de maneira a gerar rotas mais econÃmicas, utilizando eficientemente a frota e atendendo todas as solicitaÃÃes.
20
Marcinko, Tomáš. "Rozvozný problém s delenou dodávkou." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-10514.
Full textAbstract:
This thesis focuses on a description of the split delivery vehicle routing problem (SDVRP), in which the restriction that each customer has to be visited exactly once is not assumed, contrary to the classical vehicle routing problem, and split deliveries are allowed. Considering the fact that the split delivery vehicle routing problem in NP-hard, a number of heuristic algorithms proposed in the literature are presented. Computational experiments are reported and the results show that the largest benefits of split deliveries are obtained in case of instances with fairly specific characteristics and also several drawbacks of implemented Tabu Search algorithm (SPLITABU) are point out.
21
Richter, Miroslav. "Rozvozní problém s dělenou dodávkou." Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-76827.
Full textAbstract:
Split delivery vehicle rating problem is one of the most studied combinatorial optimization problems in operations research. According to the mathematical difficultness, there should be many problems to find the optimal solution. Therefore, there are many exact algorithms and heuristics, which tries to find the best solution in the short period of time. The theoretical part of this thesis describes the basic facts of the split delivery vehicle routing problem and its heuristics. The practical part focuses on the practical usage of the split delivery vehicle routing problem. The main goals of this thesis are the practical usage of this vehicle routing problem and assistance in strategic decision establishing of the secondary store.
22
Lian, Lian. "A hierarchical and structured methodology to solve a general delivery problem : resolution of the basic sub-problems in the operational phase." Phd thesis, Ecole Centrale de Lille, 2010. http://tel.archives-ouvertes.fr/tel-00586083.
Full textAbstract:
Les entreprises de transport et de distribution sont confrontées à des difficultés d'exploitation liées à la taille et à la complexité de leur processus de livraison. Dans cette problématique, nous proposons une approche globale du Problème Général de Livraison (PGL).Au niveau méthodologique, c'est une approche hiérarchique (stratégique, tactique, opérationnelle) et structurée. Il s'agit de concevoir et d'exploiter un PGL en le décomposant en problèmes de livraisons élémentaires identifiés et le plus possible indépendants les uns des autres (problèmes de transport, de hubs, d'agences, de tournées...).Au niveau algorithmique, des modèles et algorithmes de résolution ont été proposés pour résoudre ces problèmes élémentaires de livraison dans la phase opérationnelle en tenant compte, en particulier, du nombre et de la capacité limités des moyens de transport.Au niveau applicatif, deux exemples réels sont traités : le système de livraison d'une entreprise de Vente à Distance et le système de livraison des casernes de pompiers du Nord de la France à partir de la pharmacie centrale de Lille
23
Uhlíř, Filip. "Optimalizace logistických procesů ve firmě Kingspan, a. s." Master's thesis, Vysoká škola ekonomická v Praze, 2013. http://www.nusl.cz/ntk/nusl-199542.
Full textAbstract:
The aim of this work is to show the application of operational research on an example that is put into practise and to show the usabillity of this science field. The problem solved will be the Vehicle routing problem with split delivery. The whole process of solving this issue is described in the text. From the income data and automatised data aquisition from publicly acessible resources for the distance matrix to the created mathemathical model for this issue together with the implementation in SW Lingo. Furthermore, in my work classic distribution problem of linear programming in connection to the solved issue are described. Beside that three mathematical models are shown that are occyupying with this type of delivery. They can not be used for fading the solution to this issue as they include certain requirements or conditions which are not taken into account by the given models.
24
Daniel, Aang. "Routing and Scheduling with Time Windows: Models and Algorithms for Tramp Sea Cargos and Rail Car-Blocks." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/19698.
Full textAbstract:
Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2007.Committee Chair: Al-Khayyal, Faiz; Committee Member: Barnes, Earl; Committee Member: Johnson, Ellis; Committee Member: Karimi, IA; Committee Member: Sokol, Joel.
25
Rodrigues, Infância da Assunção. "Determinação de rotas de distribuição e recolha de produtos." Master's thesis, Instituto Superior de Economia e Gestão, 2014. http://hdl.handle.net/10400.5/8494.
Full textAbstract:
Mestrado em Decisão Económica e EmpresarialEste trabalho final de mestrado trata o Problema de Identificação de Rotas de Veículos com Recolha e Entrega em Simultâneo (Vehicle Routing Problem with Simultaneous Pickup and Delivery ? VRPSPD). O ponto crítico do problema assenta no facto de ambas as atividades, recolha e entrega, serem realizadas em simultâneo. Desta forma, a carga do veículo deve ser controlada após cada passagem por um cliente de modo a garantir que a capacidade do veículo não é excedida. O Problema de Identificação de Rotas com Recolha e Entrega em Simultâneo lida com um único depósito de distribuição, servindo um conjunto de clientes. Cada cliente requer dois tipos de serviço: a recolha e a entrega. Os produtos a entregar são carregados no depósito e os produtos a recolher são transportados para o depósito. Cada cliente é servido por um único veículo. Neste trabalho foram usados os modelos matemáticos de (Dethloff, 2001) e de (Montané & Galvão, 2006), para resolver o problema em questão, utilizando o software Frontline Solver. Os dois modelos são comparados quanto ao número de variáveis, e de restrições e sendo ilustrados os resultados obtidos num exemplo.
This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). The critical aspect of the problem lies in the fact that both activities, delivery and pickup, are performed simultaneously. Thus, the load of the vehicle should be controlled after each costumer service to ensure that capacity of the vehicle is not exceeded. The VRSPD deals with a single distribution warehouse serving a set of customers. Each customer requires two types of service: the pickup and the delivery. The products to delivery are loaded at the warehouse and the products to pickup are transported to the warehouse. Each client is served by a single vehicle. In this work two mathematical models (Dethloff, 2001) and (Montané & Galvão, 2006) are used, to solve the problem at hand, through the software Solver Frontline. The two models are compared regarding the number of variables, and constraints, and the results on an example.
26
Yuan, Yuan. "Modèles et Algorithmes pour les Problèmes de Livraison du Dernier Kilomètre avec Plusieurs Options d'Expédition." Thesis, Ecole centrale de Lille, 2019. http://www.theses.fr/2019ECLI0011.
Full textAbstract:
Dans cette thèse, nous étudions les problèmes de tournées de véhicules dans le contexte de la livraison du dernier kilomètre lorsque plusieurs options de livraisons sont proposées aux clients. Le mode de livraison le plus commun est la livraison à domicile ou au travail. La livraison peut également être effectuée dans des points de collecte tels que des consignes ou des magasins. Ces dernières années, un nouveau concept appelé livraison dans le coffre / dans la voiture a été proposé. Avec ce mode de livraison, les colis des clients peuvent être livrés directement dans les coffres des voitures. Notre objectif est de modéliser et de développer des approches de résolution efficaces pour les problèmes de routage dans ce contexte, dans lequel chaque client peut disposer de plusieurs lieux potentiels de livraison. Premièrement, nous proposons un état de l'art sur les problèmes de routage non-Hamiltoniens. Ensuite, nous étudions le cas avec un seul véhicule, qui est modélisé comme un problème du voyageur de commerce généralisé avec fenêtres de temps (GTSPTW). Quatre formulations en programme linéaire à variables mixtes et un algorithme efficace de branch-and-cut sont proposés. Ensuite, nous étudions le cas multi-véhicules, dénommé problème de tournées de véhicules généralisé avec fenêtres de temps (GVRPTW). Une heuristique efficace basée sur la génération de colonnes est proposée pour le résoudreIn this thesis, we study routing problems that arise in the context of last mile delivery when multiple delivery options are proposed to the customers. The most common option to deliver packages is home/workplace delivery. Besides, the delivery can be made to pick-up points such as dedicated lockers or stores. In recent years, a new concept called trunk/in-car delivery has been proposed. Here, customers' packages can be delivered to the trunks of cars. Our goal is to model and develop efficient solution approaches for routing problems in this context, in which each customer can have multiple shipping locations. First, we survey non-Hamiltonian routing problems. Then, we study the single-vehicle case in the considered context, which is modeled as a Generalized Traveling Salesman Problem with Time Windows (GTSPTW). Four mixed integer linear programming formulations and an efficient branch-and-cut algorithm are proposed. Finally, we study the multi-vehicle case which is denoted Generalized Vehicle Routing Problem with Time Windows (GVRPTW). An efficient column generation based heuristic is proposed to solve it
27
Tchapnga, Takoudjou Rodrigue. "Méthodes de modélisation et d'optimisation par recherche à voisinages variables pour le problème de collecte et de livraison avec transbordement." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0052/document.
Full textAbstract:
La présente thèse se déroule dans le cadre du projet ANR PRODIGE et est axée sur la recherche de stratégies permettant l’optimisation du transport en général et du transport routier de marchandises en particulier. Le problème de transport support de cette étude est le problème de collecte et livraison avec transbordement. Ce problème généralise plusieurs problèmes de transports classiques. Le transbordement y est utilisé comme levier de flexibilité et d’optimisation. Pour analyser et résoudre ce problème, les analyses sont effectuées suivant trois axes : le premier axe concerne l’élaboration d’un modèle analytique plus précisément d’un modèle mathématique en variables mixtes. Ce modèle permet de fournir dessolutions optimales au décisionnaire du transport mais présente l’inconvénient de nécessiter un temps de résolution qui croit exponentiellement avec la taille du problème. Cette limitation est levée par le deuxième axe d’étude qui permet de résoudre le problème de transport étudié par une méthode d’optimisation approchée tout en garantissant des solutions satisfaisantes.La méthode utilisée est une métaheuristique inspirée de la recherche à voisinages variables (VNS). Dans le troisième axe, l’ensemble des résultats obtenus dans la thèse sont testés en situation de transports réels via le projet PRODIGEThe thesis is conducted under the ANR project PRODIGE and it is focused on seeking strategies allowing the optimization of transport in general and road freight transport in particular. The transportation problem support for this study is the pickup and delivery problem with transshipment.This problem generalizes several classical transportation problems.Transshipment is used as optimization and flexibility leverage. To study and solve this problem, analyzes are performed along three axes :the first objective concerns the development of an analytical model, more accurately a mathematical model with mixed variables. This model allows providing optimal solution to the decision maker, but has the disadvantage of requiring a time resolution that grows exponentially with the size of the problem. This limitation is overcome by the second line of the study that solves the transportation problem studied by an approximate optimization method while ensuring satisfactory solutions. The method used is a mataheuristic broadly followed the variables neighborhoods research principles. In the third objective, the overall results obtained in the thesis are tested in real transport situation via the PRODIGE project
28
Chekoubi, Zakaria. "Problème intégré de dimensionnement de lots et de tournées de véhicules avec remanufacturing des produits en fin de vie." Electronic Thesis or Diss., Université de Lorraine, 2020. http://www.theses.fr/2020LORR0209.
Full textAbstract:
Dans une chaîne logistique traditionnelle, les opérations de production, de stockage et de distribution sont traitées séparément en raison de la complexité de la planification conjointe de ces opérations et le manque d'informations partagées entre les parties prenantes. Aujourd'hui, pour faire face à la concurrence féroce que connaît le marché mondial, les entreprises sont obligées de planifier conjointement ces activités afin de bénéficier des avantages économiques et environnementaux engendrés par cette intégration. Parmi les problèmes d’optimisation existants dans la littérature, le problème de la planification intégrée qui optimise conjointement les décisions de production, de gestion des stocks, de distribution et de tournées de véhicules, a récemment fait l'objet d'une attention considérable, malgré sa nature NP-difficile. En effet, ses avantages en termes de synchronisation entre les processus, de réduction des coûts et d’amélioration du niveau de service peuvent être importants. En outre, l’optimisation de ce problème dans le contexte des chaînes logistiques en boucle fermée avec gestion des Produits en Fin de Vie (PFV) conduit au développement de chaînes logistiques de plus en plus durables. De plus, les inquiétudes croissantes sur les enjeux environnementaux liés aux activités industrielles ont conduit à l'émergence de politiques de contrôle des émissions carbone. La prise en compte de ces réglementations peut conduire à un impact positif sur la responsabilité environnementale de l’entreprise. Pour répondre à ces défis, l’objectif de cette thèse consiste à concevoir des modèles et de développer des approches d’optimisation pour résoudre un problème de planification intégrée des opérations de production, de ré-usinage, de stockage et de distribution directe-inverse. Nous avons considéré une chaîne logistique en boucle fermée composée d’une ligne de production de produits neufs, d’une ligne de ré-usinage des PFV retournés, deux stocks pour les produits réutilisables et les PFV à ré-usiner, ainsi que des clients ayant des demandes dynamiques en livraison et en collecte. Le but est de déterminer les quantités optimales à produire, ré-usiner et stocker, ainsi que l’ordre de passage chez les clients afin de satisfaire leurs demandes simultanément en livraison et en collecte, tout en minimisant le coût total dû aux opérations induites. Dans un premier temps, un modèle linéaire en nombres entiers est proposé pour optimiser la chaîne logistique en considérant un ou plusieurs véhicules avec capacité limitée. La deuxième partie de la thèse porte sur le développement d’une heuristique de décomposition à deux phases pour résoudre le modèle intégré étendu. La dernière partie de la thèse est consacrée à l’intégration des émissions du dioxyde de carbone dans les décisions de production, de ré-usinage, de stockage et de distribution et d'étudier le comportement des niveaux d'émissions de carbone dans le cadre de la politique de plafonnement et d'échange de droits d'émission de carbone. Des expérimentations numériques permettent de démontrer l’applicabilité et les limites de nos approchesIn a traditional supply chain, production, inventory and distribution operations are treated separately due to the complexity of jointly planning these operations and the lack of information shared among stakeholders. Today, in order to face the fierce competition in the global market, companies are forced to jointly plan these activities in order to benefit from the economic and environmental benefits generated by this integration. Among the optimization problems existing in the literature, the integrated planning problem which jointly optimizes production, inventory management, distribution and vehicle routes decisions, has recently received considerable attention, despite its NP-hardiness. Indeed, its benefits in terms of synchronization between processes, cost reduction and improved service level can be significant. In addition, the optimization of this problem in the context of closed-loop supply chains with End-of-Life Product (EOL) management leads to the development of increasingly sustainable supply chains. Furthermore, growing concerns about environmental issues linked to industrial activities have led to the emergence of policies to control carbon emissions. Taking these regulations into account can have a positive impact on the company's environmental responsibility. To meet these challenges, the objective of this thesis is to design models and develop optimization approaches to solve an integrated planning problem of production, remanufacturing, storage and direct-reverse distribution operations. We considered a closed-loop supply chain consisting of a production line for new products, a remanufacturing line for returned EOL products, two types of inventories for reusable products and EOL ones to be remanufactured, as well as customers with dynamic demands for delivery and pickups. The goal is to determine the optimal amounts to produce, remanufacture and store, as well as the order of visiting customers in order to meet their requests simultaneously for delivery and pickup, while minimizing the total cost due to the involved operations. First, a linear integer model is proposed to optimize the supply chain system by considering one or more vehicles with limited capacity. The second part of the thesis concerns the development of a two-phase decomposition heuristic to solve the extended integrated model. The last part of the thesis is devoted to the integration of carbon dioxide emissions into production, remanufacturing, inventory and distribution decisions and to study the behavior of carbon emission levels in the context of cap-and-trade policy. Numerical experiments make it possible to demonstrate the applicability and the limits of our approaches
29
Visoldilokpun, Siriwat. "Unmanned aerial vehicle routing problem with limited risk." 2008. http://hdl.handle.net/10106/1831.
Full text
30
Kuo, Ching-Lung, and 郭晴龍. "The Vehicle Routing Problem for Home Delivery." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/31535955919243134729.
Full textAbstract:
碩士國防管理學院
後勤管理研究所
93
The home delivery vehicle routing problem is the extension of the traditional vehicle routing problem. It’s biggest characteristic is there exists difference routes for everyday delivery, and each vehicle has certain delivery zone. This research tries to find the optimal route, at the lowest cost of distance and time windows, and pickup or deliver goods from different customers without violating vehicle capacity and time window restrictions. We first apply the savings method to develop the initial route, then use Tabu search to improve this initial route unitl the optimal delivery route is reached. A couple of numerical examples are demonstrated by applying the operation parameter provided by a very famous home delivery company in Taiwan. The results show that this model can be successfully applied in home delivery problem in a very efficient way. Finally, the performance of this proposed method are compared with other heuristic approach and current operation procedure implemented by the above illustrated home delivery company. The results trun out to be promising in many asperts.
31
Hus, Chin-Chia, and 許晉嘉. "The Vehicle Routing Problem for Home Delivery." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/78362990339429418400.
Full textAbstract:
碩士國立成功大學
交通管理學系碩博士班
91
Recently, more attention is being focused on the business of home delivery service. How to minimizing transportation costs is an important issue in this business. The research makes an attempt to study how the sale drivers find optimal routes to pick up and deliver packets each day. Essentially, this problem for each sale driver is a Traveling Salesman Problem, consisting of four aspects: single-vehicle, ordered cluster, dynamic and pickup-delivery. We define it as a Pickup-Delivery Dynamic Traveling Salesman Problem with Backhauls (PDDTSPB). In order to deal with the dynamic aspect in the PDDTSPB we formulate a pre-event routing model and a real-time routing model for it. Furthermore, heuristic algorithms are developed for these two models, respectively. The computation results of test problems show that the heuristic algorithms can efficiently solve the PDDTSPB. Moreover, a real-world case is also tested with these heuristic algorithms. It is showed that a near-optimal route, with 20% savings from the real-world data, can be obtained. It is hoped that the heuristic algorithms can help sale drivers in the home delivery industry to solve their PDDTSPB.
32
Chen, Yi-Fang, and 陳怡芳. "The Single Vehicle Routing Problem for Home Delivery." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/02737963384631670398.
Full textAbstract:
碩士逢甲大學
交通工程與管理所
93
With the development of e-Commerce, people can place orders through internet and the commodity is shipped right to the customer’s door, hence people reply on home delivery service more and more and the service competition becomes more intensive. The characteristics of home delivery service are of low volume, being highly variable, and needs to serve many points within a time window. Hence the service cost is higher than traditional carrier’s. Vehicle routing has a great impact on the level of service (responsiveness) and operating costs (efficiency). Therefore, how to plan vehicle routing effectively for home delivery is the key to success in competition. Home delivery service serves two types of customers - general customers and contracted customers. Usually, pickup-delivery service is provided in the morning and afternoon for general customers but at pre-specified times for contracted customers. Considering the service time for both customers, the vehicle routing problem becomes a time window constraint problem. In addition, some demands are still unknown before vehicles leaving from the depot. Therefore, we can define the vehicle routing planning of home delivery service as Dynamic Pickup-Delivery VRP with Time Window (DPDVRPTW). In this study, we design a vehicle routing system. The initial vehicle routes are constructed by the nearest insertion method. The Tabu Search (TS) algorithm is used for improving vehicle routes and Swap and Or-opt are used in sequence as search engines. The test problems are designed in different scales depending on the service times and the related parameters are selected according to the improving rate obtained from each problem test. Finally, the spatial analysis feature of Geographic Information System (GIS) is used to assist home delivery service companies in vehicle routing. According to the test results, the length of initial routes can be reduced by 30% to 40% after improving the routing procedure and the level of service remains satisfactory.
33
Jun, Shen YU, and 沈煜鈞. "A Study of Fuel Delivery Vehicle Routing Problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/78275044530477968757.
Full textAbstract:
碩士國防管理學院
後勤管理研究所
93
Vehicle routing problem is derived Travel Salesman Problem. The characteristic of vehicle routing problem is that it must satisfy all customers’ needs and capacity constraint of vehicles. This study tries to find the optimal route without violating vehicle capacity and time window restrictions, and deliver fuel to gas stations which place the orders at the lowest distance cost. We first apply the savings method to develop the initial route, then use Tabu search to improve this initial route until the optimal delivery route is found. A couple of numerical examples are demonstrated by based on the operation parameters provided by Chinese Petroleum Company(C.P.C) in Taiwan. The result turnout to be promising compared to the routes developed by LOGWARE and professional dispatchers of C.P.C . Key word：Vehicle Routing Problem,Travel Salesman Problem,Time window,Savings method,Tabu Search.
34
LEE, CHEN-YI, and 李振義. "The Vehicle Routing Problem of Motorcycle Delivery Carrier." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/96531305980445478894.
Full text
35
Goel, Asvin, and Volker Gruhn. "A General Vehicle Routing Problem." 2008. https://ul.qucosa.de/id/qucosa%3A32732.
Full textAbstract:
In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles. The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement
approaches based on the idea of changing the neighbourhood structure during the search.
36
涂家瑋. "Modelling the Pick-up and Delivery Vehicle Routing Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/53058412757472953353.
Full text
37
張振邦. "Vehicle routing problem for combination home-delivery and express." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/01496579647005266190.
Full textAbstract:
碩士南台科技大學
行銷與流通管理系
92
In modern, the value of time is becoming more and more important. For meeting the different customers’ demand, some owners provide time-guranteed delivery service of mixed express and home delivery package. And the delivery service is different from the traditional home-delivery and express. We define this question as a related traveling salesman problem with pick-up and delivery. Three integer linear programming formulations are proposed to solve this problem. The objective is to minimize the number of deliveries completed after their deadline. But the solution of integer linear programming formulations is just near-optimal and inefficient. We then introduce a heuristic formulation to improve the situations. The result shows that the heuristic formulation can solve larger scale problem efficiently and optimally.
38
Hsiao, Chan-Kai, and 蕭丞凱. "A Study of Single Depot Split Delivery Vehicle Routing Problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/07820773396237392561.
Full textAbstract:
碩士國立臺灣科技大學
資訊管理系
103
Split Delivery Vehicle Routing Problem (SDVRP) is a variations of Vehicle Routing Problem (VRP). The vehicle must start from a specific depot and end at the exact same depot .Contrary to what is usually assumed about the Vehicle Routing Problem (VRP), each customer can be visited more than once and the demand of each customer may be greater than the vehicle capacity. The problem is trying to find a set of vehicle routes that serves all the customers with each route not exceeding the capacity of the vehicle and making the distance traveled at a minimum. In this thesis, we proposed a meta-heuristic method to solve the Split Delivery Vehicle Routing Problem. For the benefits of heuristic algorithm, we try to combine and use it to solve our problem. In the first step, we use the concept of clustering analyzing to clustering the customer, then we use an algorithm that combine with Genetic Algorithm and Ant Algorithm to optimize each route in SDVRP. Next, we try using the concept of Tabu Search Algorithm and Simulated Annealing Algorithm to develop three new method to solve our problem. With the first and second steps, we are able to solve the Split Delivery Vehicle Routing Problem.
39
Morim, André Craveiro. "General Variable Neighborhood Search for the Drone-Assisted Vehicle Routing Problem with Robot Stations." Master's thesis, 2020. https://hdl.handle.net/10216/132709.
Full text
40
Morim, André Craveiro. "General Variable Neighborhood Search for the Drone-Assisted Vehicle Routing Problem with Robot Stations." Dissertação, 2020. https://hdl.handle.net/10216/132709.
Full text
41
Kao, Shih-Chang, and 高世昌. "Multi-Depot Vehicle Routing Problem with Simultaneous Delivery and Pickup Points." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/f98baw.
Full textAbstract:
碩士逢甲大學
工業工程學所
90
The classical vehicle routing problem is thought of as a single depot with pure delivery or pickup problem. In many practical situations, however, the fleet of vehicles is stationed at more than one depot and the vehicle is required to mix drop off goods and pick up goods to the depot at the same stop. This paper recognizes the possibility of mixed routes with pickup and delivery customers allowed. The objective of the problem is to design a set of routs for the vehicles stationed at each depot so that all customers are serviced, each vehicle departs from and returns to the same depot, and the total distance traveled by the fleet is minimized. The purpose of this paper is to develop a heuristic for this type of vehicle routing problems. Computational characteristics of the developed heuristic will be evaluated through extensive computational experiments and comparisons will be made with optimal solutions.
42
Yang, Fu-hao, and 楊馥豪. "Mixed Pick-up and Delivery Vehicle Routing Problem with Time Windows." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/09633560619091071642.
Full textAbstract:
碩士立德管理學院
應用資訊研究所
94
Abstract The development of the logistics industry is rising with the economic growth. The cost for picking up and delivering freight a significant weight in the total cost of a logistics company. Many studies have devoted to explore the Vehicle Routing Problem (VRP) and intend to decrease the cost for pick-up and delivery. Generally, the planning of vehicle routes has made by the rule of thumb. It’s difficult to calculate the optimal Vehicle Routes and decrease the total costs within the short time. At present, consumers request accurate service times. Thus, the idea of time windows constraint has used to the Vehicle Routing Problem. The expectancy of the study is to build a model to solve Vehicle Routing Problem with time windows, and regard reaching the minimum cost as the goal. We made some assumption that （1）single warehouse;（2）the vehicle fleet were managed by the warehouse and single capacity of the vehicle;（3）locations of customers, quantity of pickup and delivery, service time are given; This study applies the mathematical programming method to construct a model to solve mixed pick-up and delivery vehicle routing problem with time windows. We develop the solving procedure by using heuristic algorithm, search the initial solution by the near neighbor algorithm. Use the 2-opt exchange method and the 1-1 interchange method to improve the initial solution. In the improved course, avoid the local optimal solutions by adopting Simulated Annealing method. Finally, we uses Microsoft Visual Studio .NET to write the solving programs. Results of the program are the optimal vehicle routes, minimum total costs and the arrival times with each node. This study may be used to solve the relational pickup and delivery vehicle routing problem.
43
Hwang, Ga Sheng, and 黃珈昇. "The Investigation of Container Delivery Vehicle Routing Problem in Logistics System." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/37440468078796000988.
Full text
44
Lin, Shi-An, and 林士安. "Incorporating Cargo Loading Feasibility into a B2B Delivery Vehicle Routing Problem." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/563q7v.
Full textAbstract:
碩士國立東華大學
運籌管理研究所
107
In the supply chain management, the cost of transporting the cargo was account for a large part in the operation process. The efficiency distribution planning not only can save the cost, but also to increase the customer satisfaction. However, distribution planning was much difficult in practice, especially in the loading problem. Three dimensional loading is an NP-hard problem. In the logistics company, they always face to a plight that they cannot load cargos into a specific vehicle completely, so that the workers have to reload again or use extra vehicle. In the past, we just consider the limit of weight or capacity of vehicle in CVRP problem, the results were hard to be executed in the real situation, and probably increased the extra operation cost and time. The main idea of this paper was to solve the 3L-CVRP problem by the proposed heuristics algorithms, based on “Routing first- Packing second” strategy. We used simulated annealing algorithm to find an initial solution of the improved CVRP problem and solve the loading problem based on CargoWiz software. The object was to minimize the number of vehicle used. And we took the real data of a B2B (Business to Business) logistics company for instance in this paper, that was rarely seem in before. The characteristics of B2B cargos were a wide variety and the qualities were so much different. Eventually, we found feasible solutions by the methods we proposed. The logistics company can follow our methods to make a distribution plan in advance to avoid the loading infeasibility.
45
Hung, Chen-Yu, and 洪振育. "Solving a Vehicle Routing Problem with Vehicle Delivery-Time Restrictions in a Consumer Electronics Warehouse." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/e8h5dr.
Full textAbstract:
碩士國立交通大學
管理學院運輸物流學程
106
This research armed to discuss the single finish goods (FG) distribution center within VRPTW (Vehicle Routing Problem with Time Windows) for Consumer Electronics. Vehicle departure from distribution center, deliver goods at requested delivery time. Follow by the daily scheduled planned by administrator and back to distribution center after service completed. The factor to determine schedule included delivery distance, vehicle type and quantity required by each distributor. To obtain the minimized logistics cost by approach the shortest routing path in time-window and delivery requirements constraints under known location and loading limitation of vehicle. The outcome of our experiments has justified that the model developed in this study can reduce logistics cost efficiently and can be a direction to adjust the planning method for the company studied in this case.
46
Tseng, Yu-Ning, and 曾俞寧. "A Study on the Hybrid Multi-temperature Co-delivery Vehicle Routing Problem." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/06259555552972987901.
Full textAbstract:
碩士中華大學
運輸科技與物流管理學系(所)
96
The business model of multi-temperature co-delivery that adopted modern innovational technologies, such as the multi-temperature refrigerated container (MRC), has created a new value for the cold-chain logistics. In the practice, carriers operated by a combination of traditional heterogeneous fleet with MRC because the investment in MRC is costly. Therefore, this study mainly focused on the above-mentioned combined operation and proposed a new model named as the Hybrid Multi-Temperature Co-delivery Vehicle Routing Problem (HMCVRP). This study also designed a RASTA (Ranked Ant System with Threshold Accepting) procedure that combined the neighborhood search methods with threshold accepting algorithm into a scheme of the ASrank algorithm to solve the HMCVRP. In order to identify the feasibility of RASTA, a bank of thirty HMCVRP instances, modified from VRP benchmarks by Christofides et al., was generated and five experiments were conducted to analyze the computational performance. Computational results shown that the proposed RASTA can solve the HMCVRP effectively. In addition, the case of using HMCVRP is superior to that of only using MRC in operating cost.
47
Hung, Ming-Jyun, and 洪銘駿. "Pickup and Delivery Vehicle Routing Problem with Split Loads by Heterogeneous Fleet." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/23402769494388677439.
Full textAbstract:
碩士國立雲林科技大學
工業工程與管理系
103
In this study, we consider the Pickup and Delivery Vehicle Routing Problem with Split Loads by Heterogeneous Fleet. This problem is a single pickup can delivery to a single customer where each load can be served by multiple vehicle as well as multiple stops by the same vehicle. First, we construct a mathematical model which minimizes total cost as its objective. Following, a Simulated Annealing based heuristic is presented to solve this problem. The expected results of this study include: (1) Plan an optimal transport routes, (2) reduce the number of vehicle used, (3) reduce amount of carbon emitted.
48
Lin, Xiu-He, and 林修禾. "Vehicle Routing Problem with Pick-up and Delivery in Cross-Docking Environment." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/11672005447124383620.
Full textAbstract:
碩士國立雲林科技大學
全球運籌管理研究所碩士班
100
Cross docking effectively reduces inventory in the supply chain. It uses sophisticated equipment to integrate many kinds of good. The goods don’t need to reserve on the shelf, so it can save a huge area of traditional logistics center. Moreover, it can also reduce human resources and inventory cost. In order to keep this high quality operation, it must be planning a perfect vehicle routing planning. In that way, goods can fast delivery when they arrive at the logistic center, so it can avoid the inventory cost. In this study, we will relax the constraints in the pickup process. The vehicles can serve retailer in the pickup process, but capacity and travel time can not exceed in constraints. It will reduce the fix cost of the vehicles. In this study, first we will consturuct a mathematical model and use Lingo8.0 to solve small problems. Then we will design a tabu search heuristic algorithm to solve big problems and compare with past method. Our tabu search obtains the same solutions with Lingo8.0 and spent less time in the small problems. Finally, we use our tabu search to compare with past method in the problems which have 15,30,50,75,100 points, and we obtain better solutions than past method, but we spent longer time in calculation time.
49
Liu, Yun-xi, and 劉芸希. "Vehicle Routing Problem with Simultaneous Pickup and Delivery in Cross-Docking Environment." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/21275247216778095546.
Full textAbstract:
碩士國立雲林科技大學
工業工程與管理研究所碩士班
101
In the extremely competitive and rapidly changing market, improving the efficiency of the logistics can reduce cost of enterprises and also improve customer satisfaction. A well designed cross-docking delivery system can effectively reduce operation cost, reduce inventory cost, and achieve high delivery efficiency in short time. Therefore, this study will discuss vehicle routing problem with simultaneous pickup and delivery in a cross-docking environment. The problem includes three stages: (1) pickup, (2) delivery with recycling goods, and (3) return of goods. The second stage can directly serves suppliers for return of goods within time and capacity constraints. We believe that it will further reduce transportation costs. The objective of this model is to minimum total transportation costs, including vehicle transportation costs and vehicle fixed costs. This study will construct a mathematical model first and then develop appropriate heuristic algorithms for solving the problem. The Tabu algorithm is designed for improving routing problem. Results of illustration examples show that the proposed heuristic algorithm can effectively reduce transportation costs and obtain a near optimal solution. Finally, a sensitivity analysis is conducted on (1) vehicle capacity, (2) the proportion of the end of time for each stages, (3) location for cross-dock. Each adjustment condition is evaluated for impact on the total transportation cost. The concluding remarks are useful for management decision.
50
Sheng, Jhih-Wei, and 盛智偉. "A Study of Location Problem for Fuel Distribution Center and Fuel Delivery Vehicle Routing Problem." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/64151064176255007702.
Full textAbstract:
碩士國立雲林科技大學
工業工程與管理研究所碩士班
100
This study focus on the location problem for fuel distribution center and vehicle routing problem for fuel delivery. The overall cost in this model includes the pipeline set up cost, the social cost of fuel distribution center, the transportation costs, and the punishment cost of fuel tank car on location choice. This research proposes an integrated heuristic algorithm which combines a Tabu algorithm and a Genetic algorithm. The Tabu algorithm is designed for improving vehicle routing and the Genetic algorithm is designed for improvement of fuel distribution center location. Results of numeric examples show that the integrated algorithm is not only able to effectively improve vehicle routing, but also searching for the location with lower total cost. Finally, a sensitivity analysis is also conducted and discussed. The concluding comments are useful for decision making.