Publications

Detailed Information

A Transit Network Analysis Under Random Regret Minimization : 경로의 확률후회최소화를 고려한 대중교통 네트워크 분석

DC Field Value Language
dc.contributor.advisor고승영-
dc.contributor.author권오현-
dc.date.accessioned2017-07-13T06:40:41Z-
dc.date.available2017-07-13T06:40:41Z-
dc.date.issued2016-08-
dc.identifier.other000000137120-
dc.identifier.urihttps://hdl.handle.net/10371/118738-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 건설환경공학부, 2016. 8. 고승영.-
dc.description.abstractThe main objective of this research is developing path based stochastic traffic analysis frame on multi-modal urban transit network.
Interest in the development and implementation of path-based stochastic traffic assignment (STA) models for traffic analysis is growing to explain complex decision making process. But path-based models are still emerging issue due to it was very hard to solve mathematical models.
To challenge this objective, this research set several milestones.
This research described semi-compensatory heuristic analysis frame on urban transit with the concept of regret in behavioral economics. It consist of path set generation stage and assignment stage.
The parameters and result will be calibrated and verified with real world observation. Smart card data will be a good data source of real world behavior.
Real scale network of multi-modal urban transit is tested to present real size network practicability with Seoul metropolitan area network.
This research presented several points into path based transit analysis frameworks.
First, the research introduced relative behavioral constraint thresholds rely on regret theory to explicit path set problem to averse extreme cases and to provide flexibility of model than absolute pre-fix value. the result presented how to extreme cases among similar path sets can be avoided rely on regret theory and threshold function.
Second, regret based assignment (Random Regret Minimization) on transit network with generated path set was performed to present avoiding unconsidered paths improves assignment result. Assignment results are improved rely on explicit path set generation.
Third, the research calibrated and verified the algorithm with sufficient observations from big amount of smart card data. Path set generations threshold function was estimated from sufficient observation.
Due to regret theorys alternation relative flexibility and estimated threshold function there are no need to calibrate thresholds case by case.
-
dc.description.tableofcontents1. Introduction 1
1.1. Backgrounds 1
1.2. Objectives 3
1.3. Assumptions 3

2. Literature Reviews 5
2.1. Path Choice 5
2.2. Path Search 13
2.3. Behavioral Economics 20
2.4. Discrete Choice Model 22
2.5. Synthesis from Literatures 24

3. Methodology 26
3.1. Behavioral Framework 26
3.2. RUM vs RRM 30
3.3. Model Framework 33

4. Stage 1: Explicit Path Set Generation 39
4.1. Overview 39
4.2. Parameters Estimation 48

5. Stage 2: Assignment 57
5.1. C-Logit RRM model 57

6. Application and Verification 59
6.1. Preparation of Data 59
6.2. Synthetic Network 62
6.3. Large Network 65

7. Conclusion 72
7.1. Result and Conclusions 72
7.2. Further Research 74

8. References 75

9. APPENDIX 81
9.1. Synthetic Network 81

국문 요약 83
-
dc.formatapplication/pdf-
dc.format.extent1511614 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subject대중교통-
dc.subject확률후회최소화-
dc.subject경로탐색-
dc.subjectk-path-
dc.subject통행배정-
dc.subject통행분석-
dc.subject.ddc624-
dc.titleA Transit Network Analysis Under Random Regret Minimization-
dc.title.alternative경로의 확률후회최소화를 고려한 대중교통 네트워크 분석-
dc.typeThesis-
dc.description.degreeDoctor-
dc.citation.pages84-
dc.contributor.affiliation공과대학 건설환경공학부-
dc.date.awarded2016-08-
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