Publications
Detailed Information
Traveling Salesman Problem with a Drone Station
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 문일경 | - |
dc.contributor.author | 김성우 | - |
dc.date.accessioned | 2018-05-29T03:21:16Z | - |
dc.date.available | 2021-04-13T02:21:52Z | - |
dc.date.issued | 2018-02 | - |
dc.identifier.other | 000000149710 | - |
dc.identifier.uri | https://hdl.handle.net/10371/141445 | - |
dc.description | 학위논문 (석사)-- 서울대학교 대학원 : 공과대학 산업공학과, 2018. 2. 문일경. | - |
dc.description.abstract | The importance of drone delivery services is increasing. However, the operational aspects of drone delivery services have not been studied extensively. Specifically, with respect to truck-drone systems, researchers have not given sufficient attention to drone facilities because of the limited drone flight range around a distribution center. In this paper, we propose a truck-drone system to overcome the flight-range limitation. We define a drone station as the facility where drones and charging devices are stored, usually far away from the package distribution center. The traveling salesman problem with a drone station (TSP-DS) is developed based on mixed integer programming. Fundamental features of the TSP-DS are analyzed and route distortion is defined. We show that the model can be divided into independent traveling salesman and parallel identical machine scheduling problems for which we derive two solution approaches. Computational experiments with randomly generated instances show the characteristics of the TSP-DS and suggest that our decomposition approaches effectively deal with TSP-DS complexity problems. | - |
dc.description.tableofcontents | Chapter 1. Introduction 1
Chapter 2. Literature Review 5 Chapter 3. Truck-drone routing Problem 9 3.1 Notation 10 3.2 Mathematical formulation 12 Chapter 4. Fundamental Features of the TSP-DS 14 4.1 Route distortion 14 4.2 Condition for the elimination of route distortion 18 4.3 Decomposition of the TSP-DS 20 Chapter 5. Computational Experiments 24 5.1 Computation times 25 5.2 Comparison between the TSP-DS and TSP 28 5.3 Number of drones in a drone station 30 5.4 Discussion 32 Chapter 6. Conclusions 33 References 35 초록 40 | - |
dc.format | application/pdf | - |
dc.format.extent | 670077 bytes | - |
dc.format.medium | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | 서울대학교 대학원 | - |
dc.subject | Drone delivery | - |
dc.subject | Truck-drone service | - |
dc.subject | Drone station | - |
dc.subject | Mixed integer programming | - |
dc.subject.ddc | 670.42 | - |
dc.title | Traveling Salesman Problem with a Drone Station | - |
dc.type | Thesis | - |
dc.description.degree | Master | - |
dc.contributor.affiliation | 공과대학 산업공학과 | - |
dc.date.awarded | 2018-02 | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.