• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.165-179
• /
• 2005

The object of this study is a development of a stochastic user equilibrium transit assignment algorithm for multiple user classes considering stochastic characteristics and heterogeneous attributes of passengers. The existing transit assignment algorithms have limits to attain realistic results because they assume a characteristic of passengers to be equal. Although one group with transit information and the other group without it have different trip patterns, the past studies could not explain the differences. For overcoming the problems, we use following methods. First, we apply a stochastic transit assignment model to obtain the difference of the perceived travel cost between passengers and apply a multiple user class assignment model to obtain the heterogeneous qualify of groups to get realistic results. Second, we assume that person trips have influence on the travel cost function in the development of model. Third, we use a C-logit model for solving IIA(independence of irrelevant alternatives) problems. According to repetition assigned trips and equivalent path cost have difference by each group and each path. The result comes close to stochastic user equilibrium and converging speed is very fast. The algorithm of this study is expected to make good use of evaluation tools in the transit policies by applying heterogeneous attributes and OD data.

• The Korean Journal of Applied Statistics
• /
• v.28 no.2
• /
• pp.251-267
• /
• 2015

The Indian Buffet Process is a stochastic process on equivalence classes of binary matrices having finite rows and infinite columns. The Indian Buffet Process can be imposed as the prior distribution on the binary matrix in an infinite feature model. We describe the derivation of the Indian buffet process from a finite feature model, and briefly explain the relation between the Indian buffet process and the beta process. Using a Gaussian linear model, we describe three algorithms: Gibbs sampling algorithm, Stick-breaking algorithm and variational method, with application for finding features in image data. We also illustrate the use of the Indian Buffet Process in various type of analysis such as dyadic data analysis, network data analysis and independent component analysis.