• 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 Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.4
• /
• pp.281-290
• /
• 2017

Transportation plays a vital role in sustainable development, and moreover, bulk transportation provides cost effective movement of goods and human beings with less environmental issues. Nepal is a developing country with increasing urbanization and transportation demands. The growing interest of China to connect with Southeast Asia through Nepal has led to ambitious project proposal of Rasuwa Gadhi to Birgunj Railways, which is the shortest route from China to India. Lack of updated geospatial data has lead the concerned authorities in Nepal to be dependent on analysis and proposals from donor nations. Taking such considerations, based on GIS and free data, this study explores optimal routes to connect cites using slope and land cover. Based on reclassified slope, two shortest optimal routes were found. One passing through Baireni in Dhading and another through Kathmandu towards Birgunj with length of around 172 Kilometers. The study shows that available open source data can be used of preliminary feasibility studies and yet shows limitations for detailed economy based planning. Development and use of high resolution updated geospatial data is of high necessity for Nepal to become self-sustained in planning of development works.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.160-161
• /
• 2023

Currently, the ship's passage planning relies on the navigator officer's knowledge and empirical methods. However, as ship autonomous navigation technology has recently developed, automation technology for passage planning has been studied in various ways. In this study, we intend to generate an optimal route for a ship based on Q-learning, one of the reinforcement learning techniques. Reinforcement learning is applied in a way that trains experiences for various situations and makes optimal decisions based on them.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.252-259
• /
• 1998

Vehicle navigation systems employ a certain route planning algorithm that provides the shortest path between the starting point and the destination point. The performance of a given route planning algorithm is measured through the degree of optimal route selection and the time cost to complete searching an optimal path. In this paper, various route planning algorithms are evaluated through computer simulation based on a real digital map database. Among those algorithms evaluated in this paper, the Modified Bi-directional A${\ast}$ algorithm is found to be the best algorithm for use in vehicle navigation systems.

• Proceedings of KOSOMES biannual meeting
• /
• 2017.04a
• /
• pp.155-155
• /
• 2017

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.137-143
• /
• 2017

In this paper, we propose optimal route searching algorithm using ANN(Artificial Neural Network) and implement route searching system. Our proposed scheme shows that the route using artificial neural network is almost same as the route using Dijkstra's algorithm but the time in our propose algorithm is shorter than that of existing Dijkstra's algorithm. Proposed route searching method using artificial neural network has better performance than exiting route searching method because it use several weight value in making different routes. Through simulation, we show that our proposed routing system improves the performance and reduces time to make route irrespective of the number of hidden layers.

• Convergence Security Journal
• /
• v.11 no.5
• /
• pp.13-19
• /
• 2011

Mobile nodes in MANETs have the nature of unrestricted mobility so that they will join and leave the network frequently. Therefore, it important consideration to determine the optimal distance progress between relaying nodes along the route in order to maintain the established route for an arbitrary length of time (i.e., route duration). In this paper, we derived the link maintenance probability by considering the initial distance between two relaying nodes and node mobility. Based on the link maintenance probability, we further analyzed the route stability by considering the impact of distance progress between relaying nodes along the route.

• Management & Information Systems Review
• /
• v.29 no.4
• /
• pp.109-121
• /
• 2010

In this study, we propose a solution procedure to solve travelling salesman problem(TSP) with special cost function, route dependent travelling salesman problem(RDTSP). First, we develop an integer programming model to describe the problem. In the model, a variable means a possible route. And, the number of variables in this model are extremely large. So, we develop a LP relaxation problem of the IP model and solve the relaxation problem by a column generation technique. The relaxation problem does not guarantee the optimal solution. If we get an integer solution in the ralaxation problem, then the solution is an optimal one. But, if not, we cannot get an optimal solution. So, we approach a branch and price technique. The overall solution procedure can be applied a printed circuit board(PCB) assembly process.

• 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 Advanced Marine Engineering and Technology
• /
• v.28 no.7
• /
• pp.1159-1164
• /
• 2004

There is an Overhead Hoist Transport(OHT) for delivering the wafer in semiconductor processing. The transfer system is consists of carrier vehicle. rail, and support. OHTCMS(OHT Control and Management System) has to take the feature, such as the optimal control and integration with several OHT. In this paper, ESRA(Efficiency of Shortest - Route Algorithms) is proposed which can be transported optimal route and be prevented collision using the Floyd-Warshall algorithms. The proposed algorithm is verified through consecutive simulation for a long time.