공공자전거시스템에서 동적 자전거 재분배 차량 경로 계획
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Seunghyeon | - |
dc.date.accessioned | 2018-11-08T07:55:59Z | - |
dc.date.available | 2018-11-08T07:55:59Z | - |
dc.date.issued | 2011-02 | - |
dc.identifier.other | 11510 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/8544 | - |
dc.description | 학위논문(석사)--아주대학교 일반대학원 :건설교통공학과,2011. 2 | - |
dc.description.tableofcontents | Ⅰ. INTRODUCTION 1 A. MOTIVATION 1 B. PURPOSE 2 C. STRUCTURE OF THE STUDY 3 Ⅱ. LITERATURE REVIEW 6 A. PUBLIC BICYCLE SYSTEM 6 1. Concepts of PBS 6 2. Operational characteristics of PBS 8 3. Bicycle redistribution 10 B. VEHICLE ROUTING PROBLEM 14 1. Concepts of VRP 15 2. Dynamic VRP 21 3. Application of DVRP to PBS 24 C. LESSONS LEARNED 26 Ⅲ. MODEL DEVELOPMENT 27 A. PROBLEM DESCRIPTION 27 1. Components 27 2. Overall process 28 3. Assumptions 31 B. MODELING PROCEDURES 32 1. Step 1: Finding redistribution timing 32 2. Step 2: Setting up time windows 39 3. Step 3: Scheduling bicycle redistribution vehicle 44 Ⅳ. MODEL APPLICATION 48 A. APPLICATION PROCEDURES 48 B. MODELING RESULTS 50 Ⅴ. CONCLUSIONS AND DISCUSSION 53 REFERENCE 55 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | 공공자전거시스템에서 동적 자전거 재분배 차량 경로 계획 | - |
dc.title.alternative | Seunghyeon Lee | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.alternativeName | Seunghyeon Lee | - |
dc.contributor.department | 일반대학원 건설교통공학과 | - |
dc.date.awarded | 2011. 2 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 569283 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000011510 | - |
dc.subject.keyword | Dynamic Bicycle Redistribution | - |
dc.subject.keyword | Vehicle Routing Problem | - |
dc.subject.keyword | Public Bicycle System Operation | - |
dc.description.alternativeAbstract | In Public Bicycle System (PBS), bicycle redistribution is one of the most important issues for efficient and effective operations. Although, bicycle redistribution strategy was often noted, it was rarely studied in a through manner. The major purpose of this study is to find the number of bicycles to redistribute them on full or empty stations and to identify the station visiting sequence of redistribution vehicle to minimize travel time and dissatisfaction incurred from users. The schedule of bicycle redistribution vehicle was obtained by three steps with several assumptions. The first step is to find redistribution timing to prevent full or empty stations. The second is to set up time windows to redistribute bicycle to prevent full or empty states. Finally, the last is to schedule the bicycle redistribution vehicle as the dynamic Bicycle Redistribution Vehicle Routing Problem (BRVRP). One hypothetical PBS is conceived to examine the possibility to apply the dynamic BRVRP suggested in this study to either existing or proposed PBS. The example system consists of 20 stations, 1 redistribution vehicle, and 1 center, the condition of which is more or less similar to existing system. The simplex dual algorithm programmed with Xpress-Mosel system provided proper solutions which describe the visiting station sequence of redistribution vehicle while meeting the needed bicycles to be moved and the capacities of stations. The methodology set forth in this study may help design the PBS and bicycle redistribution strategies to be used in reality. The tentative conclusions resulted from a hypothetical PBS, however, await further refinements and correction. Future research such as applications to existing PBS, comprehensive integrated modeling, and more precise time-dependent variables can also be considered to be of better use. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.