• 대한토목학회논문집
• /
• 제30권6D호
• /
• pp.599-604
• /
• 2010

본 연구는 거리에 따른 유류비를 고려하여 시간가치를 산정하고, SP 조사를 통해 경로선택 시 통행시간, 통행요금과 함께 거리에 대한 유류비를 반영함이 타당한지 분석하는 것을 목적으로 하였다. 수준 차이를 고려한 SP 조사설계기법을 이용하여 SP 자료를 구축하여 분석하였으며, 통행시간, 통행요금 및 유류비에 대한 가치를 추정하기 위한 모형식을 구축하였다. 모형추정 결과, 경로선택 시 통행요금과 함께 유류비 역시 운전자의 경로선택에 영향을 미치는 것으로 나타났다. 경로선택에 있어 통행요금이 유류비에 비해 더 큰 것으로 나타났는데, 이는 통행요금이 현금지불경비(out-of-pocket expenses)인 반면 유류비 지출은 주기적이라는 특성 때문에 유류비가 통행요금에 비해 덜 민감하게 나타난 것으로 보인다.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2000년도 제37회 학술발표회논문집
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• 대한교통학회지
• /
• 제20권3호
• /
• pp.129-147
• /
• 2002

본 연구에서 변동등식에 근거한 동적경로선택조건을 도출하여 동적통행배정모형을 제안한다. 동적경로선택조건은 운전자에 의해 이용된 경로, 링크 그리고 출발지의 출발시간을 고려하여 도출되며 이 조건을 동적통행배정모형으로 전환하는 과정에서 모형의 변동등식문제로 압축된다. 등식이론에 근거한 모델의 이론적 배경을 입증하기 위해 제안된 동적통행배정모형이 필요충분조건을 만족함이 증명되었다. 해법으로서 기존의 제안된 네트워크의 시간과 공간확장기법을 채택하지 않고 물리적 네트워크가 직접 알고리즘에 반영되도록 하기 위해 각 링크의 시간대별 통행량과 방출통행량을 링크진입통행으로 표현하여 시간종속 통행시간함수를 단일변수로 처리하여 대각화알고리즘에 반영하였다. 소규모 비대칭 네트워크 적용결과 사용자 동적최적경로선택조건이 만족됨을 입증하였는데 단위시간간격이 적을수록 개선된 효과를 보여준다. I-394네트워크 실험결과로서 기존의 변동부등식에 근거한 알고리즘에 비해 제안된 알고리즘이 최소한 93%이상의 컴퓨터연산 속도의 개선효과를 가져왔다. 등식이론에 근거한 모델개발의 장점으로서는 제안된 모델의 최적해의 계산시간이 전체시간의 증가에 전혀 영향을 받지 않는다는 것으로 이는 동적통행배정모형에 적용될 네트워크의 규모가 커질수록 제안된 알고리즘의 계산 효율성은 더욱 증가하는 것을 의미한다. 따라서 제안된 동적통행배정모형은 대규모 시간종속적 교통망에서 교통상황의 변화에 민감하게 반응할 수 있는 실시간첨단교통제어의 핵심기능으로서 역할수행이 기대된다.

• 한국지능시스템학회논문지
• /
• 제5권3호
• /
• pp.92-100
• /
• 1995

Fuzzy reasoning has been applied to analysis of traffic problems on urban arterial road. As the analysis on factors of route choice has been already carried out, its result can be used for construction of the model. Route choice rate estimation by fuzzy reasoning was discussed from its structure and accuracy. The major objective of the study is to introduce some kinds of methods with fuzzy reasoning and to make their feature obvious. First, the production system model is introduced with consideration of reality to actual travel behavior. Second, overlapping areas of fuzzy language function are investigated. Finally, process of fuzzy reasoning was also considered. Five kinds of Fuzzy reasoning are compared to investigate in relation between shapes of membership function and estimation validity.

• 대한교통학회지
• /
• 제13권4호
• /
• pp.79-103
• /
• 1995

The elasticity of a model is considered most important. Without showing the proper elasticity any model cannot provide useful information for decision making. This paper demonstrates a macro model which can generate dynamic transport informations every 15 minutes. Without the Wardrop principles and the monotonicity assumptions for the link travel time and link volume relationship, the basic elements of this new modeling approache are composed of link density simulation, stochastic incremental route choice, departure time choice, destination choice and mode choice. The elasticity of the proposed model is examined based on elasticity equations and simulation results. Also the transferability from a mega city like Seoul to a big city like Daejon is demonstrated for the choice model. The issues centering around the dynamic relations among density(k), speed(u), and flow rate(v) are also discussed for the modeling of highly congested situations.

• 대한교통학회지
• /
• 제11권1호
• /
• pp.67-86
• /
• 1993

A formulation of dynamic traffic assignment between multiple origins and single destination was first introduced in 1987 by Merchant and Nemhauser, and then expanded for multiple destination in the late 1980's (Carey, 1987). Based on behavioral choice theory which provides proper demand elasticities with respect to changes in policy variables, traffic phenomena can be analysed more realistically, especially in peak periods. However, algorithms for these models are not well developed so far(working with only small toy network) and solutions of these models are not unique. In this paper, a new model is developed which keeps the simplicity of static models, but provides the sensitivity of dynamic models with changes of O-D flows over time. It can be viewed as a joint departure time and route choice model, in the given time periods(6-7, 7-8, 8-9 and 9-10 am). Standard multinomial logit model has been used for simulating the choice behavior of destination, mode, route and departure time within a framework of the incremental network assignment model. The model developed is workable in a PC 386 with 175 traffic zones and 3581 links of Seoul and tested for evaluating the exclusive use of Namsan tunnel for HOV and the left-turn prohibition. Model's performance results and their statistical significance are also presented.

• 대한교통학회지
• /
• 제34권6호
• /
• pp.570-579
• /
• 2016

Stepwise 환승계수(이하 STC)는 환승회수 증가에 따라 환승비용을 실제보다 많게 인식하도록 한다. 통행시간과 최소환승회수 정보를 제공하는 것은 이러한 경향을 감안하는 취지이다. STC가 포함된 경로탐색문제는 비가산성비용을 포함하며 최적조건의 비성립으로 경로열거가 요구된다. 따라서 대중교통망에서 STC를 고려하는 경로탐색에 대한 이론적 검토를 통해서 경로탐색의 실패를 우회하는 방안이 요구된다. 본 연구는 STC가 포함되는 대중교통망에서 확률적 통행배정모형에 대하여 검토한다. 비가산성 경로문제를 완화하는 방안으로 유입링크기반 전체경로삭제기법을 활용하는 방안을 제안한다. 전체경로삭제기법은 출발지에서 도착지까지 서로 상이한 경로의 구성된 가능경로집합을 구축하기 용이하다. STC를 반영한 경로기반 Logit 모형을 대중교통통행배정기법으로 구축한다.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 1999년도 제36회 학술발표회논문집
• /
• pp.483-488
• /
• 1999

• Journal of Information Processing Systems
• /
• 제17권5호
• /
• pp.879-891
• /
• 2021

With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

• 대한산업공학회지
• /
• 제36권1호
• /
• pp.32-41
• /
• 2010

DEA(Data Envelopment Analysis) is the relative efficiency measure among homogeneous DMU(Decision- Making Units) which can be used to useful tool to improve performance through efficiency evaluation and benchmarking. However, the general case of DEA was considered as unrealistic since it consists a benchmarking regardless of DMU characteristic by input and output elements and the high efficiency gap in benchmarking for inefficient DMU. To solve this problem, stratification method for benchmarking was suggested, but simply presented benchmarking path in repeatedly applying level. In this paper, we suggest a new method that inefficient DMU can choice the optimal path to benchmark the most efficient DMU base on the similarity among the input elements. For this, we propose a route choice method that combined a stratification benchmarking algorithm and SOM (Self-Organizing Map). An implementation on real environment is also presented.