Увійти

Готові списки джерел за темами / Simultaneously Pickup and Delivery / Дисертації

Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Simultaneously Pickup and Delivery.

Дисертації з теми "Simultaneously Pickup and Delivery"

Автор: Grafiati

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

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

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

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

Ознайомтеся з топ-50 дисертацій для дослідження на тему "Simultaneously Pickup and Delivery".

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

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

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

1

Mourdjis, Philip James. "The pickup and multiple delivery problem." Thesis, University of York, 2016. http://etheses.whiterose.ac.uk/18582/.

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

Анотація:

This thesis presents my work on the pickup and multiple delivery problem, a real-world vehicle routing and scheduling problem with soft time windows, working time and last-in-first-out constraints, developed in collaboration with Transfaction Ltd., who conduct logistics analysis for several large retailers in the UK. A summary of relevant background literature is presented highlighting where my research fits into and contributes to the broader academic landscape. I present a detailed model of the problem and thoroughly analyse a case-study data set, obtaining distributions used for further res

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

2

Krypczyk, Veikko. "Nachbarschaftssucheverfahren für dynamische Pickup- und Delivery-Probleme." Hagen Fernuniversität Hagen, 2010. http://d-nb.info/1001671643/34.

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

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

3

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.

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

Анотація:

Mestrado em Decisão Económica e Empresarial<br>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 ú

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

4

Nowak, Maciek A. "The Pickup and Delivery Problem with Split Loads." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.

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

Анотація:

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 res

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

5

Coltin, Brian. "Multi-Agent Pickup And Delivery Planning With Transfers." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/376.

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

Анотація:

In Pickup and Delivery Problems (PDPs), mobile vehicles retrieve and deliver a set of items. The PDP is a well-studied, NP-hard problem. Examples of the PDP include mail and courier services, taxis, ridesharing services, and robots such as our own CoBots and CreBots, which retrieve and deliver items for the occupants of a building, and are the motivation for this thesis. The goal of the PDP is to find a schedule that delivers as many items as possible at the lowest cost, under various constraints such as time windows and vehicle capacities. We augment the PDP with transfers to form the PDP wit

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

6

Capelle, Nuño Thomas Emmanuel. "Problema de localización y ruteo con pickup y delivery." Tesis, Universidad de Chile, 2012. http://www.repositorio.uchile.cl/handle/2250/113031.

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

Анотація:

Magíster en Ciencias de la Ingeniería, Mención Transporte<br>Ingeniero Civil Matemático<br>El objetivo de esta tesis es formular un modelo que integre el Pickup and Delivery Problem (PDP) y la localización óptima de los depots de distribución, el cual llamaremos Problema de Localización y Ruteo con Pickup and Delivery (PLRPDP). Este problema se plantea y tiene una gran variedad de aplicaciones en la industria, como por ejemplo en el courier, en el transporte de pasajeros, o en el transporte de alimentos perecibles, y por lo tanto es de suma importancia cuando existe un sistema de alta demanda

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

7

Krypczyk, Veikko [Verfasser]. "Nachbarschaftssucheverfahren für dynamische Pickup- und Delivery-Probleme / Veikko Krypczyk." Hagen : Fernuniversität Hagen, 2010. http://d-nb.info/1001671643/34.

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

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

8

Aleksandrov, Martin Damyanov. "Heuristics and policies for online pickup and delivery problems." Master's thesis, Faculdade de Ciências e Tecnologia, 2012. http://hdl.handle.net/10362/8197.

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

Анотація:

Master Thesis<br>In the last few decades, increased attention has been dedicated to a speci c subclass of Vehicle Routing Problems due to its signi cant importance in several transportation areas such as taxi companies, courier companies, transportation of people, organ transportation, etc. These problems are characterized by their dynamicity as the demands are, in general, unknown in advance and the corresponding locations are paired. This thesis addresses a version of such Dynamic Pickup and Delivery Problems, motivated by a problem arisen in an Australian courier company, which operates in

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

9

Nakao, Yoshitaka. "Studies on Algorithms and Analyses for Pickup and Delivery Problems." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/108367.

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

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

10

Männel, Dirk [Verfasser]. "Das Pickup and Delivery Problem mit mehrdimensionalen Ladebeschränkungen / Dirk Männel." Magdeburg : Universitätsbibliothek, 2018. http://d-nb.info/1165650460/34.

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

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

11

Chaichiratikul, Pairoj. "Hybrid metaheuristics for solving multi-depot pickup and delivery problems." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/30647.

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

Анотація:

In today's logistics businesses, increasing petrol prices, fierce competition, dynamic business environments and volume volatility put pressure on logistics service providers (LSPs) or third party logistics providers (3PLs) to be efficient, differentiated, adaptive, and horizontally collaborative in order to survive and remain competitive. In this climate, efficient computerised-decision support tools play an essential role. Especially, for freight transportation, e efficiently solving a Pickup and Delivery Problem (PDP) and its variants by an optimisation engine is the core capability require

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

12

Doerner, Karl, Richard F. Hartl, and Marc Reimann. "Ant colony optimization applied to the pickup and delivery problem." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/1434/1/document.pdf.

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

Анотація:

In this paper we propose an ACO algorithm to optimize the total costs associated with the pickup and delivery of full truckloads under time window constraints in a hub network. We perform a thorough technical analysis of the ACO by comparing different pheromone decoding schemes, different visibility information and various population sizes. Furthermore we propose a post-optimization technique to improve the solutions. Our results show that appropriate data structures significantly improve the solution quality.<br>Series: Working Papers SFB "Adaptive Information Systems and Modelling in Economi

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

13

Rahmani, Younes. "The Multi-product Location-Routing Problem with Pickup and Delivery." Thesis, Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331/document.

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

Анотація:

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 durabl

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

14

Rahmani, Younes. "The Multi-product Location-Routing Problem with Pickup and Delivery." Electronic Thesis or Diss., Université de Lorraine, 2015. http://www.theses.fr/2015LORR0331.

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

Анотація:

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 durabl

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

15

Wohlgemuth, Sascha. "Traffic information and dynamic pickup and delivery planning in forwarding agencies." Dortmund Verl. Praxiswissen, 2010. http://d-nb.info/100080853X/04.

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

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

16

Nguyen, John, and Kasper Lindén. "Creating a Back Stock to Increase Order Delivery and Pickup Availability." Thesis, KTH, Hälsoinformatik och logistik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252798.

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

Анотація:

Apotek Hjärtat wants to keep developing their e-commerce website and improve retrieval and delivery of orders to customers. Click and Collect and Click and Express are two options for retrieving e-commerce orders that are available if all products in the order are present in the store. By implementing a back stock in the stores with popular e-commercial items, all products of an order will more often be present in the store. The back stock will in such a way increase the availability of Click and Collect and Click and Express. The goals for the study are to conduct a pilot study, compare metho

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

17

Hosny, Manar Ibrahim. "Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems." Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/55181/.

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

Анотація:

The development of effective decision support tools that can be adopted in the transportation industry is vital in the world we live in today, since it can lead to substantial cost reduction and efficient resource consumption. Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a

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

18

Chuah, Keng Hoo. "OPTIMIZATION AND SIMULATION OF JUST-IN-TIME SUPPLY PICKUP AND DELIVERY SYSTEMS." UKnowledge, 2004. http://uknowledge.uky.edu/gradschool_diss/384.

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

Анотація:

A just-in-time supply pickup and delivery system (JSS) manages the logistic operations between a manufacturing plant and its suppliers by controlling the sequence, timing, and frequency of container pickups and parts deliveries, thereby coordinating internal conveyance, external conveyance, and the operation of cross-docking facilities. The system is important to just-in-time production lines that maintain small inventories. This research studies the logistics, supply chain, and production control of JSS. First, a new meta-heuristics approach (taboo search) is developed to solve a general freq

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

19

PACHECO, TONI TIAGO DA SILVA. "EFFICIENT LARGE NEIGHBORHOOD SEARCHES FOR THE TRAVELING SALESMAN PROBLEM WITH PICKUP AND DELIVERY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35781@1.

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

Анотація:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>Em vários problemas de distribuição e logística, os produtos devem ser coletados em uma origem e entregues em um destino. Exemplos incluem o transporte de pessoas com deficiência, serviços de correio expresso, logística de suprimentos médicos, etc. O problema de roteamento abordado neste trabalho, conhecido como Traveling Salesman Problem with Pickup and Delivery (TSPPD), é da classe de problemas do caixeiro viajante com restrições de precedê

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

20

O'Neil, Ryan James. "Exact Methods for Solving Single-Vehicle Pickup and Delivery Problems in Real Time." Thesis, George Mason University, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10980880.

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

Анотація:

<p> The Traveling Salesman Problem with Pickup and Delivery (TSPPD) describes the problem of finding a minimum cost path in which pickups precede their associated deliveries. The TSPPD is particularly important in the growing field of Dynamic Pickup and Delivery Problems (DPDP). These include the many-to-many Dial-A-Ride Problems (DARP) of companies such as Uber and Lyft, and the Meal Delivery Routing Problem (MDRP) of Grubhub. We examine exact methods for solving TSPPDs where orders from different pickup locations can be carried simultaneously. Our interest lies in solving such problems for r

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

21

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.

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

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

22

Roesch, Robert Steven. "Transportation Service Provider Collaboration Problem: Potential Benefits and Solution Approaches." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/84897.

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

Анотація:

Truck-based freight transportation continues to play a vital role in the delivery of goods in the United States. Despite its size and importance, the truck transportation industry continues to struggle with fulfilling transportation requests in an efficient and sustainable manner. One potential solution to alleviate many of the current truck industry problems is for transportation service providers (TSPs) to collaborate by sharing volume, resources, and facilities. This research introduces the Transportation Service Provider Collaboration Problem (TSP-CP) to demonstrate the benefits of usin

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

23

Andersson, Tomas. "A Comparative Study on a Dynamic Pickup and Delivery Problem : Improving routing and order assignment in same-day courier operations." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-303131.

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

Анотація:

Pickup and Delivery Problems (PDPs) constitute a class of Vehicle Routing Problems (VRPs) consisting of finding the optimal routes for a fleet of vehicles to deliver requests from a set of origin locations to a corresponding set of destinations. PDPs are NP-hard and have a wide variety of variants and potential constraints. This thesis evaluates methods for solving a dynamic single- vehicle PDP restricted by multiple time-related constraints. The problem is dynamic in the sense that new requests arrive as time is simulated and inserted into the vehicle’s pickup and delivery plan as it is being

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

24

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.

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

Анотація:

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 t

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

25

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.

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

Анотація:

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ísti

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

26

Flynn, Lynne Marie. "The development and application of a pressure delivery procedure to simultaneously assess plantar pressure and endothelial function in the diabetic foot." Thesis, University of Dundee, 2014. https://discovery.dundee.ac.uk/en/studentTheses/d82a1f4e-225f-44fe-92bb-3cdd8af3cfba.

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

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

27

Li, Jun. "Autonomous Mobile Lockers (AMLs) for City Logistics." Thesis, The University of Sydney, 2022. https://hdl.handle.net/2123/29359.

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

Анотація:

This study introduces Autonomous Mobile Lockers (AMLs) into the current city logistics network. This new pickup and delivery technology can solve several problems, such as a shortage of parking places in the CBD area, traffic congestion on the roads, the high cost of depot rent, and transportation costs. In the traditional parcel logistics network, couriers perform direct tours to customers to collect and deliver parcels, and at the end of each tour, they need to bring the collected parcels to a designated depot to join the transfer to the hub. The proposed system consists of couriers working

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

28

Palmgren, Myrna. "Optimal Truck Scheduling : Mathematical Modeling and Solution by the Column Generation Principle." Doctoral thesis, Linköping : Linköpings universitet, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3590.

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

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

29

Bsaybes, Sahar. "Models and algorithms for fleet management of autonomous vehicles." Thesis, Université Clermont Auvergne‎ (2017-2020), 2017. http://www.theses.fr/2017CLFAC114/document.

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

Анотація:

Résumé indisponible<br>The VIPAFLEET project aims at developing a framework to manage a fleet of IndividualPublic Autonomous Vehicles (VIPA). We consider a fleet of cars distributed at specifiedstations in an industrial area to supply internal transportation, where the cars can beused in different modes of circulation (tram mode, elevator mode, taxi mode). The goalis to develop and implement suitable algorithms for each mode in order to satisfy all therequests either under an economic point aspect or under a quality of service aspect, thisby varying the studied objective functions.We model the

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

30

Demir, Erdem. "Analysis Of Evolutionary Algorithms For Constrained Routing Problems." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605083/index.pdf.

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

Анотація:

This study focuses on two types of routing problems based on standard Traveling Salesman Problem, which are TSP with pickup and delivery (TSPPD) and TSP with backhauls (TSPB). In both of these problems, there are two types of customers, i.e. &ldquo<br>delivery customers&rdquo<br>demanding goods from depot and &ldquo<br>pickup customers&rdquo<br>sending goods to depot. The objective is to minimize the cost of the tour that visits every customer once without violating the side constraints. In TSPB, delivery customers should precede the pickup customers, whereas the vehicle capacity should not

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

31

Goraieb, Elias. "Busca tabu aplicada ao problema de roteamento de veiculos com coleta e entrega." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259933.

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

Анотація:

Orientador: Vinicius Amaral Armentano<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-06T12:38:24Z (GMT). No. of bitstreams: 1 Goraieb_Elias_M.pdf: 21259035 bytes, checksum: 5e5d4e69c800350a20727695a2f33647 (MD5) Previous issue date: 2005<br>Resumo: Este trabalho aborda o problema de roteamento de veículos com coleta e entrega, visando à minimização do número de veículos utilizado e a distância total percorrida. O pedido de serviço é atendido por um veículo na janela de tempo imposta pelo c

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

32

Namboothiri, Rajeev. "Planning Container Drayage Operations at Congested Seaports." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11482.

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

Анотація:

This dissertation considers daily operations management for a fleet of trucks providing container pickup and delivery service to a port. Truck congestion at access points for ports may lead to serious inefficiencies in drayage operations, and the resultant cost impact to the intermodal supply chain can be significant. Recognizing that port congestion is likely to continue to be a major problem for drayage operations given the growing volume of international containerized trade, this research seeks to develop optimization approaches for maximizing the productivity of drayage firms operating at

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

33

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.

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

Анотація:

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 si

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

34

Anil, Vijay Sankar. "Mission-based Design Space Exploration and Traffic-in-the-Loop Simulation for a Range-Extended Plug-in Hybrid Delivery Vehicle." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1587663664531601.

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

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

35

Dostalíková, Lucie. "Okružní problém s vyzvednutím a doručením, případová studie." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-3692.

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

Анотація:

Diplomová práce se zabývá analýzou a výpočtem optimalizační úlohy z praxe. Jedná se o optimalizaci nočních linek vnitrostátní přepravy na území ČR. Cílem je nalezení řešení, které zefektivní organizaci těchto linek a usnadní práci lidí s nimi spojenou. Celý výpočet úlohy je inspirován okružním problémem s doručením a vyzvednutím (?Pickup and Delivery Problem?). Na výpočet problému jsou použity dva modely: model založený na hledání optimálního více produktového toku a model spočívající na výběru tras. Modely jsou založeny na rozdílných přístupech. Díky oběma modelům je možné si uvědomit, že na

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

36

Grimault, Axel. "Optimisation de tournées de camions complets dans le secteur des travaux publics." Thesis, Nantes, Ecole des Mines, 2016. http://www.theses.fr/2016EMNA0222/document.

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

Анотація:

Le transport de matériaux pour la réalisation d’infrastructures routières et le terrassement représente, en 2013, plus de la moitié de l’activité du secteur des travaux publics. Les méthodes d’optimisation de tournées de véhicules permettent aujourd’hui de résoudre des problèmes de grandes tailles en intégrant les contraintes liées au métier. Dans cette thèse, nous nous intéressons à la résolution du problème riche de collectes et livraisons en camions complets avec des contraintes de synchronisation sur les ressources. Dans un premier temps, nous résolvons le problème de tournées de véhicules

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

37

Chou, Shi-Ming, and 邱仕銘. "A Study for Vehicle Routing Problem with Simultaneously Delivery and Pickup with Time Windows." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/01852965935726308653.

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

Анотація:

碩士<br>長榮大學<br>經營管理研究所<br>95<br>In many practical conditions, the vehicle is often required to simultaneously drop off goods and pick up goods at the same customers. Customers usually have the requirements of both deliveries and pickups. The study supposes that customers have the requirements of both deliveries and pickups at the same time. This will be under the limitation of the capacity of the vehicle and the time of serving customers should be in the defined time window to make the vehicle finish the serving in the lowest cost. In addition, the study also discusses the situation that vehi

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

38

Yeh, Yu-Hsuan, and 葉雨璇. "Simultaneous Pickup and Delivery Problem with Parcel Lockers." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/68hrn7.

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

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>107<br>In the past three decades, E-commerce market has developed rapidly. Urban logistics has become an enabler of E-commerce development which led to the importance of last mile delivery efficiency. As customers expect timely and accurate delivery of online shopping purchase, this brings new challenges for last mile delivery. In a case when the goods are delivered to the customers but are not received, the goods must be carried back to the warehouse, stored; and in effect, accrues an additional cost. To deal with this problem, parcel lockers systems and convenient

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

39

Li, Ying-Feng, and 李盈鋒. "A Study of Rush Hour for Vehicle Routing Problem with Simultaneously Delivery and Pickup with Time Windows." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/06524902302420091254.

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

Анотація:

碩士<br>雲林科技大學<br>全球運籌管理研究所碩士班<br>98<br>This study considers rush hour of Vehicle Routing Problem with Simultaneously Delivery and Pick-up with Time Window. We try to plan the vehicle routes and minimize the transportation cost in considering rush hour in VRPSDPTW. First, we construct the mathematical programming model. Second, we construct a heuristic algorithm by Tabu Search to search for optimal cost in this problem and analyze the result. Third, we use sensitivity analysis to get important factors to know how to affect the total transportation cost. Numerical examples indicated that we consi

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

40

Kao, Shih-Chang, and 高世昌. "Multi-Depot Vehicle Routing Problem with Simultaneous Delivery and Pickup Points." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/f98baw.

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

Анотація:

碩士<br>逢甲大學<br>工業工程學所<br>90<br>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 ret

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

41

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.

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

Анотація:

碩士<br>國立雲林科技大學<br>工業工程與管理研究所碩士班<br>101<br>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 o

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

42

Cheng, Yan-Ru, and 鄭雁嬬. "Applying Hybrid Algorithm to the Vehicle Routing Problem with Simultaneous Delivery and Pickup." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/80282134649605936945.

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

Анотація:

碩士<br>元智大學<br>工業工程與管理學系<br>97<br>Distribution cost accounts for the large percentage of total cost in logistics activities. The combination of fair time, right vehicles, and right routing can cut down the total cost and ensure the delivery to the customers. Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP) is a variation of classical Vehicle Routing Problems (VRP). Under the limit of visiting once for demand points, the VRPSDP can do delivery and pickup as the same time. The purpose of this study was to adopt the Savings Method and hybrid algorithm based on Particle Sw

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

43

Huang, Mei-Chen, and 黃玫珍. "Applying Harmony Search to the Traveling Salesman Problem with Simultaneous Pickup and Delivery." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/09893635835041333778.

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

Анотація:

碩士<br>元智大學<br>工業工程與管理學系<br>98<br>Nowadays, as the increasing demand in the logistics industry, logistics operations play an important role in the logistics system. Distribution cost accounts for the large percentage of total cost in logistics activities. Hence, a well designed path planning can reduce the transportation cost. Under the limit of just visiting once for demand points, the pickup and delivery simultaneously can avoid unnecessary waste of time and cost. This study aims to combine the Harmony Search (HS) and the 2-Opt local search (2-Opt LS) to solve the Traveling Salesman Probl

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

44

Lin, Shin-Yu, and 林信宇. "A simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/16296136020264119580.

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

Анотація:

碩士<br>國立臺灣科技大學<br>工業管理系<br>101<br>This study proposes a simulated annealing (SA) heuristic for the location routing problem with simultaneous pickup and delivery (LRPSPD). How to recycle and reuse used products has become an important issue in supply chain management, and thus the LRPSPD has received much attention from the industry and researchers recently. The LRPSPD considers the distribution of parts and new products, the collection of recycled products and products to be repaired, and the locations of facilities. In such a distribution network, each customer has both pickup and delivery d

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

45

Chou, Wei-Li, and 周偉禮. "A Heuristic Algorithm for Single Depot Vehicle Routing Problem with Simultaneous Pickup and Delivery." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/32375041650741660079.

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

Анотація:

碩士<br>國立臺灣海洋大學<br>航運管理學系<br>94<br>How to efficiently delivery goods to customers from a depot is a daily and an important decision for the logistics managers, because the transportation cost accounts for a large portion of the distribution cost. Furthermore, the speed of delivery is also an indispensable element of a sound logistics system. A single-depot vehicle routing problem with simultaneous pickup and delivery is studied in this thesis. Since the complexity of vehicle routing problem is NP hard, it is impossible to solve this type of problem within a reasonable time with a mathematical m

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

46

Wu, Rong-Rong, and 吳榮榮. "Artificial Intelligence Approaches for the Periodic Vehicle Routing Problem with Simultaneous Delivery and Pickup." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/563c88.

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

Анотація:

碩士<br>國立虎尾科技大學<br>工業管理系工業工程與管理碩士班<br>104<br>The goal of logistics is to deliver goods to customers efficiently. This thesis explored the periodic vehicle routing problem with simultaneous delivery and pickup. This problem is also an extension of the vehicle routing problem with simultaneous pickup and delivery. The main difference is that this study assumes the periodic demand quantity and receipt quantity for each point. In this thesis, we have studied four types of periodic demand quantity and receipt quantity for points, namely, (1) pickup quantity =delivery quantity for all points, (2) pic

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

47

HUNG, WEI-TE, and 洪維德. "A Study of Inventory Routing Problem with Simultaneous Pickup and Delivery in Fresh Distribution Consideration." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/ba3nrd.

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

Анотація:

碩士<br>國立雲林科技大學<br>工業工程與管理系<br>106<br>Inventory Route Problems (IRPs) can be considered as an extending application of Vehicle Routing Problems (VRPs). In general, IRPs considers the factors of inventory management. Decision makers have to arrange not only the route but also when and how much to delivery. In order to save the inventory cost and increase the times of distribution would multiply the transportation cost. In the other hand, to decrease the transportation cost and delivery amount of goods in one time would cause the raising of the inventory cost. Consequently, through the accurate w

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

48

Hsu, Wen-Hsuan, and 許文軒. "A Decision Support System of Inventory Routing Problem with Simultaneous Pickup and Delivery Concerning Carbon Footprint." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/32944597614297643969.

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

Анотація:

碩士<br>龍華科技大學<br>資訊管理系碩士班<br>103<br>Most literatures of Inventory-Routing problems find the solutions by simulation, rather than solve the real case problem of logistics firms. Furthermore, few of them consider pickup and delivery problems at the same time. A green logistic issue is also incorporated into the model by considering the interrelationship between the transportation cost and the greenhouse gas emission level. Therefore, this research applies a real publishing logistics firm’s operating data to study the Inventory-Routing problem with simultaneous pickup and delivery concerninig carb

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

49

Gao, Shih-Jie, and 高識傑. "A Web Logistics Distribution Decision Support Systems for Green Inventory Routing Problem with Simultaneous Pickup and Delivery." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/qu846f.

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

Анотація:

碩士<br>龍華科技大學<br>資訊管理系碩士班<br>106<br>Most publishing logistics firms in Taiwan decide their distributed routes by considering the inventory related cost and transportation cost independently based on their past intuitive experiences. In fact, by concerning both of them, it is more likely to plan the delivered routes economically and efficiently. Due to the increasing environmental concern by the whole world, this total inventorty routing cost better accounts for Greenhouse gas emission cost regarding global warming. Most literatures of Inventory-Routing problems find the solutions by simulation,

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

50

He, Jiun-De, and 何俊德. "A Study of Inventory Routing Problem with Simultaneous Pickup and Delivery for the Distribution System by Applying Hybrid ImmunityTabu Search Algorithm." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/04913715281153259421.

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

Анотація:

碩士<br>龍華科技大學<br>資訊管理系碩士班<br>100<br>Most literatures of Inventory-Routing problems find the solutions by simulation, rather than solve the real case problem of logistics firms. Furthermore, few of them consider pickup and delivery problems at the same time. Therefore, this research applies a real publishing logistics firm’s operating data to study the Inventory-Routing problem with simultaneous pickup and delivery (IRPSPD). We first develop a mathematical model for this proposed Inventory-Routing problem with simultaneous pickup and delivery (IRPSPD), then apply Savings method, 2-opt heuristic

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

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