• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.2
• /
• pp.156-161
• /
• 1997

In this thesis, based on Genetic Algorithm, a new route search algorithm is presented to search an optimal route between the origin and the destination in intelligent route guidance systems in order to minimize the route traveling time. The proposed algorithm is effectively employed to complex road networks which have diverse turn constrains, time-delay constraints due to cross signals, and stochastic traffic volume. The algorithm is also shown to significantly promote search efficiency by changing the population size of path individuals that exist in each generation through the concept of age and lifetime to each path individual. A virtual road-traffic network with various turn constraints and traffic volume is simulated, where the suggested algorithm promptly produces not only an optimal route to minimize the route cost but also the estimated travel time for any pair of the origin and the destination, while effectively avoiding turn constraints and traffic jam.

• Journal of Korean Society of Transportation
• /
• v.21 no.1
• /
• pp.103-113
• /
• 2003

This paper shows alternative route search and preference route search for the traffic route search, and proposes the use of the fuzzy non-additive controller by the application of AHP(analytic hierarchy process). It is different from classical route search and notices thinking method of human. Appraisal element, weight of route is extracted from basic of the opinion gathering for the driving expert and example of route model was used for the finding of practice utility. Model evaluation was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure and Choquet fuzzy integral. Finally, alternative route search was possible to real time traffic route search for the well variable traffic environment, and preference route search showed reflection of traffic route search disposition for the driver individual. This paper has five important meaning. (1)The approach is similar to the driver's route selection decision process. (2)The approach is able to control of route appraisal criteria for the multiple attribute. (3)The approach makes subjective judgement objective by a non additive. (4)The approach shows dynamic route search for the alternative route search. (5)The approach is able to consider characteristics of individual drivers attributed for the preference route search.

• Journal of Korea Multimedia Society
• /
• v.18 no.5
• /
• pp.682-690
• /
• 2015

Among location-based systems, a route search service is very highly utilized as a representative technique, but it provides relatively low accuracy when we find a route path on foot in our real environment. In this paper, we design and implement an optimized route search technique based on user experience utilizing open APIs as location-based services. Finally, we develop an Android-based application to provide this feature. In our experiment, we found that our technique enhanced performance by about 14-36% compared to previous solutions, such as route path searches using map APIs. In addition, the performance of our technique can be further enhanced, as the number of users who find such optimized route path is increasing.

• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.6_2
• /
• pp.891-897
• /
• 2021

In this paper, we propose a destination optimal route algorithm for providing route finding service for the transportation handicapped by using the multi-criteria decision-making technique and the modified A-STAR optimal route search algorithm. This is a method to set the route to the destination centering on safety by replacing the distance cost of the existing A-STAR optimal route search algorithm with the safety cost calculated through AHP/TOPSIS analysis. To this end, 10 factors such as road damage, curb, and road hole were first classified as poor road factors that hinder road driving, and then pairwise comparison of AHP was analyzed and then defined as the weight of TOPSIS. Afterwards, the degree of driving safety was quantified for a certain road section in Busan through TOPSIS analysis, and the development of an optimal route search algorithm for the transportation handicapped that replaces the distance cost with safety in the finally modified A-STAR optimal route algorithm was completed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.61-73
• /
• 2004

The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.49-58
• /
• 2006

When the movement of a node breaks the route in ad-hoc network, on-demand routing protocol performs the local route recovery or a new route search for the route maintenance. And when it performs the new route search or the local search, the packet which is transmitted can be delayed. There are ARMP and RPAODV as the methods reducing the delay resulted from the route-breakage. They predict the route-breakage and construct an alterative local route before the occurrence of the route-breakage. When the link state is unstable, the success rate of the alternative local route that can avoid the route-breakage can give a direct effect on the route-breakage and the transmission delay, To estimate the performance of routing protocols avoiding route-breakage, we suggest the numerical formulas of AODV, the representative on-demand routing protocol, and ARMP, RPAODV. To verify the efficiency and accuracy of the proposed numerical formulas, we analysis and compare with the results of the computer simulation and that of the numerical formulas.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.1
• /
• pp.78-89
• /
• 2017

This study derived the algorithm of a public transportation route search that adds safety and environmental costs according to user preference. As the means of an algorithm application and evaluation, Macro Simulation, VISUM was conducted for an analysis. The route using the subway, which is relatively low in safety and environment resistance value was preferred, and it was analyzed to select the safe and environmental route even though it detours. This study can be applicable when to verify the algorithm of route search considering safety and environment, and when introducing the algorithm of route search according to user preference in the smart-phone application in the future, it can provide users with very useful information by choosing a route as for safety and environment, and through this, the quality of user-friendly information provision can be promoted.

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

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.6
• /
• pp.129-135
• /
• 2010

This paper suggests a multipath establishing scheme for ad hoc networks. Data paths are established by on-demand manner. Multipath are made as a sequence of route control message exchange at route setup process. Multipath can be used as a backup path or load balancing for data exchange. Proposed scheme uses a one-hop pre-search scheme for establishing multipath between source and destination. When a node selects a next node for route reply, the node finds optimal route by exchanging route information with neighbor nodes. Simulation results show that the proposed multipath scheme has better split characteristics among multipath and higher route survivability at the environment where nodes are moving.