SHERP

A study on link-based stochastic algorithm for transit assignment considering passengers' preferences

Cited 0 time in webofscience Cited 0 time in scopus
Authors
황준하
Advisor
홍성필
Major
공과대학 산업·조선공학부
Issue Date
2015
Publisher
서울대학교 대학원
Keywords
Dial algorithmlink cost functionpassengers' preferencescrowdness
Description
학위논문 (석사)-- 서울대학교 대학원 : 산업공학과, 2015. 8. 홍성필.
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
in some area, it has a grid structure. Due to this, a method which does not require path enumeration should be used
Dial’s 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.
Language
English
URI
http://hdl.handle.net/10371/123646
Files in This Item:
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Theses (Master's Degree_산업공학과)
  • mendeley

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

Browse