• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2037-2043
• /
• 2015

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.2
• /
• pp.617-626
• /
• 2014

Lately, losses and damage from natural disasters have been increasing. Researchers across various fields in Korea are trying to come up with a response plan, but research for evacuation plans is still far from satisfactory. Hence this paper proposes a model that could find an optimized evacuation route for when disasters occur over wide areas. Development of the model used methods including the Dijkstra shortest path algorithm, feasible path method, genetic algorithm, and pareto efficiency. Computations used parallel computing (SPMD) for high performance. In addition, the developed model is applied to a virtual network to check the validity. Finally the adaptability of the model is verified on a real network by computating for Gumi 1stNational Industrial Complex. Computation results proved that this model is valid and applicable by comparison of the fitness values for before optimization and after optimization. This research can contribute to routing for responder vehicles as well as planning for evacuation by objective when disasters occur.

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

• Journal of KIBIM
• /
• v.7 no.2
• /
• pp.1-7
• /
• 2017

Urban planning involves many different disciplines. In order for the related stakeholders to have better understanding and acceptable outcomes, planners are required to present a methodology that would properly reflect people's interest. In order to justify the demand and distribute people's interest, planners actively utilized the suitability analysis. Accordingly, a suitability analysis to find the optimal route for high-speed rail was performed in this paper. With ArcGIS and geographic data sets, simple map algebra could be used. The final product of this research was a map indicating the suitable routes for high-speed rail using the shortest path analysis.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

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

• Journal of Internet Computing and Services
• /
• v.23 no.1
• /
• pp.1-9
• /
• 2022

Recently, interest in living safety and crime prevention is increasing. The reality is that most women have anxiety about social safety and ultimately want a safe return to home. As a result of these issues, the Seoul Metropolitan Government and the National Police Agency are implementing various services to alleviate them. However, there are limitations such as that the service can be used only during a limited time or the process of checking whether the patrol is really completed is complicated. Therefore, in this paper, we propose a service platform that overcomes these limitations and suggests the best and shortest patrol route to the police based on the desired patrol location applied by citizens. It is designed based on the MVC pattern, and the functions are divided for each user. It is hoped that the platform will reduce crime rates and allow citizens to ultimately return home with peace of mind. Also we expect that the police will ablet to find places where they did not know about or need to patrol with more attention through the recommended route of the platform, which will be helpful in their task.

• Journal of Korean Society of Transportation
• /
• v.23 no.8 s.86
• /
• pp.171-179
• /
• 2005

This paper presents the algorithm using fuzzy inference that preestimates each link speed changed by different kinds of road situations. The elements we are considered are time zone, rainfall probability information and lane control information. This paper is consists of three parts. First of all we set up the fuzzy variables, and preestimate link speed changed by various road situations. For this process, we build the membership functions for each fuzzy variable and establish the fuzzy inference relations to find how fuzzy variables influence on link speed. Second, using backtracking method, we search the shortest route influenced by link speed changed by fuzzy inference. Third, we apply this algorithm to hypothetical network and find the shortest path. As a result, it is shown that this algorithm choose appropriate roundabout path according to the changing road situations.

• Journal of The Korean Association of Information Education
• /
• v.20 no.3
• /
• pp.243-254
• /
• 2016

This study has produced a checker of the shortest path search problem with a total of 19 questions as a web-based computer evaluation based on the 'TRAFFIC' questions of PISA 2012. It is because the computer has been settled as an indispensable and significant instrument in the process of solving the problems of everyday life and as a media that is underlying in assessment. Therefore, information gifted students should be able to solve the problem using the computer and give clear enough commands to the computer so that it can perform the procedure. In addition, since it is the age that the computational thinking is affecting every sectors, it should give students new educational stimuli. The relationship between the rate of correct answers and the time took to solve the problem through the shortest route search process showed a significant correlation the variable that affected the problem solving as the difficulty of the question rises due to the increase of nodes and edges turned out to be the node than the edge. It was revealed that information gifted students went through algorithmic thinking in the process of solving the shortest route search problem. And It could be confirmed cognitive characteristics of the information gifted students such as 'ability streamlining' and 'information structure memory'.

• Journal of Korean Society of Rural Planning
• /
• v.11 no.1 s.26
• /
• pp.1-8
• /
• 2005

The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.