Увійти

Готові списки джерел за темами / Open Vehicle Routing Problem / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Open Vehicle Routing Problem.

Дисертації з теми "Open Vehicle Routing Problem"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся з топ-50 дисертацій для дослідження на тему "Open Vehicle Routing Problem".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.

1

Sariklis, Dimitrios. "Open Vehicle Routing Problem : description, formulations and heuristic methods." Thesis, London School of Economics and Political Science (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265252.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Sukarno, Setyawan Ajie. "Méthodes d'approximation au problème de routage de véhicule pour une gestion de flotte de drones." Thesis, Valenciennes, Université Polytechnique Hauts-de-France, 2019. http://www.theses.fr/2019UPHF0022.

Повний текст джерела

Анотація:

Aujourd’hui, le drone joue un rôle important dans les activités civiles et deviendra de plus en plus important à l’avenir. Récemment, de nouvelles tendances se dirigent vers la gestion d’une ﬂotte de drones aﬁn de réaliser les missions données. Ce problème ouvre de nombreuses idées de recherche, et notre projet est fait pour répondre au déﬁ, développer une plateforme de gestion de ﬂotte de drones. Entre plusieurs approches, le problème de routage de véhicule (VRP) est une étude parfaite pour relever ce déﬁ, aﬁn de répartir les tâches et de trouver le meilleur chemin pour chaque drone, en tenan

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Villanueva, Rafael Salcedo. "A pragmatic approach to improve the efficiency of the waste management system in Stockholm through the use of Big Data, Heuristics and open source VRP solvers : A real life waste collection problem;Stockholm’s waste collection system and inherent vehicle routing problem, VRP." Thesis, KTH, Hållbar utveckling, miljövetenskap och teknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-272200.

Повний текст джерела

Анотація:

In this thesis, we will address a real life waste collection problem; Stockholm’s waste collection system and inherent vehicle routing problem, VRP. To do this we will first delve into some mathematical theory of Combinatorial Optimization and Heuristics to understand the fundamentals of the problem. Following with some pragmatic approaches recommended by experts within the Smart Cities context. Finally, the most important part of the work is the creation of a model of the actual collection system and two optimized versions. After completing the model of the system, we compare the current situ

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Mourgaya, Virapatrin Magalie. "The periodic vehicle routing problem : planning before routing." Bordeaux 1, 2004. http://www.theses.fr/2004BOR12843.

Повний текст джерела

Анотація:

Le problème de tournées de véhicules multipériodiques consisté à planifier des visites client sur un horizon de temps donné en les affectant à des tournées de véhicule. Les fréquences de visites ou espacement entre elles sont prescrits. Ces contraintes peuvent prendre la forme de scénarios de visites admissibles. Nous étudions les différentes variantes de ce problème et proposons une classification. Nous présentons ensuite un algorithme heuristique pour un modèle de planification tactique qui optimise la répartition de la charge et la régionalisation des tournées. L'objectif traditionnel de mi

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Jacobs, Charlotte Diane. "The vehicle routing problem with backhauls." Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/25629.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Doerner, Karl, Manfred Gronalt, Richard F. Hartl, Marc Reimann, Christine Strauß, and Michael Stummer. "SavingsAnts for the vehicle routing problem." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/1130/1/document.pdf.

Повний текст джерела

Анотація:

In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other classic, powerful meta-heuristics and show that our results are competitive.<br>Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Johar, Farhana. "Vehicle routing problem with availability constraints." Thesis, University of Southampton, 2015. https://eprints.soton.ac.uk/389516/.

Повний текст джерела

Анотація:

This work is concerned with solving the vehicle routing problem (VRP) which takes into account the customer's release and due date. The problem studied can also be categorized as a non-classical VRP as the departure times of vehicles depend on the dates of orders released from the production line and become available for the distribution process. Hence, the problem is known as VRP with availability constraints (VRPAC). The VRPAC is investigated through two stages. In the first stage, vehicle routing problem with release and due date (VRPRDD) is treated. At the beginning of the planning, it is

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Talaei, Majid. "Heuristics for energy efficient vehicle routing problem." Thesis, Wichita State University, 2012. http://hdl.handle.net/10057/5611.

Повний текст джерела

Анотація:

US logistics cost of 1.397 trillion dollars in 2007, which stands for more that 10 percent of the total GDP of the country justifies any attempt of reducing it. Transportation followed by inventory-carrying and logistics administration has the greatest cost share in logistics. A tool which is very critical in transportation planning and can contribute to huge savings if used properly is Vehicle Routing Problem. Near optimum vehicle routs which are designed by outstanding heuristics and experts could contribute significantly to cost saving. Another important issue which directly affects logisti

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Maqueo, Rodrigo Rubio. "Dynamic-stochastic vehicle routing and inventory problem." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/10593.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Cornick, Namrata Uppal. "The vehicle routing problem with demand ranges." College Park, Md.: University of Maryland, 2009. http://hdl.handle.net/1903/9376.

Повний текст джерела

Анотація:

Thesis (M.S.) -- University of Maryland, College Park, 2009.<br>Thesis research directed by: Applied Mathematics and Scientific Computation Program . Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Malagoli, Davide. ""Vehicle Routing Problem": un caso di studio." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amslaurea.unibo.it/1547/.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Battaglia, Andrea. "Metodi euristici per il Vehicle Routing Problem." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amslaurea.unibo.it/6244/.

Повний текст джерела

Анотація:

Il problema della consegna di prodotti da un deposito/impianto ai clienti mediante una flotta di automezzi è un problema centrale nella gestione di una catena di produzione e distribuzione (supply chain). Questo problema, noto in letteratura come Vehicle Routing Problem (VRP), nella sua versione più semplice consiste nel disegnare per ogni veicolo disponibile presso un dato deposito aziendale un viaggio (route) di consegna dei prodotti ai clienti, che tali prodotti richiedono, in modo tale che (i) la somma delle quantità richieste dai clienti assegnati ad ogni veicolo non superi la capacità de

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Pereira, Victor Caon. "Vehicle Routing for Emergency Evacuations." Diss., Virginia Tech, 2013. http://hdl.handle.net/10919/52361.

Повний текст джерела

Анотація:

This dissertation introduces and analyzes the Bus Evacuation Problem (BEP), a unique Vehicle Routing Problem motivated both by its humanitarian significance and by the routing and scheduling challenges of planning transit-based, regional evacuations. First, a variant where evacuees arrive at constant, location-specific rates is introduced. In this problem, a fleet of capacitated buses must transport all evacuees to a depot/shelter such that the last scheduled pick-up and the end of the evacuee arrival process occurs at a location-specific time. The problem seeks to minimize their accumulated w

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Carreto, Carlos A. C. "Visual interactive methods for vehicle routing." Thesis, Coventry University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.246575.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Escobar, Velasquez John Willmer <1980&gt. "Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5258/1/Escobar_John_tesi.pdf.

Повний текст джерела

Анотація:

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on bench

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Escobar, Velasquez John Willmer <1980&gt. "Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2013. http://amsdottorato.unibo.it/5258/.

Повний текст джерела

Анотація:

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on bench

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Solyali, Oguz. "An Integrated Inventory Control And Vehicle Routing Problem." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/2/12606445/index.pdf.

Повний текст джерела

Анотація:

In this study, we consider a logistics system, in which a single supplier delivers a product to multiple retailers over a finite time horizon. Supplier decides on the amount to order in each period and services retailers facing deterministic dynamic demand via a fleet of vehicles having limited capacity. Each retailer has specific minimum and maximum levels of inventory in an order-up-to level inventory policy setting. The problem is to simultaneously determine the quantity of product to order to the supplier, retailers to be visited, the quantity of product to be delivered to retailers and ro

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Lucena, Filho abilio Pereira de. "Exact solution approaches for the vehicle routing problem." Thesis, Imperial College London, 1986. http://hdl.handle.net/10044/1/38087.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Andersson, Johan, and Sebastian Leborg. "Tidsberoende restider för Vehicle Routing Problem : MED OPTAPLANNER." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177524.

Повний текст джерела

Анотація:

Trafikstockning är ett vanligt förekommande problem i storstäder och för med sig förseningar och extra kostnader för transportföretag. Vehicle Routing Problem är ett kombinatoriskt optimeringsproblem som ämnar hitta lägsta kostnaden att besöka en mängd kunder med flera fordon. Här beskrivs ett sätt att använda och förbättra ruttplanering i Stockholm med Vehicle Routing Problem och OptaPlanner genom att införa tidsberoende restider. Modeller till Vehicle Routing Problem har skapats där kostnaden mellan kunderna kvantifierades genom att mäta distans fågelvägen, fasta restider inom trafiknätet oc

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Ursani, Ziauddin Engineering &amp Information Technology Australian Defence Force Academy UNSW. "Localized genetic algorithm for the vehicle routing problem." Awarded by:University of New South Wales - Australian Defence Force Academy. Engineering & Information Technology, 2009. http://handle.unsw.edu.au/1959.4/43763.

Повний текст джерела

Анотація:

This thesis identifies some problems, the genetic algorithm (GA) is facing in the area of vehicle routing and proposes various methods to address those problems. Those problems arise from the unavailability of suitable chromosomal representation and evaluation schemes of GA for the Vehicle Routing Problem (VRP). The representation and evaluation schemes already in use have problems of high computational cost, illegal chromosomes (chromosomes not representing a legal tour) and wrong fitness assignment (fitness not truly representing chromosome genetic makeup). These problems are addressed by se

Стилі APA, Harvard, Vancouver, ISO та ін.

21

PECIN, DIEGO GALINDO. "EXACT ALGORITHMS FOR THE CAPACITATED VEHICLE ROUTING PROBLEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24379@1.

Повний текст джерела

Анотація:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>Os Problemas de Roteamento de Veículos estão entre os problemas combinatoriais mais difíceis de se resolver à otimalidade. Eles foram propostos no final da década de 1950, e desde então eles têm sido amplamente estudados. O interesse deve-se a sua importância prática, bem como da dificuldade de se fornecer algoritmos eficientes para resolvê-los. Esta tese trata principalmente da

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Wallace, Maxwell. "Dynamic vehicle routing problem : a metaheuristics based investigation." Thesis, Cardiff University, 2007. http://orca.cf.ac.uk/54610/.

Повний текст джерела

Анотація:

The desire to optimise problems is as prevalent in today's society as it has ever been. The demand for increases in speed and efficiency is relentless and has resulted in the need for mathematical models to bear greater resemblance to real-life situations. This focus on increased realism has paved the way for new dynamic variants to classic optimisation problems. This thesis begins by considering the Dynamic Vehicle Routing Problem. The basic premise of this routing problem is as follows a percentage of customers are known a priori, for which routes are constructed, further customers then arri

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Solano, Charris Elyn Lizeth. "Optimization methods for the robust vehicle routing problem." Thesis, Troyes, 2015. http://www.theses.fr/2015TROY0026/document.

Повний текст джерела

Анотація:

Cette thèse aborde le problème de tournées de véhicules (VRP) adressant des incertitudes via l'optimisation robuste, en donnant le VRP Robuste (RVRP). D'abord, les incertitudes sont intégrées sur les temps de trajet. Ensuite, une version bi-objectif du RVRP (bi-RVRP) est considérée en prenant en compte les incertitudes sur les temps de trajet et les demandes. Pour résoudre le RVRP et le bi-RVRP, différentes méthodes sont proposées pour déterminer des solutions robustes en minimisant le pire cas. Un Programme Linéaire à Variables Mixtes Entières (MILP), six heuristiques constructives, un algori

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Yahiaoui, Ala-Eddine. "Selective vehicle routing problem : cluster and synchronization constraints." Thesis, Compiègne, 2018. http://www.theses.fr/2018COMP2449/document.

Повний текст джерела

Анотація:

Le problème de tournées de véhicules (Vehicle Routing Problem - VRP) est un problème d'optimisation combinatoire utilisé généralement pour modéliser et résoudre des différents problèmes rencontrés dans les systèmes logistiques et de transport. Dans cette thèse, nous nous sommes intéressés à l'étude et la résolution d'une classe de problèmes du VRP appelée les problèmes de courses d'orientation (Team Orienteering Problem - TOP). Dans cette catégorie de problèmes, il est a priori impossible de visiter tous les clients en raison de ressources limitées. On associe plutôt un profit à chaque client

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Radiy, Mamon. "A hybrid method for capacitated vehicle routing problem." Thesis, Curtin University, 2010. http://hdl.handle.net/20.500.11937/69.

Повний текст джерела

Анотація:

The vehicle routing problem (VRP) is to service a number of customers with a fleet of vehicles. The VRP is an important problem in the fields of transportation, distribution and logistics. Typically the VRP deals with the delivery of some commodities from a depot to a number of customer locations with given demands. The problem frequently arises in many diverse physical distribution situations. For example bus routing, preventive maintenance inspection tours, salesmen routing and the delivery of any commodity such as mail, food or newspapers.We focus on the Symmetric Capacitated Vehicle Routin

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Gachaka, Umapathi. "Modelling and Analysis of an electric vehicle routing problem." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.

Знайти повний текст джерела

Анотація:

The Vehicle Routing Problem (VRP) has been studied for many decades . The majority of these works focus on the static and deterministic cases of vehicle routing in which all information is known at the time of the planning of the routes. A Green Vehicle Routing Problem (G-VRP) is formulated and solution for these techniques are developed to aid organizations with alternative fuel-powered vehicle fleets in overcoming difficulties that exist as a result of limited number of vehicle driving range in conjunction with limited refueling infrastructure. The G-VRP is formulated as a mixed integer line

Стилі APA, Harvard, Vancouver, ISO та ін.

27

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.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Redi, Anak Agung Ngurah Perwira, and 王偉亞. "Open Vehicle Routing Problem With Cross-Docking." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/496um4.

Повний текст джерела

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>102<br>With the growing appreciation of the advantages of cross-docking technique in literature as well as in practice in the field of supply chain management and with the advances of numerous applications in vehicle routing problem across broad range of practical context, present an opportunity to explore the open vehicle routing problem with cross-docking (OVRPCD). In retail for example; capital expenditure necessary in vehicle acquisition and other delivery-related fixed assets can be a burden for the retailer, then outsourcing logistical service can be a cost-eff

Стилі APA, Harvard, Vancouver, ISO та ін.

29

SHEN, SHU-AN, and 沈書安. "Solving The Open Vehicle Routing Problem By Ant Colony Optimization." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/ss49q7.

Повний текст джерела

Анотація:

碩士<br>國立高雄第一科技大學<br>運籌管理系碩士班<br>105<br>The purpose of this study is to investigate the Open Vehicle Routing Problem (OVRP), which is different than the conventional vehicle routing problem that the vehicles are not required to return to the depot. The focus of this research is slightly different than the original OVRP in which the vehicles are departing from their home company and end at a collection site. The objectives of this study is to find the best vehicle deployment of each home company and the dispatching plan with least cost. Two cases of this kind of OVRP are defined and studied, cas

Стилі APA, Harvard, Vancouver, ISO та ін.

30

楊禮瑛. "Particle swarm optimization algorithms for the open vehicle routing problem." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/74853641796586654630.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Teng, Chuan-Pin, and 鄧全斌. "An Iterated Local Search heuristic for the Close-Open Mixed Vehicle Routing Problem." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/52078168528778481418.

Повний текст джерела

Анотація:

碩士<br>國立交通大學<br>運輸與物流管理學系<br>103<br>The Close-Open Mixed Vehicle Routing Problem (COMVRP) is a variant of the conventional Vehicle Routing Problem (VRP). Consider the case when the private car of company is insufficient. In order to meet the demand of customer, the company can use external collaborative carrier to serve its customer. COMVRP is more suitable for the work of logistics distribution, but there was just a little study on COMVRP. Therefore, we are going to develop an Iterated Local Search (ILS) Metaheuristic to solve COMVRP. First, we use Node Insertion Route Addition (NIRA) to buil

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Lin, Yun-han, and 林韵函. "A particle swarm optimization for the open vehicle routing problem with time windows." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/70777313684326246549.

Повний текст джерела

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>100<br>This research considers the open vehicle routing problem with time windows (OVRPTW), a new variant of the well-known vehicle routing problem (VRP) and an extension of the vehicle routing problem with time windows (VRPTW). The objective of this study is to describe the problem and develop an effective algorithm for solving the problem. VPR as well as VRPTW belong to the class of NP-hard problem. When the problem scale gets larger, the difficulty and time for finding an optimum solution also increase. Therefore, heuristic algorithms are often developed for solvi

Стилі APA, Harvard, Vancouver, ISO та ін.

33

LIN, SHU-YI, and 林書翊. "Solving the Open Vehicle Routing Problem with Stochastic Demand by Ant Colony Optimization." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/y4z34y.

Повний текст джерела

Анотація:

碩士<br>國立高雄科技大學<br>運籌管理系<br>107<br>This study focuses on the Open Vehicle Routing Problem with Stochastic Demand (OVRPSD). OVRP generally occurs when a company hires a fleet or entrusts a distribution business to a third-party logistics providers. The vehicle departs from the station. After the delivery, it ends at a customer point. The customer's demand belongs to the Random Variable, and it is now possible to know the customer's demand. Therefore, it is possible that the vehicle capacity is insufficient during the journey and it is closer to the real life situation. The open vehicle routing p

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Hsiung, Lai Chun, and 賴俊雄. "A Coordinate Representation Particle Swarm Optimization for Solving Open Vehicle Routing Problem with Time Windows and Dedicated Destination." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/85395644949919598951.

Повний текст джерела

Анотація:

碩士<br>東海大學<br>工業工程與經營資訊學系<br>103<br>Nowadays, whether supplier or manufacturer, the logistics and distribution operation is a key of success in the global supply chain. And with the rapid development of electronic commerce recently, how to achieve the on-time delivery is the main target for e-business. Therefore, more and more e-business or enterprises without logistic system are outsourcing logistics that is not core competencies to 3PL. This paper proposes the open vehicle routing problem with time windows (OVRPTW) considering the feature of third party logistics (3PL). In the typical OVRPTW

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Lu, Yu-An, and 呂祐安. "Solving Capacitated Open Vehicle Routing Problem by Hybridization of Particle Swarm Optimization Algorithm and Loop 2-OPT Technique." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/t2prs2.

Повний текст джерела

Анотація:

碩士<br>國立屏東科技大學<br>資訊管理系所<br>105<br>The concept of Vehicle Routing Problem (VRP) first appears in military logistics to solve the transmission of information and supplies in battlefield. It had become research interests to the experts and scholars afterwards. The Capacitated Open Vehicle Routing Problem (COVRP) is an extension of VRP; it has provided companies deal with logistics and transportation, reducing the huge cost in vehicles, labor and time during these years. Based on the Particle Swarm Optimization, this thesis adopts the “multi-directional search strategy” to improve search capabili

Стилі APA, Harvard, Vancouver, ISO та ін.

36

"The probabilistic vehicle routing problem." Sloan School of Management, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/2215.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Hsin, I.-Tar, and 辛怡達. "Vehicle Routing Problem of Speedpost." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/51614725638930239446.

Повний текст джерела

Анотація:

碩士<br>國立成功大學<br>交通管理學系<br>89<br>Shippers respect efficiency and security of delivery process due to fast speed of economic development and increasing of GNP. Since 1973,the international express corporations entered the international express service market in Taiwan. Until 1984,the local companies provided domestic express service, the amount of cargo increased rapidly.Because of the huge market and the competitors joined the industry,the carriers rose the level of service quality in order to increase the rate of occupancy by providing checking cargo present situation,improving security of goo

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Shen, Siang, and 沈祥. "Vehicle Routing Problem with Refueling." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/27317448877232255375.

Повний текст джерела

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>98<br>Abstract This research considers the vehicle routing problem with refueling (VRPR), a new variant of the well-known vehicle routing problem (VRP). The objectives of this study are clearly defining the problem, constructing a mathematical programming model for the problem, and developing an effective heuristic algorithm for solving the problem. Since VRP belongs to the class of NP-hard problems, it is difficult to find an optimal solution for the problem, except for small-scale instances. Therefore, medium- and large-scale instances are often tackled by heuristi

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Zou, Yu-cyuan, and 鄒育銓. "Adjustable Compartments Vehicle Routing Problem." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/72919113235110335588.

Повний текст джерела

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>98<br>Cold logistics and oil distributers often use special vehicles with multiple compartments to ship different products to customers. This special transportation mode results in a new type of vehicle routing problem, namely the multi-compartment vehicle routing problem (MC-VRP). In practice, some of these carriers adopted vehicles with adjustable compartments to further reduce transportation costs. Therefore, in this research, we extended the MC-VRP and defined the adjustable compartments vehicle routing problem (AC-VRP). We also developed a mathmatical programmin

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Goel, Asvin, and Volker Gruhn. "A General Vehicle Routing Problem." 2008. https://ul.qucosa.de/id/qucosa%3A32732.

Повний текст джерела

Анотація:

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 f

Стилі APA, Harvard, Vancouver, ISO та ін.

41

"SavingsAnts for the vehicle routing problem." SFB Adaptive Information Systems and Modelling in Economics and Management Science, 2001. http://epub.wu-wien.ac.at/dyn/dl/wp/epub-wu-01_1f1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Tu, Huei-Min, and 涂慧敏. "Investigations for Period Vehicle Routing Problem." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/30375977095131014555.

Повний текст джерела

Анотація:

碩士<br>大同大學<br>資訊經營學系(所)<br>93<br>The Period Vehicle Routing Problem (PVRP) is a distribution problem about designing vehicle routes to serve those customers, which are assigned to that day over a short planning period. The objective is to minimize the cost of distribution over the period. How to determine the acceptable solutions in very short time is an important issue. In the first phase we investigated one method to determine a choice of delivery day combinations for customers. First, we formed the ordering of the customers, and then we assigned each customer along the order. According to t

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Chen, Jyh-Feng, and 陳志峰. "Vehicle Routing Problem with Multiple Tours." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/69449411942796532238.

Повний текст джерела

Анотація:

碩士<br>國立成功大學<br>交通管理(科學)學系<br>84<br>The static vehicle routing problem is to determine vehicle tours to minimizethe overall delivery cost while meeting customer demand, service time windowsand vehicle capacity restrictions. Typically, it can be classified into groupsby the number of depots, homogenous or heterogeneous fleets, with or withouttime windows, ect. However, disregarding the type of problems, they all sharethe same basic characteristics, which include one vehicle serves one ro

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Yu, Shau-Chiang, and 游紹強. "Static Vehicle Routing Problem for Logistics." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/56177180886980436902.

Повний текст джерела

Анотація:

碩士<br>萬能科技大學<br>經營管理研究所<br>96<br>As economic globalization and the globalization of markets development, and the invention of the Internet and applications, many of the traditional stores have begun to place the goods for customer by the way of the Internet. The bought goods from sellers then directly sent to the purchaser. This customer’s expense pattern leads a lot of e-commerce websites cooperating with famous logistics company at present. They serve the goods directly to meet the general people demand by delivering the goods. Due to development of the information technology and fieriness o

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Ho, Tsai-Wei, and 何采維. "Vehicle Routing Problem with Parcel Lockers." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/745vh9.

Повний текст джерела

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>106<br>Due to the booming of e-commerce, city logistics faces new challenges. Consumers use the e-commerce platform to order goods, and receive goods by home delivery or convenience store pick-up, thus extending the last mile delivery problem. The last mile delivery problem refers to the delivery process of delivering goods from the supplier to the consumer. This process is the bottleneck of the e-commerce supply chain. The logistics industry often needs to bear the secondary distribution cost caused by customers’ no-show. The parcel lockers system is one of the solu

Стилі APA, Harvard, Vancouver, ISO та ін.

46

CHUANG, CHIA-YU, and 莊佳瑀. "Solving Large Scale Vehicle Routing Problem." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/bk6v45.

Повний текст джерела

Анотація:

碩士<br>國立高雄科技大學<br>運籌管理系<br>107<br>The purpose of searching focuses on solving Large Scale Vehicle Routing Problem (LSVRP).There are lots of related literature researches in the past;however,the number of customers with tranditional vehicle routing problem is less then two hundred which are not enough to satisfy the real situations.According to the actual considerations,the purpose mainly focuses on large number of customers which are more than two hundred using 18 basic examples made by Golden. This research solving the problem by using the Ant Colony Optimization (ACO) and the Divide and Con

Стилі APA, Harvard, Vancouver, ISO та ін.

47

JAKHAR, SACHIN. "VEHICLE ROUTING PROBLEM WITH CAPACITY CONSTRAINT." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14945.

Повний текст джерела

Анотація:

In wireless network based fourth generation communication system has played vital role for exchanging the information to the user on movement of mobile node.Wireless network may be broadly classified as homogeneous and heterogeneous. Wireless Homogeneous Network set consist of identical network containing same set of attributes , whereas, heterogeneous consist of dissimilar network containing different kinds of attributes. For examples new access technologies are such as IEEE 802.11(Wi-Fi Network), IEEE 802.16 (Wi-Max.), Bluetooth etc. Wireless LANs are changing the way of communication

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Levy, David. "Multiple Vehicle Routing Problem with Fuel Constraints." Thesis, 2013. http://hdl.handle.net/1969.1/151093.

Повний текст джерела

Анотація:

In this paper, a Multiple Vehicle Routing Problem with Fuel Constraints (MVRPFC) is considered. This problem consists of a field of targets to be visited, and a collection of vehicles with fuel tanks that may visit the targets. Consideration of this problem is mainly in the improvement of feasible solutions, but the following steps are discussed: Cost Matrix Transformation, Field Partitioning, Tour Generation and Rerouting, and Tour Improvement. Four neighborhoods were investigated (2-opt, 3-opt, Target Vehicle Exchange, Depot Exchange), using the Variable Neighborhood Descent and Variable Ne

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Yi, Te-Hua, and 易德華. "Vehicle Routing Problem with Soft Time Winndows." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/51075380471819590438.

Повний текст джерела

Анотація:

碩士<br>國立中央大學<br>土木工程學系<br>86<br>Coming along With the convergence of product transportation and marketing, this thesis focuses upon how to distribute products "effectively" and "efficiently". With the fast growth in economy and technology, the product transportation business wants to boost its edge and market sharing. As the customers would request higher standard of service from the distribution center, the next issue will be the request mentioned above and v

Стилі APA, Harvard, Vancouver, ISO та ін.

50

ZHUANG, ZHI-LIANG, and 莊志諒. "A new algorithms of vehicle routing problem." Thesis, 1988. http://ndltd.ncl.edu.tw/handle/75268204802428005560.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!