• Journal of Distribution Science
• /
• v.18 no.4
• /
• pp.39-50
• /
• 2020

Purpose: This paper aimed to study the current locations of post offices to analyze service coverage area for parcel delivery in the Eastern Economics Corridor (EEC), which must be considered in the last mile to extend delivery service for e-commerce growth. Thailand Post was the case study in this paper. Research design, data and methodology: To involve solving the delivery service area under the last mile condition, the authors proposed a network analysis to determine service radius by employing a Geographic Information System (GIS). Furthermore, this paper applied Dijkstra's algorithm as a network analysis tool from GIS for analyzing the last mile service coverage area in a new economics zone. At the same time, the authors suggested an approach as a solution to locate last mile delivery center in EEC. Results: The results of the study pointed out that Thailand Post should consider more last mile delivery centers in EEC to support its express service in urban areas as well as improve the efficiency of service coverage for parcel delivery and create more advantages against competitors. Conclusions: This paper proposes a network analysis to extend the last mile service for parcel delivery by following Dijkstra's algorithm from GIS and a solution approach to add more last mile delivery centers. The results of the research will contribute to boosting customer satisfaction for last mile delivery service and enabling easy accessibility to a service center in EEC.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.188-191
• /
• 2011

Path finding and path planning is crucial in today's world where time is an extremely valuable element. It is easy to plan the optimum path to a destination if provided a map but the same cannot be said for an unknown and unexplored environment. It will surely be exhaustive to search and explore for paths to reach the destination, not to mention planning for the optimum path. This is very much similar to finding for an exit of a maze. A very popular competition designed to tackle the maze solving ability of autonomous called Micromouse will be used as a guideline for us to design our maze. There are numerous ways one can think of to solve a maze such as Dijkstra's algorithm, flood fill algorithm, modified flood fill algorithm, partition-central algorithm [1], and potential maze solving algorithm [2]. We will analyze these algorithms from various aspects such as maze solving ability, computational complexity, and also feasibility to be implemented.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.260-262
• /
• 2021

In recent years, many studies are being conducted to reduce the damage to humans in the event of a fire. In case of fire in large cities, evacuation route guidance services are provided using Mobile GIS (geographic information system). However, among the algorithms used in the existing evacuation route system, Dijkstra Algorithm has a problem that when the cost is negative, it cannot obtain an infinite loop or an accurate result value, and does not help to select an appropriate shortest route by searching all routes. For this reason, in this paper, we propose the shortest route guidance system based on A^* Algorithm. In case of fire, the shortest route is searched and the shortest route is visualized and provided using a map service on a mobile device using mobile GIS.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.17-26
• /
• 1998

Shortest path problem in road network with turn penalties and prohibitions frequently arises from various transportation optimization models. In this paper, we propose a new algorithm for the shortest Path problem with turn prohibitions and delays. The proposed algorithm maintains distance labels of arcs, which is similar to labels of nodes of Dijkstra's algorithm. Fibonacci heap implementation of the proposed algorithm solves the problem in O(mn ＋ mlogm). We provide a new insight in transforming network with turn penalties and prohibitions into another network in which turn penalties and prohibitions are implicitly considered. The proposed algorithm is implemented using new data structure and compared with Ziliaskopoulos' algorithm. Computational results show that the proposed algorithm is very efficient.

• IE interfaces
• /
• v.24 no.4
• /
• pp.304-313
• /
• 2011

An Unmanned Aerial Vehicle(UAV) is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are currently employed in many military missions(surveillance, reconnaissance, communication relay, targeting, strike etc.) and a number of civilian applications(communication service, broadcast service, traffic control support, monitoring, measurement etc.). For accomplishing the UAV's missions, guarantee of survivability should be preceded. The main objective of this study is the path planning to maximize survivability for UAV based on 3-dimensional environment. A mathematical programming model is suggested by using MRPP(Most Reliable Path Problem) and solved by transforming MRPP into SPP(Shortest Path Problem). This study also suggests a $A^*PS$ algorithm based on 3-dimensional environment to UAV's path planning. According to comparison result of the suggested algorithm and SPP algorithms (Dijkstra, $A^*$ algorithm), the suggested algorithm gives better solution than SPP algorithms.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.2
• /
• pp.45-56
• /
• 2007

As function and scale of the transit center get larger, the efficient guidance system in the transit center is essential for transit users in order to find their efficient routes. Although there are several studies concerning optimal path for the road, but insufficient studies are executed about optimal path inside the building. Thus, this study is to develop the algorithm about optimal path for car owner from the basement parking lot to user's destination in the transfer station. Based on Dijkstra algorithm which calculate horizontal distance, several factors such as fatigue, freshness, preference, and required time in using moving devices are objectively computed through rank-sum and arithmetic-sum method. Moreover, optimal public transportation is provided for transferrer in the transfer station by Neuro-Fuzzy model which is reflected on people's tendency about public transportation mode choice. Lastly, some scenarios demonstrate the efficiency of optimal path algorithm for pedestrian in this study. As a result of verification the case through the model developed in this study is 75 % more effective in the scenario reflected on different vertical distance, and $24.5\;{\sim}\;107.7\;%$ more effective in the scenario considering different horizontal distance, respectively.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.17-29
• /
• 2010

A container terminal productivity is maximized by a minimized time for processing containers. So, we have been elevated the container terminal productivity through an improvement of computing system, but there are a limitation because of problems for transportation management and method. A Y/T(Yard Tractor), which is a representative transportation, is able to do only one process, loading or unloading, at one time. So if the Y/T can do loading and unloading step by step at a same time, the processing time would be shortened. In this paper, we proposed an effective operating process of Y/T(Yard Tractor) Multi-Cycle System by applying RTLS(Real Time Location System) to Y/T(Yard Tractor) in order to improve the process of loading and unloading at the container terminal. For this, we described Multi-Cycle System. This system consists of a real time location of Y/T based on RTLS, an indicating of Y/T location in real time with GIS technology, and an algorithm(Dijkstra's algorithm) of the shortest distance. And we used the system in container terminal process and could improve the container terminal productivity. As the result of simulation for the proposed system in this paper, we could verify that 9% of driving distance was reduced compared with the existing rate and 19% of driving distance was reduced compared with the maximum rate. Consequently, we could find out the container performance is maximized.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.494-497
• /
• 2022

Recently, the damage caused by flash floods caused by extreme weather due to global warming is increasing. In order to reduce the damage, this paper conducted a study on the search for the shortest route of an evacuation route due to a flash flood. For this, we implemented a route search system using GIS and shape files including buildings and roads and Dijkstra's algorithm. In this study, the location of users close to the point where the flash flood occurs is identified, and the evacuation route is searched from the starting point to the destination point without passing through the dangerous point. Evacuate out of the test bed, or designate a building in the test bed as an evacuation shelter, and search for a route to the nearest evacuation shelter. Accordingly, it is expected that human damage will be reduced by providing the shortest evacuation route.

• Journal of Communications and Networks
• /
• v.9 no.1
• /
• pp.84-92
• /
• 2007

This paper deals with the creation of multicast trees in a differentiated services (DiffServ) domain. Initially, we model the integration problems of multicast & DiffServ and give a general de-scription of our framework for multicast provisioning in DiffServ domains. Within this framework, we introduce a novel heuristic algorithm which calculates the multicast trees efficiently. The multicast tree's format and the bandwidth constraints per service class are modeled. The heuristic is based on the Dijkstra's shortest path algorithm and aims to produce the cheapest possible trees (Steiner tree problem) that conform to the defined model. The produced trees can be considered as DiffServ-customized Steiner trees. Furthermore, we evaluate the algorithm with theoretical and experimental analysis and finally, we present our conclusions.