• Journal of Korean Society of Transportation
• /
• v.17 no.3
• /
• pp.117-130
• /
• 1999

Earthquakes damage roadway bridges and structures, resulting in significant impacts on transportation system Performance and regional economy. Seismic risk analysis (SRA) procedures establish retrofit priorities for vulnerable highway bridges. SRA procedures use average daily traffic volumes to determine the relative importance of a bridge. This research develops a cost-effective transportation network analysis (TAN) procedure for evaluating numerous traffic flow analyses in terms of the additional system cost due to failure. An important feature of the TNA Procedure is the use of an associative memory (AM) approach in the artificial intelligence held. A simple seven-zone network is developed and used to evaluate the TNA procedure. A subset of link failure system states is randomly selected to simulate synthetic post-earthquake network flows. The performance of different AM model is evaluated. Results from numerous link-failure scenarios demonstrate the applicability of the AM models to traffic flow estimation.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.77-86
• /
• 2004

In this study, we applied the Bayesian Network for the case of the mode choice models using the Seoul metropolitan area's house trip survey Data. Sex and age were used lot the independent variables for the explanation or the mode choice, and the relationships between the mode choice and the travellers' social characteristics were identified by the Bayesian Network. Furthermore, trip and mode's characteristics such as time and fare were also used for independent variables and the mode choice models were developed. It was found that the Bayesian Network were useful tool to overcome the problems which were in the traditional mode choice models. In particular, the various transport policies could be evaluated in the very short time by the established relation-ships. It is expected that the Bayesian Network will be utilized as the important tools for the transport analysis.

• Journal of Korean Society of Transportation
• /
• v.24 no.3 s.89
• /
• pp.167-176
• /
• 2006

An minimum path algorithm for integrated networks with departure time constraints require considering arrival time of arriving mode, transfer time. waiting time, and departure time of next mode. Integrated network with diverse modes commonly include departure time constraints. Because public mode suck as train and airplane have fixed service schedule which provide passengers. This study developed the k-path algorithm in integrated network with time varying conditions and departure time constraints. We proposed the extended method based on entire path deletion method, and examined the application of the proposed algorithm through case study.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.127-135
• /
• 1999

Most existing progression bandwidth models maximize the single or multi weighted sum of bandwidths in the both directions to improve traffic mobility on an arterial, but they cannot be applied to general networks. Even though a few models formulating a looped network problem cannot be applied to networks have not loops. Also they have some defects in optimizing phase sequences. Therefore, the objective of this study is to develope a mathematical formulation of the synchronization problem for a general traffic network. The goal is achieved successfully by introducing the signal phasing for each movement and expanding the mixed integer linear programming of MAXBAND. The experiments indicate that the proposed model can formulate the general traffic network problem mere efficiently than any other model. In conclusion, this model may optimize signal time to smooth progression in the general networks.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.133-144
• /
• 2001

The purpose of this study is to develop micro simulation model for large-scale network with driver's behavior model. This study is performed for uninterrupted flow road section. And this model is developed to simulate traffic flow of the real network with unique geometric structure. The vehicle transmission and drivers' behavior model based on the exiting Cellular Automata approach.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.325-328
• /
• 2003

폴드와 타 동유럽국가들이 내년에 유럽연합(EU)에 가입할 예정이다. EU에 가입한 후 폴란드는 도로분야의 투자에 박차를 가한 것이며 2005년까지 도로망을 보수할 것이다. 현재 폴란드 정부가 도로의 모든 건설투자 비용을 충당할 수 없으므로 민${\cdot}$관 협력에 기초하여 프로젝트 자본조달에 관한 새로운 방법을 발전시키고자 한다. 고도로 개발된 도로 교통망 없이는 국가 경제측면에서 경쟁력을 제고할 수 없으므로 EU 전체의 도로 교통망을 도입 하고자 한다. 도로 교통망의 성공적인 확대는 폴란드와 같이 아직 EU에 소속되지 않은 동유럽 국가의 교통 기반시설의 기초가 될 것이며 이것은 전채유럽의 이익을 가져 올 것이다.

• Journal of Korean Society of Transportation
• /
• v.5 no.2
• /
• pp.113-126
• /
• 1987

본 논문은 통행 기·종점 및 교통수단선택의 문제를 교통망 평형모형과 종합하여 이를 하나의 최적화 문제로 구성하는 방법 및 그의 실제응용 방법을 제시, 검토하였다. 두 가지의 행태적 특성, 즉 교통비용을 최소화하려는 사용자 평형과 통행 기·종점 및 교통수 단 등의 선택에 있어 어느 수준의 상호교류를 유지하려고 하는 엔트로피 극대화 현상이 병 애되어 최적화 문제를 형성하게 된다. 본 연구의 목적은 이의 체계적 구성과 아울러 이를 여러 도시에서 설치, 사용되고 있는 개재의 UTPS프로그램과 종합시킴으로써 개재의 대한 데이터베이스를 사용케하고 실제응용을 단순화 시키는데 있다. 개발된 모형과 방법은 시카 고 지역의 자료를 이용하여 그 타당성이 검토되었다.

• Proceedings of the KOR-KST Conference
• /
• 1993.07a
• /
• pp.255-258
• /
• 1993

본문제출료 일충여교통복무상태상련계적성시도로교통복무수평적화분방법, 귀납출료성시교통적오충복무상태,즉자유류, 교차구무일류, 일류은정, 일류연오저우가 접수겁한급교통엄중조새,환학인결정교통복무상태절환적인소시교차구진구도적포화도. 재차기출상, 근거유관수거급출료구분교통복무상태적포화도간치, 종이건립료화 분성시혹구역도로망교통복무수평적표준.

• Journal of the Korean Society for Railway
• /
• v.5 no.1
• /
• pp.11-18
• /
• 2002

영국에서 세계 최초의 철도가 탄생할 즈음에는 교통기관으로서 이미 도로와 운하를 이용한 전국적인 교통망이 만들어져 있었으며, 철도는 나중에 조잡하게 교통망이 형성되기 시작하였다. 우리 나라의 경우에 통일신라시대 이후 조선말기까지의 도로는 주로 외침을 방어하기 위한 우마차 도로가 전부였고, 이후 조선말기와 일제시대에 자동차가 도입되면서 근대적인 도로가 본격적으로 형성되기 시작하였다. (중략)