Publications

Detailed Information

Determining Depot Locations and Capacities for Demand Responsive Autonomous Vehicles : 수요응답형 자율주행차의 Depot 입지 및 용량 결정

DC Field Value Language
dc.contributor.advisor고승영-
dc.contributor.author윤상원-
dc.date.accessioned2018-05-28T16:02:42Z-
dc.date.available2018-05-28T16:02:42Z-
dc.date.issued2018-02-
dc.identifier.other000000151274-
dc.identifier.urihttps://hdl.handle.net/10371/140521-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 공과대학 건설환경공학부, 2018. 2. 고승영.-
dc.description.abstractIn the automobile and transportation sector, various technologies related to an autonomous vehicle (AV) and shared mobility are expected to upgrade. Accordingly, various types of service using AV have been proposed recently in the field of Demand Responsive Transport (DRT) such as a shared autonomous vehicle (SAV), which is one-way car sharing services using AV. The Demand Responsive Autonomous Vehicle (DRAV) system is a system that utilizes AV for on-demand service in the public domain. It can improve the travel conveniences for users in blind spot of transport service areas and vulnerable road users (e.g. disabled, elderly). Additionally, since this system also is used as a demand management policy by promoting the sharing transport, DRAV can be considered as a competitive new para-transit option. However, although many previous studies are concerned about road congestion possibly caused by a large number of AV, lack of studied considered such problem. DRAV depot not only decreases the road congestion but also plays multiple roles such as effective vehicle management and charging infrastructure of future rechargeable battery vehicles.
This study aims to develop a model and an algorithm to determine optimal location, quantity, and capacity of DRAV depot considering road congestion due to empty AV travels after the introduction of the system. Iterative modal split and traffic assignment procedures are deployed in the model to describe users behavior more realistically. Moreover, a solution algorithm based on genetic algorithm (GA), a representative meta-heuristic technique, is developed to solve the NP-hard combinatorial optimal solution problem type in a reasonable time. The characteristic of the problem that the solution pattern varies according to the number of depots is considered in the algorithm. EMME4, a typical transportation simulation program, and python 2.7 are utilized for efficient analysis and the problem-solving process is automated by using application programming interface (API).
The Mandl's network is selected for a case study analysis. Results reveals that network congestion cost due to empty vehicle travel should be considered in the DRAV depot decision process. Depot location is determined by high DRAV demand, but the additional construction of depot is recommended for highly congested areas to reduce the congestion cost. Further scenario analyses, represents the various future situations, proves that influencing factors for the depot location selections such as local transportation environment and location-related factors (e.g, traffic volume, travel pattern, public transport route, land cost) for location selections should be fully considered.
-
dc.description.tableofcontents1. Introduction 1
1.1. Research Background and Objective 1
1.2. Research Flow 7
2. Literature Review 11
2.1. Research Trends Related to DRAV 11
2.2. Location Model in Shared Mobility 15
2.2.1. Location model of one-way car sharing 15
2.2.2. Flow-Capturing Location-Allocation Model(FCLM) 19
2.3. Genetic Algorithm 23
2.3.1. Summary of GA 23
2.3.2. Studies on location model deploying GA 30
2.4. Review Results and Originality of the Study 31
3. Model Formulation 35
3.1. Problem Definition 35
3.1.1. Terminology 35
3.1.2. Assumptions 36
3.1.3. Problem situation 37
3.2. Notations and Framework 39
3.2.1. Notations 39
3.2.2. Model framework 41
3.3. Base situation analysis 43
3.3.1. Modal split 43
3.3.2. Multi-class traffic assignment 45
3.4. Upper model 48
3.4.1. Objective function 48
3.4.2. Constraints 52
3.5. Lower model 54
4. Algorithm Development 56
4.1. Outline of Algorithm 56
4.1.1. Complexity 56
4.1.2. Structure of algorithm 56
4.2. Algorithms for DRAV Depot Decision 58
4.2.1. Base situation analysis 58
4.2.2. Generation of population set and depot matching 62
4.2.3. Modal split and assignment considering empty vehicle travel 64
4.2.4. Calculation of Fitness Index (FI) 66
4.2.5. Termination condition and updating population set 67
4.3. Algorithm Implementation 71
5. Analysis Result 72
5.1. Case Study 72
5.1.1. Toy Network Summary 72
5.1.2. GA Design Parameter Test 74
5.1.3. Verification of Algorithm Performance 76
5.1.4. Result of Case Study 77
5.2. Scenario Analysis 82
5.2.1. Scenario Configuration 82
5.2.2. Congested Situation Scenario 83
5.2.3. OD Trip Pattern Scenario 85
5.2.4. Vehicle Occupant Scenario 89
5.2.5. Fare Scenario 92
5.2.6. Land Cost Scenario 95
5.2.7. Weighting on Social Cost Scenario 98
5.3. Large-scale Network Analysis 100
5.3.1. Summary of Large-scale Network 100
5.3.2. Results of Large-scale Network Analysis 102
6. Conclusion 105
6.1. Summary and Conclusion 105
6.2. Further Research 107
-
dc.formatapplication/pdf-
dc.format.extent1708330 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectDemand responsive autonomous vehicle (DRAV)-
dc.subjectLocation and capacity of depot-
dc.subjectBi-level model-
dc.subjectGenetic algorithm (GA)-
dc.subject.ddc624-
dc.titleDetermining Depot Locations and Capacities for Demand Responsive Autonomous Vehicles-
dc.title.alternative수요응답형 자율주행차의 Depot 입지 및 용량 결정-
dc.typeThesis-
dc.description.degreeDoctor-
dc.contributor.affiliation공과대학 건설환경공학부-
dc.date.awarded2018-02-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share