• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.51-61
• /
• 2002

In this dissertation, We demonstrated the Travel Time forecasting model in the freeway of multi-section with regard of drives' attitude. Recently, the forecasted travel time that is furnished based on expected travel time data and advanced experiment isn't being able to reflect the time-lag phenomenon specially in case of long distance trip, so drivers don't believe any more forecasted travel time. And that's why the effects of ATIS(Advanced Traveler Information System) are reduced. Therefore, in this dissertation to forecast the travel time of the freeway of multi-section reflecting the time-lag phenomenon & the delay of tollgate, we used traffic volume data & TCS data that are collected by Korea Highway Cooperation. Also keep the data of mixed unusual to applicate real system. The applied model for forecasting is consisted of feed-forward structure which has three input units & two output units and the back-propagation is utilized as studying method. Furthermore, the optimal alternative was chosen through the twelve alternative ideas which is composed of the unit number of hidden-layer & repeating number which affect studying speed & forecasting capability. In order to compare the forecasting capability of developed ANN model. the algorithm which are currently used as an information source for freeway travel time. During the comparison with reference model, MSE, MARE, MAE & T-test were executed, as the result, the model which utilized the artificial neural network performed more superior forecasting capability among the comparison index. Moreover, the calculated through the particularity of data structure which was used in this experiment.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.409-416
• /
• 2006

Real-time traveler information disseminated through Variable Message Signs (VMS) is known to have effects on driver route choice decisions. In the past, many studies have attempted to optimize the system performance using VMS message content as the primary control variable of driver route choice. This research proposes a VMS information provision optimization model which searches the best combination of VMS message contents and display sequence to minimize the total travel time on a highway network considered. The driver route choice models under VMS information provision are developed using a stated preference (SP) survey data in order to realistically capture driver response behavior. The genetic algorithm (GA) is used to find the optimal VMS information provision strategies which consists of the VMS message contents and the sequence of message display. In the process of the GA module, the system performance is measured using micro traffic simulation. The experiment results highlight the capability of the proposed model to search the optimal solution in an efficient way. The results show that the traveler information conveyed via VMS can reduce the total travel time on a highway network. They also suggest that as the frequency of VMS message update gets shorter, a smaller number of VMS message contents performs better to reduce the total travel time, all other things being equal.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.103-114
• /
• 2005

The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.145-153
• /
• 2008

Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.

• Journal of Korean Society of Transportation
• /
• v.26 no.6
• /
• pp.113-122
• /
• 2008

This study extended Park et al.(2007c), which analyzed the efficiency of a hierarchical transit network, showed the result of a real data, and analyzed its applicability. Operating cost was estimated using a model which was established in this study, and minimum transit demand was derived from the operating cost. The minimum transit demand value is just a sample calculation, thus it varies by many inside and outside factors of the model. Looking at the inside of the model, operating cost and travel speed are major factors, and the possibility of introducing urban subway becomes high when the operating cost of the transit system is low and its travel speed is high. As far as the outside factors are concerned, according to the analysis on the network structure, transit demand, and transit mode share, the minimum transit demand value which was derived in this study will be the maximum value among the possible values. In the feasibility study, the benefit is likely to be overestimated and the cost is likely to be underestimated than those of this study. It could be concluded that the methodology of a feasibility study is appropriate in the field standard. This study analyzed the efficiency of introduction of urban subway using analytical approach, thus has many shortcomings and limitations. However the practical approach, like feasibility study, has some limitations as well. This study could be a basis on establishing an analysis framework that is more accurate and reasonable by comparing analytical approach and practical approach.

• Proceedings of the KOR-KST Conference
• /
• 2003.02a
• /
• pp.3-18
• /
• 2003

본 논문은 ATMS와 ATIS에서 요구되는 교통관리 및 정보제공의 효과분석을 위해, 운전자의 주행 및 경로선택 의사결정과 교통제어에 대한 반응등 운전자 행태를 모의실험에 반영함으로써 교통시스템의 실시간 특성을 모사할 수 있는 모형을 구축하고 이를 기반으로 하는 미시적 교통 모의실험기를 개발하는 것을 목적으로 하였다. 본 연구에서는 운전자, 차량, 교통망, 검지 및 신호시스템, 교통정보제공시스템 등을 교통시스템의 주요 구성요소로 설정하였으며 운전자 및 차량특성, 차두시간분포와 차량발생모형, 차량주행모형, 차로변경 및 간격수락모형, 경로선택모형을 주모의실험모형을 구성하는 부모형으로 결정하였다. 따라서 본 논문에서는 각각의 부모형들에 대한 최근의 연구결과들을 검토하고, 현실모사 능력과 함께 다른 부모형들과의 연계, 모의실험기의 구현상에서의 적합성 등을 고려하여 적정모형의 선정 및 수정, 새로운 부모형의 구축을 수행하였다. 구축된 부모형을 통합하여 교통모의실험기를 개발하였으며 구축된 모형의 타당성 및 적용성 검토를 위해 현장자료 및 가상자료를 이용한 검증을 수행하였다. 검증결과 모형의 목적인 교통제어 및 정보제공등의 시스템 대안의 평가에 이용 가능한 것으로 나타났다. 또한 본 논문의 연구결과는 교통제어 및 정보제공전략 대안의 평가뿐만 아니라 차량추종 및 차로변경 등의 미시적 교통모형 연구, 동적기종점 통행량 추정, 동적통행배정의 연구에도 활용할 수 있을 것으로 판단된다. 본 논문의 연구모형은 현단계에서는 현실의 모사 및 분석을 위한 도구보다는 새로운 대안들간의 비교평가를 위한 도구로 활용할 수 있을 것으로 판단된다. 이에 따라 현실모사의 정확도를 확보하기 위한 검증 및 개선이 필요할 것이며, 각 부모형들에 대한 계속적인 연구와 새롭게 발표되는 연구결과를 수용한 지속적인 개발이 필요할 것이다.유기적인 연계에 있음을 밝히고 있다. 건설을 위한 정책적 시사점과 동북아 연구개발정보 Portal 및 APEC APGrid 연구망 등의 구체적인 정보인프라 구축방안을 도출하였다.술 주기를 도출하고, 산업 내 평균 권리 청구 항목 수를 이용하여 각 산업의 기술 범위를 비교하였다. 각각의 동적 분석을 통해 시간에 따른 변화 양상이 관찰하였고, ANOVA 분석을 이용하여 통계적 유의성을 검증하였다. 본 연구는 현재의 기술 패러다임 내에서 Pavitt이 제시한 산업 분류의 근거를 보충 설명하였고 특허 정보를 이용하여 기술혁신의 산업별 유형에 대한 폭넓은 분석방법을 제시하였다.별 시간대별 효과분석을 통하여 정책의 시행여부가 결정되어야 할 것이다. 한편, 화물전용차선의 설치로 인한 물류비용의 절감을 보다 효과적으로 달성하기 위해서는 종합류류 전산망의 시급한 구축과 함께 화물차의 적재율을 높이고 공차율을 낮출 수 있는 운송체계의 수립이 필요한 것으로 판단된다. 그라나 이러한 화물전용차선의 효과는 단기적인 치유책일 수밖에 없기 때문에 물류유통 시설의 확충을 위한 사회간접자본의 구축을 서둘러 시행하여야 할 것이다.으로 처리한 Machine oil, Phenthoate EC 및 Trichlorfon WP는 비교적 약효가 낮았다.>$^{\circ}$E/$\leq$30$^{\circ}$NW 단열군이 연구지역 내에서 지하수 유동성이 가장 높은 단열군으로 추정된다. 이러한 사실은 3개 시추공을 대상으로 실시한 시추공 내 물리검층과 정압주입시험에서도 확인된다.. It was resulted from increase of weight of single cocoon. "Manta"2.5ppm produced 22.2kg of cocoon. It is equal to 9%

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.135-135
• /
• 2018

한강의 잠수교는 평상시에는 사람과 차의 통행이 가능하나 예측수위가 5.5m일 경우, 보행자통제, 6.2m일 경우, 차량통제를 실시한다. 잠수교는 국토교통부의 홍수예보 지점은 아니지만 그 특수성으로 인해 정확한 홍수위 예측을 통해 선행시간을 확보할 필요가 있다. 일반적으로 하천 홍수위 예측을 위해서는 강우-유출 모형과 하도추적을 위한 수리모형을 결합한 모델링이 요구되나 잠수교는 하류부 조위로 인한 배수 및 상류부 팔당댐 방류량의 영향을 받아 물리적 수리 수문모형의 구축이 상당히 제약적이다. 이에 본 연구에서는 딥러닝 오픈 라이브러리인 Tensorflow 기반의 LSTM 심층신경망(Deep Neural Network) 모형을 구축하여 잠수교의 수위예측을 수행한다. LSTM 모형의 학습과 검증을 위해 2011년부터 2017년까지의 10분단위의 잠수교 수위자료, 팔당댐의 방류량과 월곶관측소의 조위자료를 수집한 후, 2011년부터 2016년까지의 자료는 신경망 학습, 2017년 자료를 이용하여 학습된 모형을 검증하였다. 민감도 분석을 통해 LSTM 모형의 최적 매개변수를 추정하고, 이를 기반으로 선행시간(lead time) 1시간, 3시간, 6시간, 9시간, 12시간, 24시간에 대한 잠수교 수위를 예측하였다. LSTM을 이용한 1~6시간 선행시간에 대한 수위예측의 경우, 모형평가 지수 NSE(Nash-Sutcliffe Efficiency)가 1시간(0.99), 3시간(0.97), 6시간(0.93)과 같이 정확도가 매우 우수한 것으로 분석되었으며, 9시간, 12시간, 24시간의 경우, 각각 0.85, 0.82, 0.74로 선행시간이 길어질수록 심층신경망의 예측능력이 저하되는 것으로 나타났다. 하천수위 또는 유량과 같은 수문시계열 분석이 목적일 경우, 종속변수에 영향을 미칠 수 있는 가용한 모든 독립변수를 데이터화하여 선행 정보를 장기적으로 기억하고, 이를 예측에 반영하는 LSTM 심층신경망 모형은 수리 수문모형 구축이 제약적인 경우, 홍수예보를 위한 활용이 가능할 것으로 판단된다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.161-172
• /
• 2005

This study is to develop Bus Transit Route Analysis and Evaluation Model that can product the quantitative performance measures for Bus Transit Route Network Design. So far, in Korea, there are no so many models that evaluate a variety of other performance measures or service quality that are of concern to both the transit users and operator because of lower-level bus database system and transit route network analysis algorithm's limit. The BTRAEM in this research differ from the previous approach in that the BTRAEM employs a multiple path transit trip assignment model that explicitly considers the transfer and different travel time after boarding. And we develop input-output data structure and quantitative performance measure for the BTRAEM. In the numerical experimental applying BTRAEM to Mandl transit network, We got the meaningful results on performance measure of bus transit route network. In the future, we expect BTRAEM to give a good solution in real transit network.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.