Дисертації з теми "Vehicle routing problem with drone delivery"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Vehicle routing problem with drone delivery".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерела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.
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаNowak, Maciek A. "The Pickup and Delivery Problem with Split Loads." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.
Повний текст джерелаRahmani, Younes. "The Multi-product Location-Routing Problem with Pickup and Delivery." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331/document.
Повний текст джерелаIn 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
Rahimi, Mohammad. "Inventory routing problem under dynamic, uncertain and green considerations." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI049/document.
Повний текст джерелаThe 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
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Uyar, Emrah. "Routing in stochastic environments." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26554.
Повний текст джерела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.
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаŠ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.
Повний текст джерела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.
Повний текст джерела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.
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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерела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.
Повний текст джерелаCommittee Chair: Al-Khayyal, Faiz; Committee Member: Barnes, Earl; Committee Member: Johnson, Ellis; Committee Member: Karimi, IA; Committee Member: Sokol, Joel.
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.
Повний текст джерелаEste 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.
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.
Повний текст джерелаIn 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
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.
Повний текст джерелаThe 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
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.
Повний текст джерелаIn 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
Visoldilokpun, Siriwat. "Unmanned aerial vehicle routing problem with limited risk." 2008. http://hdl.handle.net/10106/1831.
Повний текст джерелаKuo, Ching-Lung, and 郭晴龍. "The Vehicle Routing Problem for Home Delivery." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/31535955919243134729.
Повний текст джерела國防管理學院
後勤管理研究所
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.
Hus, Chin-Chia, and 許晉嘉. "The Vehicle Routing Problem for Home Delivery." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/78362990339429418400.
Повний текст джерела國立成功大學
交通管理學系碩博士班
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.
Chen, Yi-Fang, and 陳怡芳. "The Single Vehicle Routing Problem for Home Delivery." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/02737963384631670398.
Повний текст джерела逢甲大學
交通工程與管理所
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.
Jun, Shen YU, and 沈煜鈞. "A Study of Fuel Delivery Vehicle Routing Problem." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/78275044530477968757.
Повний текст джерела國防管理學院
後勤管理研究所
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.
LEE, CHEN-YI, and 李振義. "The Vehicle Routing Problem of Motorcycle Delivery Carrier." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/96531305980445478894.
Повний текст джерелаGoel, Asvin, and Volker Gruhn. "A General Vehicle Routing Problem." 2008. https://ul.qucosa.de/id/qucosa%3A32732.
Повний текст джерела涂家瑋. "Modelling the Pick-up and Delivery Vehicle Routing Problem." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/53058412757472953353.
Повний текст джерела張振邦. "Vehicle routing problem for combination home-delivery and express." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/01496579647005266190.
Повний текст джерела南台科技大學
行銷與流通管理系
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.
Hsiao, Chan-Kai, and 蕭丞凱. "A Study of Single Depot Split Delivery Vehicle Routing Problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/07820773396237392561.
Повний текст джерела國立臺灣科技大學
資訊管理系
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.
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.
Повний текст джерела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.
Повний текст джерелаKao, Shih-Chang, and 高世昌. "Multi-Depot Vehicle Routing Problem with Simultaneous Delivery and Pickup Points." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/f98baw.
Повний текст джерела逢甲大學
工業工程學所
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.
Yang, Fu-hao, and 楊馥豪. "Mixed Pick-up and Delivery Vehicle Routing Problem with Time Windows." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/09633560619091071642.
Повний текст джерела立德管理學院
應用資訊研究所
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.
Hwang, Ga Sheng, and 黃珈昇. "The Investigation of Container Delivery Vehicle Routing Problem in Logistics System." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/37440468078796000988.
Повний текст джерелаLin, Shi-An, and 林士安. "Incorporating Cargo Loading Feasibility into a B2B Delivery Vehicle Routing Problem." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/563q7v.
Повний текст джерела國立東華大學
運籌管理研究所
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.
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.
Повний текст джерела國立交通大學
管理學院運輸物流學程
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.
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.
Повний текст джерела中華大學
運輸科技與物流管理學系(所)
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.
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.
Повний текст джерела國立雲林科技大學
工業工程與管理系
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.
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.
Повний текст джерела國立雲林科技大學
全球運籌管理研究所碩士班
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.
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.
Повний текст джерела國立雲林科技大學
工業工程與管理研究所碩士班
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.
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.
Повний текст джерела國立雲林科技大學
工業工程與管理研究所碩士班
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.