• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.161-170
• /
• 1998

기존에 건설된 교통시설의 운영효율을 극대화하기 위한 지능형 교통체계의 한 분야인 ATIS는 도로를 이용하는 통행자에게 편리성을 제공하는 동시에 도로를 효율적으로 운영할 수 있는 정보체계이다. ATIS 체계하에서 통행자에게 신뢰성 있는 정보를 제공하기 위해서는 교차로서의 회전에 의한 지체를 정확하게 반영함은 물론이고 실시간으로 변화하는 교통상황을 반영할 수 있는 동적인 최단경로 탐색 알고리즘이 요구된다. 하지만 기존에 발표된 동적인 최단경로 탐색 알고리즘은 회전에 대한 정보를 반영하지 못하며 정적인 최단경로 탐색 알고리즘은 회전에 대한 정보를 반영하지 못하며 정적인 탐색알고리즘 조차 회전에 대한 정보를 정확히 반영하지 못한다. 본 연구에서는 이러한 이유에서 알고리즘 내부에서 회전을 반영하기 위해 수정형 덩굴망 알고리즘의 표지기법을 이용하여 동적인 최단경로 탐색알고리즘을 개발하였다. 본 연구에서 개발한 동적 최단경로 탐색 알고리즘은 정적인 상태의 수정형 덩굴망 알고리즘에 시간에 따라 변화하는 교통상황을 반영하기 위해 시간에 대한 변수를 추가하였다. 이렇게 해서 알고리즘은 시간대별로 변화하는 통행시간을 고려하여 최단 경로를 탐색하게 되며 출발시점을 기준으로 표지를 설정하여 모든 앞선 시간에 대해 경로를 고려하도록 하였다. 매 단계에서 전 노드를 추적하여 회전에 관한 정보를 반영하도록 하였다. 따라서 본 연구에서 개발한 최단경로 탐색 알고리즘은 교차로에서의 회전에 대한 정보와 통행금지 등을 정확히 반영하며 실시간으로 변화하는 통행시간을 반영함으로써 신뢰성 있는 노선 정보를 ATIS를 이용하는 통행자들에게 제공하는데 활용될 수 있는 기법이다.적으로 세부적 차종분류로 접근한다.의 영향들을 고려함으로써 가로망 설계 과정에서 가로망의 상반된 역할인 이동성과 접근성의 비교가 가능한 보다 현실적인 가로망 설계 모형을 구축하고자 한다. 지금까지 소개된 가로망 설계모형들은 용량변화에 대한 설계변수의 형태에 따라 이산적 가로망 설계 모형과 연속적 가로망 설계모형으로 나뉘어지게 된다. 본 논문의 경우, 계산속도의 향상 측면에서는 연속적 가로망 설계 모형을 도입할 수 있지만, 이때 요구되는 도로용량이 이산적인 변수(차선 수)로 결정되어야만 신호제어 변수를 결정할 수 있기 때문에, 이산적 가로망 설계 모형이 사용된다. 하지만, 이산적 설계모형의 경우 조합최적화 문제이므로 정확한 최적해를 구하기 위해서는 상당한 시간이 소요되며, 경우에 따라서는 국부 최적해에 빠지게 된다. 이러한 문제를 극복하기 위해, 우선 이상적 모형의 근사화, 혹은 조합최적화문제를 위해 개발된 Simulated Annealing기법의 적용, 연속적 모형의 변수를 이산화하는 방법 등 다양한 모형들을 고려해 본 뒤, 적절한 모형을 적용할 것이다. 가로망 설계 모형에서 신호제어를 고려하기 위해서는 주어진 가로망에 대한 통행 배정과정에서 고려되는 통행시간을 링크통행시간과 교차로 지체시간을 동시에 고려해야 하는데, 이러한 문제의 해결을 위해서 최근 활발히 논의되고 있는 교차로에서의 신호제어에 대응하는 통행배정 모형을 도입하여 고려하고자 한다. 이를 위해서 지금까지 연구되어온 Global Solution Approach와 Iterative Approach를 비교, 검토한 뒤 모형에 보다 알맞은 방법을 선택한다. 차량의 교차로 통행을 고려하는 perf

• Journal of Korean Society of Transportation
• /
• v.24 no.6 s.92
• /
• pp.89-102
• /
• 2006

The purpose of this paper is to develop a dynamic OD estimating model to overcome the limitation of depicting teal situations in dynamic simulation models based on static OD trip. To estimate dynamic OD matrix we used the hybrid discrete choice model(called the 'Demand Simulation Model'), which combines travel departure time with travel mode and travel path. Using this Demand Simulation Model, we deduced that the traveler chooses the departure time and mode simultaneously, and then choose his/her travel path over the given situation In this paper. we developed a hybrid simulation model by joining a demand simulation model and the supply simulation model (called LiCROSIM-P) which was Previously developed. We simulated the hybrid simulation model for dependent/independent networks which have two origins and one destination. The simulation results showed that AGtt(Average gap expected travel time and simulated travel time) did not converge, but average schedule delay gap converged to a stable state in transportation network consisted of multiple origins and destinations, multiple paths, freeways and some intersections controlled by signal. We present that the hybrid simulation model can estimate dynamic OD and analyze the effectiveness by changing the attributes or the traveler and networks. Thus, the hybrid simulation model can analyze the effectiveness that reflects changing departure times, travel modes and travel paths by demand management Policy, changing network facilities, traffic information supplies. and so on.

• Journal of Korean Society of Transportation
• /
• v.17 no.1
• /
• pp.75-89
• /
• 1999

위험물차량사고는 일반차량의 교통사고시 발생하는 인명피해, 재산피해, 교통지체 외에 부가적으로 환경적 영향에 의한 엄청난 인명 및 재산손실을 유발시킬 수 있다. 따라서 이러한 위험물차량사고를 예방하고 피해를 최소로 줄이기 위해서는 위험물수송경로의 신중하고 체계적인 결정이 필수적이라 할 수 있다. 따라서, 본 연구는 위험물차량의 수송경로를 결정할 때 고려해야 할 여러 가지의 기준 및 목표에 따라 위험물수송경로를 설정하는 모형을 제시함으로써 위험물수송에 수반되는 위험을 최소화하면서 위험물차량의 통행시간, 거리, 비용 등을 최적화하여 위험물수송의 안전 및 운영효율성을 향상시키고자 한다. 먼저, 위험물 수송경로의 기준지표로 사용될 위험도를 나타내기 위해 사고율과 피해가능규모를 구하도록 사 고건수, 링크 주변노출인구, 링크상의 노출인구, 밀도 등을 변수로 하는 모형식을 제안하고, 두 번째로 위험물 수송을 위한 최적경로를 산출하기 위해 위험도와 통행시간을 목적함수로 하는 다목적계획모형을 제안하였고 기존의 최적경로 알고리즘을 적용하여 최적경로를 산출하였다. 마지막으로 실제 수도권지역을 대상으로 본 연구에서 제안한 모형을 적용하고 현재 일반적으로 사용되는 최단경로와 비교.분석하였다. 모형적용결과, 링크주변인구만을 고려하는 기존 모형에 비해 링크상의 인구를 함께 고려함으로써 좀더 실제적으로 교통상황을 충분히 반영한 피해규모를 산정하였다. 또한, 본 연구에서 제안한 위험도와 통행시간에 0.5의 비중을 주는 다목적모형이 기존의 위험도모형에 비해 충분한 안전성을 확보하면서 최소 4%, 최대 12%의 통행시간 개선의 효과가 있음을 나타냈다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.41 no.3
• /
• pp.247-255
• /
• 2021

Individual passenger transfer information is not included in Seoul metropolitan subway Automatic Fare Collection (AFC) data. Currently, basic data such as travel time and distance are allocated based on the TagIn terminal ID data records of AFC data. As such, knowledge of the actual path taken by passengers is constrained by the fact that transfers are not applied, resulting in overestimation of the transport index. This research proposes a method by which a transit path that connects the TagIn and TagOut terminal IDs in AFC data is determined and applied to the transit index. The method embodies the concept that a passenger's line of travel also accounts for transfers, and can be applied to the transit index. The path selection model for the passenger calculates the line of transit based on travel time minimization, with in-vehicle time, transfer walking time, and vehicle intervals all incorporated into the travel time. Since the proposed method can take into account estimated passenger movement trajectories, transport-related data of each subway organization included in the trajectories can be accurately explained. The research results in a calculation of 1.47 times the values recorded, and this can be evaluated directly in its ability to better represent the transportation policy index.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.3
• /
• pp.1115-1122
• /
• 2013

Recently the demands for traffic information tend to increase, and travel time might one of the most important traffic information. To effectively estimate exact travel time, highly reliable traffic data collection is required. BIS(Bus Information System) data would be useful for the estimation of the route travel time because BIS is collecting data for the bus travel time on the main road of the city on real-time basis. Traditionally use of BIS data has been limited to the realm of bus operating but it has not been used for a variety of traffic categories. Therefore, this study estimates a route travel time on road networks in urban areas on the basis of real-time data of BIS and then eventually constructs regression models. These models use an explanatory variable that corresponds to bus travel time excluding service time at the bus stop. The results show that the coefficient of determination for the constructed regression model is more than 0.950. As a result of T-test performance with assistance from collected data and estimated model values, it is likely that the model is statistically significant with a confidence level of 95%. It is generally found that the estimation for the exact travel time on real-time basis is plausible if the BIS data is used.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.91-98
• /
• 2004

This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

• Journal of Korean Society of Transportation
• /
• v.34 no.6
• /
• pp.570-579
• /
• 2016

This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.85-96
• /
• 2004

Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.37 no.6
• /
• pp.1033-1041
• /
• 2017

Path travel time based on departure time (PTTDP) is key information in advanced traveler information systems (ATIS). Despite the necessity, forecasting PTTDP is still one of challenges which should be successfully conquered in the forecasting area of intelligent transportation systems (ITS). To address this problem effectively, a methodology to dynamically predict PTTDP between motorway interchanges is proposed in this paper. The method was developed based on the relationships between traffic demands at motorway tollgates and PTTDPs between TGs in the motorway network. Two different data were used as the input of the model: traffic demand data and path travel time data are collected by toll collection system (TCS) and dedicated short range communication (DSRC), respectively. The proposed model was developed based on k-nearest neighbor, one of data mining techniques, in order for the real applications of motorway information systems. In a feasible test with real-world data, the proposed method performed effectively by means of prediction reliability and computational running time to the level of real application of current ATIS.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.99-107
• /
• 2000

Path-based assignment(PBA) is valuable to dynamic traffic control and routing in integrated ITS framework. As one of widely studied PBA a1gorithms, Gradient Projection(GP) a1gorithm typically fields rapid convergence to a neighborhood of an optimal solution. But once it comes near a solution, it tends to slow down. To overcome this problem, we develop more efficient path-based assignment algorithm by combining Conjugate Gradient method with GP algorithm. It determines more accurate moving direction near a solution in order to gain a significant advantage in speed of convergence. Also this algorithm is applied to the Sioux-Falls network and verified its efficiency. Then we demonstrate that this type of method is very useful in improving speed of convergence in the case of user equilibrium problem.