• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2221-2229
• /
• 2006

Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.137-141
• /
• 2005

Optimal path search algorithm should consider traffic flows of the roads as well as the distance between a departure and destination, The existing path search algorithms, however, usually don't apply the continuously changed traffic flows. In this paper, we propose a new optimal path search algorithm. the algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road networks into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and $A^*$ algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.457-465
• /
• 2001

■ 필요성 1. 교통 혼잡으로 인한 물류비 상승으로 국가 경쟁력 약화 2. 기존 최단경로 알고리즘(Dijkstra, Floyd-Warshall 등)의 한계 3. 대규모 네트워크(NP-hard문제)→정보 사용자가 제시하는 시간 내에 정보를 제공 필요 4. 교통 제약(회전금지, U턴, U턴 금지, P-턴) → 실제 교통 상황과 순환 노드 고려가 필요 ■목적 1. 교통제약을 포함한 대규모 교통네트워크에서 실시간 교통정보를 바탕으로 제한된 시간 내에 차별화 된 다수 최적경로 산출 함 2. 유전자알고리즘(GA)을 적용한 동적경로안내시스템 개발(중략)

• Journal of Korea Multimedia Society
• /
• v.24 no.2
• /
• pp.312-319
• /
• 2021

This study aims to help users to have a more satisfying encounter based on the problems found by comparing and analyzing similar applications. That is, an application that derives intermediate points through the subway, which is a public transportation means, and provides information on nearby convenience facilities was proposed. The middle point calculation process uses the dijkstra algorithm, which stores the minimum number of nodes in the stored path from the first input location to the last location. The stack and arraylist are used to search all paths from the first input position to the last position, and then the path with the smallest number of nodes is selected. After that, the number of stations in the route is divided in half and the resulting station is output. In addition, this study provides information on convenience facilities near intermediate points in order to have differences from similar applications. It categorizes within a 1km radius of the point and provides a function that helps to conveniently identify only facilities around the middle point. In particular, by visualizing the number of convenience facilities with radar charts and numbers, it is possible to grasp the commercial district around the midpoint at a glance.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.385-391
• /
• 2013

As a solution for environmental problems caused by increasing number of vehicles, it is encouraged to use a bicycle as an environment-friendly transportation method. To vitalize the bicycle usage, it is a necessary to construct bicycle roads that are safe and suitable for users. Based on the previous research results, we assume the main purposes of bicycle usages are mainly local leisure activity and school commuting. Thus, the proposed method finds the shortest link between the existing bicycle road network and bicycle usage facilities such as leisure activity places or schools over public road network. Then, we carry out the RTK DGPS survey for the candidate links, and analyze the slopes of them. When the slope of a found link is larger than a threshold, an alternative link is re-found for the safety and convenience of a bicycle user. The proposed method is applied to the real bicycle road network in Mokpo, Chunnam and the results are discussed.

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

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.744-751
• /
• 2012

Air Traffic Management(ATM) is to control air traffic flow quickly and safely. For efficient ATM, the ability which calculate optimal route using filight plan and filght information is required. Especially for the time-sensitive air cargo, it is essential. In this paper, therefore, we present a dynamic route search algorithm which calculate optimal route dynamically. The conventional method using Dijkstra algorithm has a problem that recalculate the entire route when some airways are closed. However, the proposed algorithm recalculates only affected waypoints, so it finds optimal route quickly and accurately. Comparisons with the conventional method and the proposed algorithm show that the proposed algorithm provides better.

• Tunnel and Underground Space
• /
• v.24 no.1
• /
• pp.11-20
• /
• 2014

This study analyzed the optimal routes of auxiliary vehicles in an open-pit mine that need to traverse the entire mine through many working points. Unlike previous studies which usually used the Dijkstra's algorithm, this study utilized a heuristic algorithm for the Traveling Salesman Problem(TSP). Thus, the optimal routes of auxiliary vehicles could be determined by considering the visiting order of multiple working points. A case study at the Pasir open-pit coal mine, Indonesia was conducted to analyze the travel route of an auxiliary vehicle that monitors the working condition by traversing the entire mine without stopping. As a result, we could know that the heuristic TSP algorithm is more efficient than intuitive judgment in determining the optimal travel route; 20 minutes can be shortened when the auxiliary vehicle traverses the entire mine through 25 working points according to the route determined by the heuristic TSP algorithm. It is expected that the results of this study can be utilized as a basis to set the direction of future research for the system optimization of auxiliary vehicles in open-pit mines.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.162-169
• /
• 2022

In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A^* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A^* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.174-183
• /
• 2001

This study proposes an improved genetic algorithm (GA) to derive solutions for facility layout problems having inner walls and passages. The proposed algorithm models the layout of facilities on a flour-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities are calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared to an actual ship compartment layout.