$\require{mediawiki-texvc}$
  • 검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
  • 검색연산자
검색연산자 기능 검색시 예
() 우선순위가 가장 높은 연산자 예1) (나노 (기계 | machine))
공백 두 개의 검색어(식)을 모두 포함하고 있는 문서 검색 예1) (나노 기계)
예2) 나노 장영실
| 두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색 예1) (줄기세포 | 면역)
예2) 줄기세포 | 장영실
! NOT 이후에 있는 검색어가 포함된 문서는 제외 예1) (황금 !백금)
예2) !image
* 검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색 예) semi*
"" 따옴표 내의 구문과 완전히 일치하는 문서만 검색 예) "Transform and Quantization"
쳇봇 이모티콘
안녕하세요!
ScienceON 챗봇입니다.
궁금한 것은 저에게 물어봐주세요.

논문 상세정보

차량용량을 고려한 대중교통 통행배정모형구축에 관한 연구

A User Equilibrium Transit Assignment Model with Vehicle Capacity Constraint

Abstract

The purpose of the thesis is providing a new formulation for the transit assignment problem. The existing models dealing with the transit assignment problem don't consider the congestion effects due to the insufficient capacity of transit vehicles. Besides, these models don't provide solutions satisfying the Wardrop's user equilibrium conditions. The congestion effects are considered to be concentrated at the transit stops. For the transit lines, the waiting times at the transit stops are dependent on the passenger flows. The new model suggests the route section cost function analogous to the link performance function of the auto assignment to reflect the congestion effects in congested transit network. With the asymmetric cost function, the variational inequality programming is used to obtain the solutions satisfying Wardrop's condition. The diagonalization algorithm is introduced to solve this model. Finally, the results are compared with those of EMME/2.

참고문헌 (14)

  1. Equilibria on a Congested Transportation Network , H.Z.Aashtiani;T.L.Magnanti , SIAM J. Algebraic Discrete Meth. / v.2,pp.213-216, 1981
  2. The Convergence of Diagonalization Algorithms for Asymmetric Network Equilibrium Problems , M.Florian;H.Spiess , Trans. Res. B / v.16B,pp.477-483, 1982
  3. An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs , S.Nguyen;C.Dupuis , Trans. Sci. / v.18,pp., 1984
  4. A Probabilistic Multipath Traffic Assignment Model which Obviates Path Enumeration , R.B.Dial , Trans. Res. / v.5,pp.83-112, 1971
  5. J.de D.Ortuzar;L.G.Willumsrn , Modelling Transport / v.,pp., 1990
  6. Traffic Equilibrium and Variational Inequalities , S.C.Dafermos , Trans. Sci. / v.14,pp.42-54, 1980
  7. J.M.Ortega;W.C.Rheinboldt , Iterative Solution of Nonlinear Equations in Several Variables / v.,pp., 1970
  8. Yosef Sheffi , Urban Transportation Network / v.,pp., 1985
  9. Transit Assignment for Congested Public Transport Systems: An Equilibrium Model , J. De Cea;J.E.Fernandez , Trans. Sci. / v.27,pp.133-147, 1993
  10. Optimal Strategies: A New Assignment Model for Transit Network , H.Spiess;M.Florian , Trans. Res. B / v.23B,pp.83-102, 1989
  11. Existence, Uniqueness and Stability of Traffic Equilibria , M.J.Smith , Trans. Res. / v.18B,pp.295-304, 1979
  12. M.J.Beckmann;C.B.McGuire;C.B.Winsten , Studies in the Economics of Transportation / v.,pp., 1956
  13. On Binary Mode Choice/Assignment Model , M.Florian;H.Spiess , Trans. Sci. / v.17,pp.32-47, 1983
  14. Traffic Assignment Techniques , R.Thomas , Avebury Technical / v.,pp., 1991

이 논문을 인용한 문헌 (4)

  1. 1999. "Development of an Integrated network model for Mode Choice and Trip Assignment" 大韓交通學會誌 = Journal of Korean Society of Transportation, 17(5): 87~98 
  2. 2001. "Study on Multi-modal Transit Network Assignment with Dial Algorithm" 大韓交通學會誌 = Journal of Korean Society of Transportation, 19(2): 53~60 
  3. 2001. "Development of A Dynamic Departure Time Choice Model based on Heterogeneous Transit Passengers" 大韓交通學會誌 = Journal of Korean Society of Transportation, 19(5): 119~134 
  4. 2003. "A Transit Assignment Model using Genetic Algorithm" 大韓交通學會誌 = Journal of Korean Society of Transportation, 21(1): 65~75 

원문보기

원문 PDF 다운로드

  • ScienceON :

원문 URL 링크

원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다. (원문복사서비스 안내 바로 가기)

상세조회 0건 원문조회 0건

DOI 인용 스타일