• Asia pacific journal of information systems
• /
• 제19권2호
• /
• pp.117-137
• /
• 2009

Recently, intelligent traffic information systems have enabled people to forecast traffic conditions before hitting the road. These convenient systems operate on the basis of data reflecting current road and traffic conditions as well as distance-based data between locations. Thanks to the rapid development of ubiquitous computing, tremendous context data have become readily available making vehicle route planning easier than ever. Previous research in relation to optimization of vehicle route planning merely focused on finding the optimal distance between locations. Contexts reflecting the road and traffic conditions were then not seriously treated as a way to resolve the optimal routing problems based on distance-based route planning, because this kind of information does not have much significant impact on traffic routing until a a complex traffic situation arises. Further, it was also not easy to take into full account the traffic contexts for resolving optimal routing problems because predicting the dynamic traffic situations was regarded a daunting task. However, with rapid increase in traffic complexity the importance of developing contexts reflecting data related to moving costs has emerged. Hence, this research proposes a framework designed to resolve an optimal route planning problem by taking full account of additional moving cost such as road traffic cost and weather cost, among others. Recent technological development particularly in the ubiquitous computing environment has facilitated the collection of such data. This framework is based on the contexts of time, traffic, and environment, which addresses the following issues. First, we clarify and classify the diverse contexts that affect a vehicle's velocity and estimates the optimization of moving cost based on dynamic programming that accounts for the context cost according to the variance of contexts. Second, the velocity reduction rate is applied to find the optimal route (shortest path) using the context data on the current traffic condition. The velocity reduction rate infers to the degree of possible velocity including moving vehicles' considerable road and traffic contexts, indicating the statistical or experimental data. Knowledge generated in this papercan be referenced by several organizations which deal with road and traffic data. Third, in experimentation, we evaluate the effectiveness of the proposed context-based optimal route (shortest path) between locations by comparing it to the previously used distance-based shortest path. A vehicles' optimal route might change due to its diverse velocity caused by unexpected but potential dynamic situations depending on the road condition. This study includes such context variables as 'road congestion', 'work', 'accident', and 'weather' which can alter the traffic condition. The contexts can affect moving vehicle's velocity on the road. Since these context variables except for 'weather' are related to road conditions, relevant data were provided by the Korea Expressway Corporation. The 'weather'-related data were attained from the Korea Meteorological Administration. The aware contexts are classified contexts causing reduction of vehicles' velocity which determines the velocity reduction rate. To find the optimal route (shortest path), we introduced the velocity reduction rate in the context for calculating a vehicle's velocity reflecting composite contexts when one event synchronizes with another. We then proposed a context-based optimal route (shortest path) algorithm based on the dynamic programming. The algorithm is composed of three steps. In the first initialization step, departure and destination locations are given, and the path step is initialized as 0. In the second step, moving costs including composite contexts into account between locations on path are estimated using the velocity reduction rate by context as increasing path steps. In the third step, the optimal route (shortest path) is retrieved through back-tracking. In the provided research model, we designed a framework to account for context awareness, moving cost estimation (taking both composite and single contexts into account), and optimal route (shortest path) algorithm (based on dynamic programming). Through illustrative experimentation using the Wilcoxon signed rank test, we proved that context-based route planning is much more effective than distance-based route planning., In addition, we found that the optimal solution (shortest paths) through the distance-based route planning might not be optimized in real situation because road condition is very dynamic and unpredictable while affecting most vehicles' moving costs. For further study, while more information is needed for a more accurate estimation of moving vehicles' costs, this study still stands viable in the applications to reduce moving costs by effective route planning. For instance, it could be applied to deliverers' decision making to enhance their decision satisfaction when they meet unpredictable dynamic situations in moving vehicles on the road. Overall, we conclude that taking into account the contexts as a part of costs is a meaningful and sensible approach to in resolving the optimal route problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.2805-2826
• /
• 2021

In most cases, the routing policy of networks shows a preference for a static one-to-one mapping of communication pairs to routing paths, which offers adversaries a great advantage to conduct thorough reconnaissance and organize an effective attack in a stress-free manner. With the evolution of network intelligence, some flexible and adaptive routing policies have already proposed to intensify the network defender to turn the situation. Routing mutation is an effective strategy that can invalidate the unvarying nature of routing information that attackers have collected from exploiting the static configuration of the network. However, three constraints execute press on routing mutation deployment in practical: insufficient route mutation space, expensive control costs, and incompatibility. To enhance the availability of route mutation, we propose an OpenFlow-based route mutation technique called Polymorphic Path Transferring (PPT), which adopts a physical and virtual path segment mixed construction technique to enlarge the routing path space for elevating the security of communication. Based on the Markov Decision Process, with considering flows distribution in the network, the PPT adopts an evolution routing path scheduling algorithm with a segment path update strategy, which relieves the press on the overhead of control and incompatibility. Our analysis demonstrates that PPT can secure data delivery in the worst network environment while countering sophisticated attacks in an evasion-free manner (e.g., advanced persistent threat). Case study and experiment results show its effectiveness in proactively defending against targeted attacks and its advantage compared with previous route mutation methods.

• 대한교통학회지
• /
• 제22권5호
• /
• pp.111-122
• /
• 2004

본 연구에서는 운전자들의 경로선택 행태에서 교통정보 수신율이 네트워크 전반에 미치는 영향과 각 경로의 주행조건에 대한 운전자의 학습과정에 대해서 살펴보았으며, 교통상황이 정상성 및 비정상성을 따르는 경우, 공공기관의 유입교통량의 대소에 의해 유도되는 정보의 수신율이 증가함으로써 운전자의 경로선택행동이 네트워크에 미치는 영향을 분석하고 정보의 역효과가 나타남을 밝혔다. 또한, 정보수신율이 최적비율 이하인 경우에는 총통행시간이 정보가 없이 오직 자신의 경험에만 의존하는 경우보다 감소하여 정보제공의 효과가 있었지만, 최적비율 이상으로 유동정보에 따라 경로선택을 하는 운전자가 많아지면 정보의 역효과가 발생함도 증명하였다. 나아가, 교통환경이 정상성을 /따르는 경우에는 모든 운전자의 경로조건에 대한 학습과정과 이 경험을 축적함에 따라 어느 일정한 값으로 수렴해감을 알 수 있었다. 교통환경이 비정상성을 따르는 경우에는 주행조건에 대해 돌발적인 진동과 혼란상태가 발생하고 이 경우에도 무정보 환경보다는 어느정도의 비율로 유도정보가 주어지는 것이 네트워크 전체의 통행시간을 감소시킴으로써 정보의 효과가 있음도 확인하였다. 향후, 다양한 교통류 환경을 적용한 대규모 네트워크를 대상으로 한 운전자의 경로선택과 학습행동에 대한 연구와 정보의 정도에 따른 운전자의 행동을 고려한 정보의 제공방안에 대한 연구도 필요할 것으로 판단된다.

• 환경영향평가
• /
• 제23권6호
• /
• pp.517-526
• /
• 2014

본 연구는 객관적 방법으로써의 계층분석법(AHP)를 사용하여 최적의 철도사업의 노선선정에 있어서 필요한 환경 평가에 대한 중점항목의 가중치를 제시하여, 환경친화적인 노선 선택을 위한 정량적 기준을 제공하고자 하였다. AHP는 계층구조로 복합적인 선택 기준을 가진 각 기준들의 상대적 중요도를 평가하고, 대안들의 전체적인 우선 순위를 결정하는 의사결정의 접근법이다. 본 연구의 목적을 위해, 각 분야별 환경영향평가 검토를 담당하는 전문가 설문에 기초하여 철도사업 노선선정에 있어서 주요 환경평가 항목의 순위와 가중치를 정립하였다. 그 결과, AHP에 의한 가중치는 동 식물상, 지형 지질, 자연환경자산, 소음 진동, 수질, 위락 경관, 대기질 등 자연생태분야가 높게 나타났다. 보다 효율적인 환경친화적 노선 선정 체계를 개발하기 위해서는 환경적인 측면에 더불어, 기술적, 경제적, 사회적 측면도 고려되어야 할 것이다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제29권2호
• /
• pp.287-306
• /
• 2020

Purpose Youth unemployment is a social problem that continues to emerge in Korea. In this study, we create a model that predicts the employment of college graduates using decision tree, random forest and artificial neural network among machine learning techniques and compare the performance between each model through prediction results. Design/methodology/approach In this study, the data processing was performed, including the acquisition of the college graduates' vocational path survey data first, then the selection of independent variables and setting up dependent variables. We use R to create decision tree, random forest, and artificial neural network models and predicted whether college graduates were employed through each model. And at the end, the performance of each model was compared and evaluated. Findings The results showed that the random forest model had the highest performance, and the artificial neural network model had a narrow difference in performance than the decision tree model. In the decision-making tree model, key nodes were selected as to whether they receive economic support from their families, major affiliates, the route of obtaining information for jobs at universities, the importance of working income when choosing jobs and the location of graduation universities. Identifying the importance of variables in the random forest model, whether they receive economic support from their families as important variables, majors, the route to obtaining job information, the degree of irritating feelings for a month, and the location of the graduating university were selected.

• 해양환경안전학회지
• /
• 제24권1호
• /
• pp.10-17
• /
• 2018

종합 안전관리체계인 e-navigation을 준비하기 위해 선박의 의도된 경로를 선박 대 선박, 그리고 선박 대 육상 간에 공유하는 경로교환에 대한 연구가 활발히 진행 중이다. 하지만 경로교환을 위한 기술적인 측면에서의 연구 개발은 진행되고 있으나, 그 효과나 문제점 등 도입 필요성에 대한 연구는 부족한 실정이다. 본 연구는 선박조종 시뮬레이션을 통해 경로교환이 항해 안전에 미치는 영향을 정량적으로 분석하고, 시뮬레이션 수행자들의 주관적인 평가를 종합하여 경로교환의 효과를 검증하였다. 선박 간 경로교환을 할 경우 최초 충돌회피 시점은 평균 3.43분 더 빨라졌으며, 충돌회피 방향은 60 %가 변경되었다. 또한 타선 A와의 최근접점은 31 % 더 가까워지고, 평균 타 사용지수는 57 % 줄어들었다. 그리고 설문 응답자의 95 %는 경로교환이 충돌회피 의사결정에 영향, 85 %는 안전운항에 긍정적인 영향, 90 %는 사고예방 효과, 70 %는 항해사의 심리적 부담 경감, 70 %는 경로교환을 실무에 도입해야한다고 답하였다.

• 한국측량학회지
• /
• 제37권5호
• /
• pp.303-313
• /
• 2019

After a disaster happens in urban areas, many people need support for a quick evacuation. This work aims to develop a method for the calculation of the most feasible evacuation route inside buildings. In the methodology we simplify the geometry of the structural and non structural elements from the BIM (Building Information Modeling) to store them in a spatial database which follows standards to support vector data. Then, we apply the multicriteria analysis with the allocation of prioritization values and weight factors validated through the AHP (Analytic Hierarchy Process), in order to obtain the Importance Index S(n) of the elements. The criteria consider security conditions and distribution of the building's facilities. The S(n) is included as additional heuristic data for the calculation of the evacuation route through an algorithm developed as a variant of the $A^*$ pathfinding, The experimental results in the simulation of evacuation scenarios for vulnerable people in healthy physical conditions and for the elderly group, shown that the conditions about the wide of routes, restricted areas, vulnerable elements, floor roughness and location of facilities in the building applied in the multicriteria analysis has a high influence on the processing of the developed variant of $A^*$ algorithm. The criteria modify the evacuation route, because they considers as the most feasible route, the safest instead of the shortest, for the simulation of evacuation scenarios for people in healthy physical conditions. Likewise, they consider the route with the location of facilities for the movement of the elderly like the most feasible in the simulation of evacuation route for the transit of the elderly group. These results are important for the assessment of the decision makers to select between the shortest or safest route like the feasible for search and rescue activities.

• 대한교통학회지
• /
• 제21권1호
• /
• pp.103-113
• /
• 2003

본 연구는 교통 경로 탐색 가운데, 우회 경로 탐색과 선호 경로 탐색을 하였으며, 계층 분석법을 적용한 퍼지비가법 제어기 사용을 제안한다. 이것은 기존의 경로 탐색과는 달리, 인간의 사고과정에 착안한 것으로, 애매한 주관적 판단을 정량적으로 분석, 평가하였다. 그리고 중요도를 운전 전문가로부터 의견 수렴한 것을 기초로 도출하였으며, 실제효용성을 진단하고자 경로 모델의 예를 사용하였다. 모델 평가는 평가 요소에 대한 속성 소속 함수화 및 평가치 규정, 계층 분석법에 의한 중요도 결정, $\lambda$-퍼지 척도에 의한 중요도의 비 가법적 표현, Choquet 퍼지 적분 등으로 수행하였다. 결국, 우회 경로 탐색 결과, 시시각각 변하는 교통환경에 적응할 수 있는 실 시간적인 교통 경로 제어가 가능하였으며, 선호 경로 탐색 결과, 본 연구의 알고리즘이 운전자 개인의 교통 경로 선택 성향을 잘 반영함을 보여 주었다. 논문은 5 가지의 중요한 의미가 있다. (1) 제안된 접근 방법은 운전자의 경로 선택 결정 과정과 유사하다. (2) 제안된 접근 방법은 다 속성의 경로 평가 기준을 제어 할 수 있다. (3) 제안된 접근 방법은 운전자의 주관적 판단을 비가법적으로 객관화 할 수 있다. (4) 제안된 접근 방법은 우회 경로 탐색에서 동적인 경로 탐색을 보여주고 있다 (5) 제안된 접근 방법은 선호 경로 탐색에서 개개 운전자 속성을 고려할 수 있다.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.19-32
• /
• 1998

This paper addresses the processing route of parts and economic design in flexible manufacturing systems (FMSs) employing AGVs for Transport. Parts are processed through several workstations according to operation sequences. The machine of each workstation can do multiple operation functions. The operation stage of a part can be processed in several workstations, which are non-identical in functional performance. The objective of this paper is to determine the processing route of parts, number of machines at each workstation, number of vehicles. The model is assumed that the operation stage of parts can be processed at the only one among several available workstations. Parts are transported by automated guided vehicle system(AGVS). The decision criteria is to minimize the sum of processing cost, travel cost, operating cost. A model formulation is represented. A solution algorithm is suggested by using mathematical programming and simulation technique, and a numerical example is shown.

• International Journal of Computer Science & Network Security
• /
• 제23권11호
• /
• pp.43-52
• /
• 2023

The paper aims to clarify how to make a decision using geographic information systems and how to choose the best route between two cities to suit the expectations of the driver and his sense of safety and comfort on the road. Use a special model for network analysis, where the network analysis tool relied on the following data (maximum speed of the road - number of intersections - road width - peak period) in choosing the best safe path. The paper concluded that the best safe route for refugees between the cities of Khartoum - Arqin crossing is ( Khartoum - Shendi - Atbara - Meroe - Abu Hamad - Wadi Halfa). We advise all GIS users to use the theories of spatial analysis when creating a new model.