• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.5
• /
• pp.117-125
• /
• 2022

Recently, as users' interest for travel increases, research on a travel route recommendation service that replaces the cumbersome task of planning a travel itinerary with automatic scheduling has been actively conducted. The most important and common goal of the itinerary recommendations is to provide the shortest route including popular tour spots near the travel destination. A number of existing studies focused on providing personalized travel schedules, where there was a problem that a survey was required when there were no travel route histories or SNS reviews of users. In addition, implementation issues that need to be considered when calculating the shortest path were not clearly pointed out. Regarding this, this paper presents a quantified method to find out popular tourist destinations using social big data, and discusses problems that may occur when applying the shortest path algorithm and a heuristic algorithm to solve it. To verify the proposed method, 63,000 places information was collected from the Gyeongnam province and big data analysis was performed for the places, and it was confirmed through experiments that the proposed heuristic scheduling algorithm can provide a timely response over the real data.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.2
• /
• pp.89-95
• /
• 2017

There are a variety of apps that are finding their way. And in car navigation, we launched a product that reflects Augmented Reality technology this year. However, existing apps have problems. It is implemented in 2D or 3D, has a large error range because it has been modified in most vehicles, is not updated in real time, and car augmented reality navigation is a vehicle, and a separate device is required, etc. In this study, we implemented a smartphone app for walking directions using augmented reality, and made it possible to intuitively use a route service from a user 's location to a destination. The Dijkstra algorithm is applied to calculate the shortest path to solve the problem of finding the route with the least cost. By using this application, it is possible to use the route search service even in a data-free environment, to solve the inconvenience of the language barrier, and to update in real time, so that the latest information can be always maintained. In the future, we want to develop an app that can be commercialized by using a character in the path to promote it.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.660-663
• /
• 2004

The vehicle routing problem with time-varying speed(VRPTVS) is difficult to handle with regular problem solving approaches. An approach by partitioning the service zone into three sub-zones to reduce computing time and vehicle traveling distance is suggested in this paper. To develop a partitioning algorithm for VRPTVS, all customer locations are divided into two sections such as morning zone and evening zone, excluding daytime zone. And then each service zone is calculated to find a possible number of delivery points and chosen by time window having more number of possible delivery points by considering customer location and varying speeds. A temporary complete route that can serve all target points is developed by this procedure and a pairwise exchange method is applied to reduce the traveling time.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.05
• /
• pp.215-220
• /
• 1995

In this paper, we study myoelectric signal variation through kyungrak needle stimulation. The signal are detected from two kyunrak route of arm; before and after stimulation of a needle, and before and after needle rotation. The detected signals are analyzed at frequency domain to search a characteristic parameters. At the rotation method, spectrum denity of the signals varies large but spectrum is not detected before and after rotation. We can not see any relation bet ween spectrum variation and rotational direction. As the results, when the same stimulation method is used at two different kyungrak route respectively, it is found that the variation of the myoelectric signal is not same.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.953-954
• /
• 2006

Guaranteeing survivability is the most important issue in designing and operating optical transmission network. For dual system of optical transmission network, there should be two routes of the optical to prepare an error in one cable route. If a route is selected based on the standard of unused optical core when choosing an optical cable, dual optical cable routes could be installed in duplicated line. This paper simulates the installation of duplicated line when designing an optical transmission network, detects the status of duplicated line that could happen during transfer construction and switching and accomplishes a system that can confirm the location based on a map.

• 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 the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.36 no.3
• /
• pp.185-196
• /
• 2018

In order to overcome the problem that outdoor and indoor spatial information service are separately utilized, an integration service system of spatial information that is linked from outdoor to indoor has been implemented. As a result of the study, "0001.xml" corresponding to the file index key value, which is the service connection information in the building information of the destination, was extracted from the prototype verification of the system, the search word of 'Kim AB' was transmitted to the indoor map server and converted from the outdoor map service to the indoor map service through confirmation of the navigation service connected information, using service linkage information and search words of the indoor map service was confirmed that the route was displayed from the entrance of the building to the destination in the building through the linkage search DB (Database) table and the search query. Therefore, through this study was examined the possibility of linking indoor and outdoor DB through vector spatial information integration service system. The indoor map and the map engine were implemented based on the same vector map format as the outdoor map engine, it was confirmed that the connectivity of the map engine can be applied.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.115-125
• /
• 2015

This paper presents a Cuckoo search algorithm to secure adversaries misdirecting multi-hop routing in Mobile ad hoc networks (MANETs) using a robust Trust Predicated Routing Framework with an optimized cluster head selection. The clustering technique designed in this framework leads to efficient routing in MANETs. The heavy work load in the node causes an energy drop in cluster head, which leads to re-clustering of the group, and another cluster head is selected to avoid packet loss during data transmission. The problem in the re-clustering process is that the overall efficiency of the routing process is reduced and the processing time is increased. A Cuckoo search based optimization algorithm is proposed to solve the problem of re-clustering by selecting the secondary cluster head within the initially formed cluster group and eliminating the reclustering process. The proposed framework enables a node to select a reliable and secure route for MANET and the performance can be evaluated by comparing the simulated results with the AODV routing protocol, which shows that the performance of the proposed routing protocol are improved significantly.

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