The time for evacuation of residents in emergency planning zone(EPZ) of Uljin nuclear site in case of a radiological emergency was estimated with traffic analysis. Evacuees were classified into 4 groups by considering population density, local jurisdictions, and whether they ate residents or transients. The survey to investigate the behavioral characteristics of the residents was made for 200 households and included a hypothetical scenario explaining the accident situation and questions such as dwelling place, time demand for evacuation preparation transportation means for evacuation, sheltering place, and evacuation direction. The microscopic traffic simulation model, CORSIM, was used to simulate the behavior of evacuating vehicles on networks. The results showed that the evacuation time required for total vehicles to move out from EPZ took longer in the daytime than at night in spite that the delay times at intersections were longer at night than in the daytime. This was analyzed due to the differences of the trip generation time distribution. To validate whether the CORSIM model fan appropriately simulate the congested traffic phenomena assumable in case of emergency, a benchmark study was conducted at an intersection without an actuated traffic signal near Uljin site during the traffic peak-time in the morning. This study indicated that the predicted output by the CORSIM model was in good agreement with the observed data. satisfying the purpose of this study.
The Journal of The Korea Institute of Intelligent Transport Systems
/
v.16
no.6
/
pp.53-66
/
2017
In order to improve traffic flow and vehicular safety, installation of roundabouts is encouraging recently. Roundabouts are generally installed at which traffic flow and pedestrian flow is relatively low intersections. Roundabouts reduce vehicle speed, minimize vehicle weaving, and reduce critical conflict points. For these reasons, roundabouts are generally operated unprotected pedestrian crosswalk, thus a shortcoming for pedestrian safety always exists at roundabouts. The purpose of this study is developing a dynamic signal metering algorithm for traffic and pedestrian at four-way-approach with two-lane roundabouts in which three different operation algorithms(fixed-time pedestrian, vehicle signal metering, and vehicle and pedestrian signal metering) are suggested and its performance is tested by using VISSIM. The results of the fixed pedestrian signal operation show that there is a big average delay increase in general and that increases up to 51.4 seconds/vehicle(42.5%) when the total number of approaching vehicle is 3,800 vehicle/hour. However, the results of the simultaneous dynamic signal metering operation for the vehicle and pedestrian crossing with push button show that there is a substantial average delay reduction up to 40.6 seconds/vehicle(42.7%) when the total number of approaching vehicle is 3,000 vehicle/hour.
In this paper, we introduce an efficient GPU-based real-time rendering technique applicable to every kind of game. Our method, without an extra geometry, can represent terrain just with a height map. It makes it possible to freely go around in the air or on the surface, so we can directly apply it to any computer games as well as a virtual reality. Since our method is not based on any geometrical structure, it doesn't need special LOD policy and the precision of geometrical representation and visual quality absolutely depend on the resolution of height map and color map. Moreover, GPU-only technique allows the general CPU to be dedicated to more general work, and as a result, enhances the overall performance of the computer. To date, there have been many researches related to the terrain representation, but most of them rely on CPU or confmed its applications to flight simulation, Improving existing displacement mapping techniques and applying it to our terrain rendering, we completely ruled out the problems, such as cracking, poping etc, which cause in polygon-based techniques, The most important contributions are to efficiently deal with arbitrary LOS(Line Of Sight) and dramatically improve visual quality during walk-through by reconstructing a height field with curved patches. We suggest a simple and useful method for calculating ray-patch intersections. We implemented all these on GPU 100%, and got tens to hundreds of framerates with height maps a variety of resolutions$(256{\times}256\;to\;4096{\times}4096)$.
The current procedure of estimating accident reduction benefit shows fixed accident rates for each level of roads without considering the various characteristics of roadway geometries, and traffics. In this study, in order to solve the problems mentioned in the above, models were developed considering the characteristics of roadway alignments and traffic characteristics. The developed models can be used to estimate the accident rates on new or improved roads, In this study, only urban highways were included as a beginning stage. First of all. factors influencing accident rates were selected. Those factors such as traffic volumes. number of signalized intersections, the number of connecting roads, number of pedestrian traffic signals, existence of median barrier, and the number of road lane are also selected based upon the obtainability at the planning stage of roads. The relationship between the selected factors and accident rates shows strong correlation statistically. In this study, roads were classified into 4 groups based on number of lanes, level of roads and the existence of median barriers. The regression analysis had been performed for each group with actual data associated with traffic, roads. and accidents. The developed regression models were verified with another data set. In this study, in order to develop the proposed models, only data on a limited area were used. In order to represent whole area of the country with the developed models. the models should be re-analyzed with vast data.
Signalized intersections are widely used in urban street network. However, it was reported that a roundabout is better than a signalized intersection in terms of delay when the approaching traffic volume for each bound is low. The objective of this study is to develop entry capacity models of roundabout and establish the warrant for signalized intersection based on the delay. The entry capacity of a roundabout is determined by the circulating traffic volume and the geometric design of the roundabout such as the diameter of central island, entry lane widths, and the circulating roadway width. The traffic and geometric characteristics of four roundabouts were collected and analyzed. The study reveals that; i)among the geometric features, the diameter of central island and the circulating roadway width influence the entry capacity, and ii)even though it is difficult to compare the models of each country due to different geometric features considered in the models, the models developed in this study show higher capacity than the models from Israel or Germany. These seem to be attributed to the facts that; i)the outside diameters of the roundabouts selected in this study are larger than in the other studies, and ii)the acceptable gap in Korea is smaller than that in the other countries. In order to compare the performances of round- about and signalized intersection, the performance of roundabouts was evaluated with the SIDRA. The simulation was conducted only for the roundabouts composed of single lane. According to the result of the analysis, it may be concluded that when the approaching traffic volume for each bound is lower than 600pcph, a roundabout is better than a signalized intersection in terms of its operational performance.
The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.
The purpose of this study is to provide the criteria for implementing unprotected left turn at intersections with variation of traffic volume on a cross road approach. Using Transyt-7F model, the delays calculated from permissive and protected left turn signal system were compared by gradually increasing the left turn volume for a certain opposing through volume up to the volume limits to which permissive left turn is more effective, Average stopped delay of the intersection was used as the measure of effectiveness in this study. The major conclusions are (1) the lighter the traffic gets in a cross road, the more the allowable left turn volume increases. The allowable left turn volume when the ratio of cross traffic to the concerned approach traffic is 0.6 appears about 50% more than the volume when the ratio is 1.0. (2) Comparing to the criteria of the manual of traffic safety facility, the results when the traffic ratio is 0.6 seem to be most similar the criteria of manual and the results when the traffic ratio are 0.8 and 1.0 appears to be lower than the criteria of manual. (3) The possible amount of making a left turn that is inversely proportional to the opposing through traffic, decreases as the number of opposing through lanes increases. The products of volume need to be used as the criteria of permissive left turn with considerable cautions because of its low consistency.
The goals of this study are to develop travel time functions based on intersection delay and to analyze the applicability of the functions to traffic assignment models. The study begins with the premise that the existing assignment models can not effectively account for intersection delay time. In pursuing the goals, this study gives particular attention to dividing the link travel time into link moving time and stopped time at node, making the models based on such variables as the travel speed, volume, geometry, and signal data of signalized intersections in Cheongju, and analyzing the applicability of these models to traffic assignment. There are several major findings. First, the study presents the revised percentage of lanes (considering type of intersection) instead of g/C for calculating intersection delay, which is analyzed to be significant in the paired t-test. Second, the assigned results of applying these models to the Cheongju network in EMME/2 are compared with the data observed from a test car survey in Cheongju. The analyses show that the BPR models do not consider the intersection delay, but the modified uniform delay model and modified Webster model are comparatively well fitted to the observed data. Finally, the assigned results of applying these models are statistically compared with the test car survey data in assigned volume, travel time, and average speed. The results show that the estimates from the divided travel time model are better fitted to observed data than those from the BPR model.
This research suggested a real-time traffic signal control algorithm using individual vehicle travel times on an isolated signal intersection. To collect IDs and passing times from individual vehicles, space-based surveillance systems such as DSRC were adopted. This research developed models to estimate arrival flow rates, delays, and the change rate in delay, by using individual vehicle's travel time data. This real-time signal control algorithm could determine optimal traffic signal timings that minimize intersection delay, based on a linear programming. A micro simulation analysis using CORSIM and RUN TIME EXTENSION verified saturated intersection conditions, and determined the optimal traffic signal timings that minimize intersection delay. In addition, the performance of algorithm varying according to market penetration was examined. In spite of limited results from a specific scenario, this algorithm turned out to be effective as long as the probe rate exceeds 40 percent. Recently, space-based traffic surveillance systems are being installed by various projects, such as Hi-pass, Advanced Transportation Management System (ATMS) and Urban Transportation Information System (UTIS) in Korea. This research has an important significance in that the propose algorithm is a new methodology that accepts the space-based traffic surveillance system in real-time signal operations.
The national standards for the installation of pedestrian crosswalks prohibits installation of crosswalks within 200 meters of nearby overpasses, underpasses, or crosswalks. In case the exceptional installation is required, the feasibility study is to be thoroughly conducted by the local police agency. However, it is an undeniable fact that the specific installation standards for optimal types and locations of crosswalks are not yet to be established. This paper examines the development of traffic accident prediction model applicable to different types and locations of bus stops(type A and type B) at mid-block intersections. Furthermore, it develops the poisson regression model which sets the "number of traffic accidents" and "traffic accident severity" as dependent variables, while using "traffic volumes", "pedestrian traffic volumes" and "the distance between crosswalks and bus stops" as independent variables. According to the traffic accident prediction model applicable to the type A bus stop location, the traffic accident severity increases relative to the number of traffic volumes, the number of pedestrian traffic volumes, and the distance between crosswalks and bus stops. In case of the type B bus stop model, the further the bus stop is from crosswalks, the number of traffic accidents decreases while it increases when traffic volumes and pedestrian traffic volumes increase. Therefore, it is reasonable to state that the bus stop design which minimizes the traffic accidents is the type C design, which is the one in combination of type A and type B, and the optimal distance is found to be 65 meters. In case of the type A design and the type B design, the optimal distances are found to be within range 60~70meters.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.