Publications
Detailed Information
A study on link-based stochastic algorithm for transit assignment considering passengers' preferences
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 홍성필 | - |
| dc.contributor.author | 황준하 | - |
| dc.date.accessioned | 2017-07-14T03:27:15Z | - |
| dc.date.available | 2017-07-14T03:27:15Z | - |
| dc.date.issued | 2015-08 | - |
| dc.identifier.other | 000000053242 | - |
| dc.identifier.uri | https://hdl.handle.net/10371/123646 | - |
| dc.description | 학위논문 (석사)-- 서울대학교 대학원 : 산업공학과, 2015. 8. 홍성필. | - |
| dc.description.abstract | In transit assignment problem, it is assumed that passengers choose path which is, they consider, the best among the alternative paths. Thus, path choice of passengers reveals their taste heterogeneity, and generating path choice set is an important part of solving transit assignment problem. In this paper, we discuss how to make path choice set efficiently. The network of Seoul Metro consists of a large number of nodes and links | - |
| dc.description.abstract | in some area, it has a grid structure. Due to this, a method which does not require path enumeration should be used | - |
| dc.description.abstract | Dials algorithm is the one. In order to generate path choice set more accurately, it is essential to use a precise link cost function. To develop this, we should take crowding and taste heterogeneity into account. We show that the new link cost estimates path choice set more accurately than the previously used link cost. | - |
| dc.description.tableofcontents | English abstract
1 Introduction 1.1 Motivation of Study 2 Literature review 2.1 Travel cost function 2.1.1 Concept of travel cost function 2.2 Transit assignment algorithms 2.2.1 Outline of Transit assignment algorithms 2.2.2 Link based stochastic algorithm for transit assignment: Dial's algorithm 2.3 Drawbacks of Dial's algorithm 2.3.1 Drawbacks of reasonable link 2.3.2 Pros and cons of previous studies which tried to resolve drawbacks of Dial's algorithm 2.4 Route Set generation methods 2.5 A method which finds out passengers' preferences 3 Development of link cost functions 3.1 Difficulty of developing link cost function 3.2 A method which finds out a substitution for | - |
| dc.description.tableofcontents | P | - |
| dc.description.tableofcontents | 3.3 Three link cost functions which are used in experiment
3.4 Development of parameters, which minimize the errors in logit model 4 Experiment 4.1 Development result of parameters 4.2 Results of Dial's algorithm 5 Conclusion and Further research References Korean abstract | - |
| dc.format | application/pdf | - |
| dc.format.extent | 2713828 bytes | - |
| dc.format.medium | application/pdf | - |
| dc.language.iso | en | - |
| dc.publisher | 서울대학교 대학원 | - |
| dc.subject | Dial algorithm | - |
| dc.subject | link cost function | - |
| dc.subject | passengers' preferences | - |
| dc.subject | crowdness | - |
| dc.subject.ddc | 623 | - |
| dc.title | A study on link-based stochastic algorithm for transit assignment considering passengers' preferences | - |
| dc.type | Thesis | - |
| dc.description.degree | Master | - |
| dc.citation.pages | i, 41 | - |
| dc.contributor.affiliation | 공과대학 산업·조선공학부 | - |
| dc.date.awarded | 2015-08 | - |
- 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.