• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.147-154
• /
• 2010

This paper suggests new route plan cost calculation and cost-effective route plan algorithm and architecture for the new city traffic information system when it is operated nationwide. New algorithm and architecture estimates cost with traffic speeds which is supported for all different lanes, stratifies logical layer which process different levels' traffic information with diverse traffic patterns and provides different traffic information in the few levels. Also suggested new algorithm supports drivers' customized traffic information through both-way communications and plans routes effectively based on the distance between drivers' start position and destination and different levels which start and end position located. It proposes additional research items and requirement for integration between different cities' traffic information system which the national police agency invested and led.

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.219-221
• /
• 2022

In recent summer, as it is concentrated, even in mountainous areas, flooding and flooding cause casualties in pedestrian evacuation situations. To compensate for this, a system that detects the occurrence of flooding and allows pedestrians to evacuate safely is required. Therefore, in this paper, we propose a research on pedestrian path search based on the shortest distance algorithm using Map API. The pedestrian route search system outputs a map using the T Map API, selects nearby buildings as shelters, and stores data. A shelter close to the pedestrian's current location is selected, and the shortest route is output and the distance and time are provided. If there is a problem with the current route during evacuation, another shelter route is provided from the current location. Therefore, it is thought that the pedestrian route search evacuation system proposed in this paper will prevent accidents during evacuation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1388-1397
• /
• 2001

무선 ATM에서 핸드오프 시의 경로 재설정 과정에서 필요한 COS 선택 알고리즘에 관하여 기존의 알고리즘과는 다른 새로운 알고리즘을 제안한다. 제안하는 Short search COS 선택 알고리즘은 매 핸드오프 시마다 COS를 검색하지 않고 이전에 검색된 COS 노드를 최대한 활용하여 핸드오프 지연 성능을 저하시키지 않으면서 전체적인 망 이용 효율성은 향상시키는 결과를 나타낸다. 알고리즘의 개선된 성능을 시뮬레이션을 통해 검증되고 그래프 및 결과 테이블을 통해 보여진다.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.131-143
• /
• 2004

Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.

• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.744-751
• /
• 2012

Air Traffic Management(ATM) is to control air traffic flow quickly and safely. For efficient ATM, the ability which calculate optimal route using filight plan and filght information is required. Especially for the time-sensitive air cargo, it is essential. In this paper, therefore, we present a dynamic route search algorithm which calculate optimal route dynamically. The conventional method using Dijkstra algorithm has a problem that recalculate the entire route when some airways are closed. However, the proposed algorithm recalculates only affected waypoints, so it finds optimal route quickly and accurately. Comparisons with the conventional method and the proposed algorithm show that the proposed algorithm provides better.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.206-209
• /
• 2005

Optimal path search systems to take continuously changed traffic flows into consideration is necessary in order to reduce the cost to get destination. However, to search optimal path in client terminals with low computing power yields high computational cost. Thus, a method with low cost and near optimal path as well is required. In this paper, we propose a path search method using variable heuristic for the sake of reducing operation time. The heuristic is determined by the change of the average speeds of cars located in grid which means a rectangle region.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.1-14
• /
• 2009

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1808_1809
• /
• 2009

이동 로봇이 이동하기 위해서는 시작위치와 목적위치까지 이동 경로를 계산해야한다. 특히 실내용 서비스로봇의 경우 상대적으로 저렴한 인공마크와 위치인식감지센서를 이용하여 현재 위치를 판단 할 수 있다. 이 센서의 인식마크를 이용해 노드 간의 이동 경로를 생성하고 목적노드까지 이동하는데 발생할 수 있는 외부의 변화를 포함하여 로봇의 이동경로를 빠르게 생성 할 수 있는 알고리즘을 제안한다.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.185-194
• /
• 2008

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop an ant algorithm based on routing mechanism for finding the multiple shortest paths within limited time in real traffic network. The proposed ant algorithm finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn until an acceptable solution is reached. This method can consider traffic constraints easily comparing to the conventional shortest paths algorithms.