• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3109-3116
• /
• 1998

본 논문에서는 대규모 병렬컴퓨터의 구현에 적합한 위상구조인 교차메쉬구조에서, 균등한 메시지분포를 갖고 메시지의 경쟁이 있는 실제적 상황에서 상호접속망내의 메시지의 경로를 선정하기 위한 방법들을 제안하고, 이의 성능을 검증하기 위해 우회 경로설정 알고리즘을 이용하여 시뮬레이션을 하였다. 교차메쉬의 특성상 최적경로의 수가 다른 구조들에 비해 다양하다는 특징을 이용하여 최적경로의 수를 우선순위에 반영한 우회조건 및 대각방향의 링크를 효율적으로 활용하기 위한 링크선정방법에 따를 교차메쉬의 최대지연(maximum delay), 평균지연(average delay) 및 메시지처리율(throughput)을 구하고 이를 비교 고찰하였다. 메시지 전송시 최적인 경로상의 링크에 경합이 생길 경우 최적 경로의 수가 적은 메시지가 높은 우선순위를 가지며 만약 같은 조건이라면 우회한 횟수가 많은 메시지가 높은 우선순위를 갖는 우회조건 LD를 사용하며 이 우선순위에 따라 경로를 선정할 차례가 된 메시지가 선택할 수 있는 최적경로의 수가 많을 경우 대각방향의 링크로 우선적으로 전송할 경우, 오래된 메시지가 높은 우선순위를 갖는 우회조건 A에 의한 방법에 비해 최대지연, 평균지연 및 메시지처리율에 있어서 각각 이상값에 대한 개선목표치의 약58%, 70% 및 31%의 성능개선이 있었다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.5
• /
• pp.425-433
• /
• 2012

Dijkstra's algorithm is one of well-known methods to find shortest paths over a network. However, more research on $A^*$ algorithm is necessary to discover the shortest route to a goal point with the heuristic information rather than Dijkstra's algorithm which aims to find a path considering only the shortest distance to any point for an optimal path search. Therefore, in this paper, we compared Dijkstra's algorithm and $A^*$ algorithm for bicycle route selection. For this purpose, the horizontal distance according to slope angle and average speed were calculated based on factors which influence bicycle route selection. And bicycle routes were selected considering the shortest distance or time-dependent shortest path using Dijkstra's or $A^*$ algorithm. The result indicated that the $A^*$ algorithm performs faster than Dijkstra's algorithm on processing time in large study areas. For the future, optimal path selection algorithm can be used for bicycle route plan or a real-time mobile services.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.2 no.1 s.2
• /
• pp.101-108
• /
• 2003

When drivers encounter multiple available routes, they may evaluate the utility of each route. Two important factors in the evaluation are travel time and travel cost. Without hewing the current travel time of each route, drivers' decisions are not necessarily optimum. It is called 'transparency issue' that drivers are blinded to choose the optimum route among the others because of the limited travel time information. As a result of this, competing route travel times tend to fluctuate. This case study to utilize the data of Namsan traffic information system confirms that this travel time fluctuation can be lessened as real time traffic information is provided.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2008.06a
• /
• pp.501-502
• /
• 2008

특정 지역에 대한 공간 분석을 하기 위해서는 많은 요소들을 고려해야 한다. 예를 들어 시설물을 설치한다거나 경과지역 내에서의 공간 분석이 필요할 경우, 법적 제한 요건 및 지형적 특성에 따라 공간 분석 패턴들을 다양하게 생성할 수 있기 때문이다. 이에 올바른 분석 기법의 선정이나 정확한 자료들의 수집은 필수적이라 할 수 있겠다. 따라서 본 연구에서는 해당 지역 내에서의 경과지 선정 기준을 알아보고 그에 따른 저항치와 경중률을 계산하여 각각의 지형적 요소에 적용시켜 분석을 실시하였다. 그리고 분석 시에는 Corridor와 같은 GIS 공간분석기법을 이용하여 해당 지역 내의 송전 철탑 설치를 위한 최적 경과지와 최적 경로를 선정하였다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.3-9
• /
• 2013

As interest in green growth picks up, the importance of bicycles which are an environment friendly means of communication has been magnified. However, bicycle routes which are the base of bicycles are designed without considering topographic elements and thus many users are experiencing inconvenience in using bicycles. The present study presents a routing technique to select optimal routes when selecting routes in commuting to school utilizing bicycles. To this end, a formula for optimum route calculation considering slope and intersections was drawn and a method to select optimum routes by applying modified Dijkstra Algorithms was studied. According to the results, the bicycle routes for commuting to school should be selected by the shortest time rather than the shortest distances to the destination, because it required reach the destination faster. Therefore when selecting the routes, it must be based on the shortest time considering waiting time due to crosswalks or crossroads and speed variations due to slopes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.227.2-231
• /
• 1998

서비스 반경이 1[km]이내인 마이크로셀 방식은 실제 이동국이 70[%]이상 전파 음영지역에 위치하기 때문에, 셀 반경내에 있는 지형과 구조물들에 의해 매우 큰 영향을 받는다. 그러므로, 셀내 지형지물의 형상에 따라 달라지는 전파경로를 추적하여 이동통신 전파환경을 분석함으로써 최적 기지국 위치를 선정할 필요가 있다. 따라서, 본 연구에서는 이동국이 가시거리 영역의 전파 음영지역 또는 가시거리 영역과 일정 경사각으로 기울어져 있는 비가시거리 영역에 위치한 경우로 구분하고, 삼각해석법에 의해 각 영역에서의 반사횟수의 전파 경로를 각각 연산처리하는 알고리즘을 개발하여 마이크로셀 PCS 이동통신 도심 전파환경에서 시뮬레이션하고, 그 결과를 분석함으로써 마이크로셀 이동통신 최적 기지국의 위치 선정 조건을 제시한다.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.451-457
• /
• 2012

Recently, as the use of real time traffic information of a car navigation system increases rapidly with the development of Intelligent Transportation Systems (ITS), path search is getting more important. Previous algorithms, however, are mostly for the shortest distance searching and provide route information using static distance and time information. Thus they could not provide the most optimal route at the moment which changes dynamically according to traffic. Accordingly, in this study, Semantic Shortest Path algorithm with Reduction ratio & Distance(SSP_RD) is proposed to solve this problem. Additionally, a routing model based on velocity reduction ratio and distance and a dynamic route link map are proposed.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.169-177
• /
• 2018

There is a lot of loss of life due to natural disasters. In particular, flood damage caused by heavy rainfall in urban areas causes serious damage. Therefore, in this study, we conducted a study on the optimal evacuation route for safe evacuation of urban areas. We set up a methodology by reviewing Flo-2D model and A* algorithm. A Flo-2D model was used to derive the hazardous area, and we selected the starting points with many people and suggested ways to select safe evacuation sites. And the route was derived from the starting point to the safe evacuation point by using the A * algorithm. This study could be used not only for evacuation route but also for road maintenance and evacuation facilities.

• 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.