• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of Advanced Navigation Technology
• /
• v.24 no.6
• /
• pp.500-507
• /
• 2020

This paper presents a risk assessment methodology for standard flight procedures using recorded automatic dependent surveillance-broadcast (ADS-B) data. Utilizing the proposed methodology, the results of risk analyses in RKSI (incheon international airport) and RKSS (gimpo international airport) using trajectories that are regenerated based on 100 days of ADS-B data are presented. For the risk metric, detect and avoid well clear (DWC) is used. With this index, each procedure was evaluated for the sections with highest level of risk. Among the standard instrument departure (SID) of RKSI, the section between SI712 and RANOS of RNAV BOPTA 1L showed the highest level of risk. For the standard terminal arrival route (STAR) of RKSI, section between SI947 and DANAN of RNAV GUKDO 1N wasthe one with the highest level of risk. For RKSS, the segment between SS726 and SS727 of RNAV BULTI 1X and the segment between KAKSO and KALMA of RNAV OLMEN 1D showed the highest level of risk among the SIDs and STARs, respectivly.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.3
• /
• pp.1-14
• /
• 2008

Mass transit information should contribute many benefits to users. Especially transportation information technology is developing highly with information technology in Korea recently. Hereafter it is expected to provide customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithms in public transportation networks including travel and transfer attributes. In this research, multi objectives such as travel time, transfer time, and number of transfer and so on are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding alternatives arbitrarily is proposed by selecting the best alternative which provides maximum utility to users among non dominated paths. Therefore, the ultimate goal of this study proposes a multi objective shortest paths finding algorithm which can take into account multiple user classes in a transit network with multiple travel modes. The proposed algorithm is demonstrated based on the two case studies - a small toy network and the large-scaled Seoul Metropolitan subway network.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2477-2484
• /
• 1997

Best-first heuristic search algorithm, such as $A^{\ast}$ algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that ${\omega}$(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

• Journal of Ecology and Environment
• /
• v.46 no.1
• /
• pp.54-61
• /
• 2022

Background: In South Korea, African swine fever virus (ASFV) has spread among wild boars through Gangwon-do to Dangyang-gun, Chungcheongbuk-do on the southern border of Gangwon-do. To prevent the spread of ASFV to African swine fever (ASF)-free areas, it is necessary to identify areas with a high probability of finding ASFV-infected carcasses and to reduce the density of wild boars in those areas. In this study, we described the propagation trend of ASFV among wild boars, constructed the habitat suitability maps for ASFV-infected carcasses, and suggested areas with a high probability of finding ASFV-infected carcasses and an important route of ASFV transmission. Results: Despite the active quarantine policies in Korea to prevent the spread of ASFV through wild boars, there was no significant difference in the monthly average of number of ASFV-infected carcasses observed between 2020 and 2021. The ASFV-infected carcasses were found more in winter and spring (January to April). Since the first ASF outbreak in wild boars on October 2, 2019, the maximum width of ASFV-infected carcass distribution area was 222.7 km for about 26 months till November 20, 2021. The habitat suitability map, based on GPS coordinates of ASFV-infected wild boar carcasses, shows that highly detectable areas of ASFV-infected carcasses were sporadically dispersed in western and southwestern parts of Gangwon-do, and ranged from north to south of the province along the Baekdudaegan Mountains, whereas poorly detectable areas ranged along the north to the south in the middle parts of the province. Conclusions: Our suitability model, based on the GPS coordinates of ASFV-infected carcasses, identifies potential habitats where ASFV-infected carcasses are likely to be found and ponential routes where ASFV is likely to spread. Among ASF-free areas, the areas with high suitability predicted in this study should be given priority as survey areas to find ASFV-infected carcasses and hunting areas to reduce wild boar populations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.109-117
• /
• 2014

In navigation route planning systems using A* algorithms, the cardinality of an Open list, which is a list of candidate nodes through which a terminal node can be accessed, increases as the path length increases. In this paper, a method of alternately utilizing the Dijkstra's algorithm and the A* algorithm to reduce the cardinality of the Open list is investigated. In particular, by employing a depth parameter, named Level, the two algorithms are alternately performed depending on the Level's value. Using the hybrid searching approach, the Open list constructed in the Dijkstra's algorithm is transferred into the Open list of the A* algorithm, and consequently, the unconstricted increase of the cardinality of the Open list of the former algorithm can be avoided and controlled appropriately. In addition, an optimal or nearly optimal path similar to the Dijkstra's route, but not available in the A* algorithm, can be found. The experimental results, obtained with synthetic and real-life benchmark data, demonstrate that the computational cost, measured with the number of nodes to be compared, was remarkably reduced compared to the traditional searching algorithms, while maintaining the similar distance to those of the latter algorithms. Here, the values of Level were empirically selected. Thus, a study on finding the optimal Level values, while taking into consideration the actual road conditions remains open.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.1D
• /
• pp.195-202
• /
• 2006

The infiltration route analysis is a military application using geospatial information technology. The result of the analysis would present vulnerable routes for potential enemy infiltration. In order to find the susceptible routes, optimal path search algorithms (Dijkstra's and $A^*$) were used to minimize the cost function, summation of detection probability. The cost function was produced by capability of TOD (Thermal Observation Device), results of viewshed analysis using DEM (Digital Elevation Model) and two related geospatial information coverages (obstacle and vegetation) extracted from VITD (Vector product Interim Terrain Data). With respect to 50m by 50m cells, the individual cost was computed and recorded, and then the optimal infiltration routes was found while minimizing summation of the costs on the routes. The proposed algorithm was experimented in Daejeon region in South Korea. The test results show that Dijkstra's and $A^*$ algorithms do not present significant differences, but A* algorithm shows a better efficiency. This application can be used for both infiltration and surveillance. Using simulation of moving TOD, the most vulnerable routes can be detected for infiltration purpose. On the other hands, it can be inversely used for selection of the best locations of TOD. This is an example of powerful geospatial solution for military application.

• Bulletin of the Korean Chemical Society
• /
• v.31 no.5
• /
• pp.1252-1256
• /
• 2010

A polyvinylpyrrolidone (PVP)/Ag nanocomposites was prepared by the simultaneous thermal reduction and radical polymerization route. The in situ synthesis of the Ag/PVP nanocomposites is based on the finding that the silver n-propylcarbamate (Ag-PCB) complex can be directly dissolved in the NVP monomer, and decomposed by only heat treatment in the range of 110 to $130^{\circ}C$ to form silver metal. Silver nanoparticles with a narrow size distribution (5 - 40 nm) were obtained, which were well dispersed in the PVP matrix. A successful synthesis of Ag/PVP nanocomposites then proceeded upon heat treatment as low as $110^{\circ}C$. Moreover, important advantages of the in situ synthesis of Ag/PVP composites include that no additives (e.g. solvent, surface-active agent, or reductant of metallic ions) are used, and that the stable silver nanocolloid solution can be directly prepared in high concentration simply by dissolving the Ag/PVP nanocomposites in water or organic solvent.