• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.652-657
• /
• 2014

Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• 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 the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.171-179
• /
• 2013

The primary function of navigation system is to provide route search and road guidance for safe driving for drivers. However, the existing route search system provides a simple service that looks up the shortest route using a safe driving DB without considering different road characteristics for the safety of the drivers. In order to maintain the safe driving, rather than searching the shortest path, a navigation system, in which the danger areas and/or the dangerous time zones have been considered, is required. Therefore, in this paper we propose a strategy of searching a navigation path to avoid danger areas for safe driving by using the A* algorithm. In the strategy, when evaluating the path-specific fitness of the navigation nodes, different heuristic weights were assigned to different types of risk areas. In particular, we considered three kinds of danger areas, such as accident-prone sections where accidents occur frequently, school zones, and intersection regions, as well as the time slots when the probability of danger is high. From computer simulation, the results demonstrate that the proposed scheme can provide the way to avoid danger areas on the route searching and confirm the possibility of providing the actual service.

• 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 Information Processing Systems
• /
• v.19 no.1
• /
• pp.46-54
• /
• 2023

To improve the railway transportation capacity and maximize the benefits of railway transportation, a method for layout optimization of railway transportation route based on deep convolution neural network is proposed in this study. Considering the transportation cost of railway transportation and other factors, the layout model of railway transportation route is constructed. Based on improved ant colony algorithm, the layout model of railway transportation route was optimized, and multiple candidate railway transportation routes were output. Taking into account external information such as regional information, weather conditions and actual information of railway transportation routes, optimization of the candidate railway transportation routes obtained by the improved ant colony algorithm was performed based on deep convolution neural network, and the optimal railway transportation routes were output, and finally layout optimization of railway transportation routes was realized. The experimental results show that the proposed method can obtain the optimal railway transportation route, the shortest transportation length, and the least transportation time, maximizing the interests of railway transportation enterprises.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.42-53
• /
• 2000

The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

• Journal of Korean Society of Transportation
• /
• v.11 no.2
• /
• pp.63-84
• /
• 1993

The main purpose of this paper is to develop a route guidance system which is a part of the intelligent vehicle-highway system and to apply to a real world in order to evaluate usefulness of the system. To this end, significant literature review works with regard to vehicle navigation and route guidance systems were conducted and have provided an important information about state-of-the-art systems developed and tested by the advanced countries. A geographic information system, called INTGIS, was used to find the shortest path in a given road network. Three scenarios to find minimum path were simulated and observed : 1) with-constraint on intersections and road segments, 2) without-constraint on intersections and road segments, and 3) via several stops from origin to destination. Based on a series of experiments, the results indicate that the route guidance system developed in this research is very useful to inform drivers on highway and arterial the traffic informations such as congestion and incident.

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.2
• /
• pp.110-118
• /
• 2015

Weather routing method is one of the best practices of SEEMP (Ship Energy Efficiency Management Plan) for fuel-efficient operation of ship. KR is carrying out a basic research for development of the weather routing algorithm and making a monitoring system by FOC (Fuel Oil Consumption) analysis compared to the reference, which is the great circle route. The added resistances applied global sea/weather data can be calculated using ship data, and the results can be corrected to ship motions. The global sea/weather data such as significant wave height, ocean current and wind data can be used to calculate the added resistances. The reference route in a usual navigation is the great circle route, which is the shortest distance route. The global sea/weather data can be divided into grids, and the nearest grid data from a ship's position can be used to apply a ocean going vessel's sea conditions. Powell method is used as an optimized routing technique to minimize FOC considered sea/weather conditions, and FOC result can be compared with the great circle route result.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.36-40
• /
• 2002

Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.