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

• International Journal of Highway Engineering
• /
• v.13 no.1
• /
• pp.197-206
• /
• 2011

The Korean government concentrates on supplying public transit facilities for the mobility handicapped. In other hands, increasing needs of transfer information when the mobility handicapped use transit facilities are substantial but not satisfactory as a whole. This study focuses on evaluating the applicability of developed K-path algorithm to provide user-customized route information that could make an active using of public transit while considering the mobility handicapped preferences. Developed algorithm reflects on requirements considering transfer attributes of the mobility handicapped. Trip attributes of the handicapped are addressed distinguished from handicapped types such as transfer walking time, transfer ratio, facility preferences and etc. This study examines the verification and application of the proposed algorithm that searches the least time K-paths by testing on actual subway networks in Seoul metropolitan areas. It is shown that the K-path algorithm is good enough to provide paths that meet the needs of the mobility handicapped and to be adoptable for the future expansion.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.249-257
• /
• 2015

This paper introduces a heuristic algorithm to NP-hard travelling salesman problem. The proposed algorithm, in its bid to determine initial path, applies SW-DNN, DW-DNN, and DC-DNN, which are modified forms of the prevalent Double-sided Nearest Neighbor Search and searches the minimum value. As a part of its optimization process on the initial solution, it employs 2, 2.5, 3-opt of a local search k-opt on candidate delete edges and 4-opt on undeleted ones among them. When tested on TSP-1 of 26 European cities and TSP-2 of 49 U.S. cities, the proposed algorithm has successfully obtained optimal results in both, disproving the prevalent disbelief in the attainability of the optimal solution and making itself available as a general algorithm for the travelling salesman problem.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.172-178
• /
• 2005

순환탐색 알고리즘 및 스택기반 알고리즘 등은 유방향그래프에서 순환과 순환경로를 발견하는 특정 정점으로부터 출발하여 연결된 그래프에서 순환을 탐색하는 것이다. 기존 연구의 단점은 모든 순환을 다 찾아내지지 못하는 경우라든지, 동일한 순환을 중복해서 찾아내는 문제가 있었다. 본 연구에서 제시하는 정점제거 순환탐색 알고리즘은 특정 정점의 순환을 발견한 뒤 그 정점을 삭제하므로 중복된 순환을 발견하지 않고 모든 순환을 찾을 수 있다. 또한 순환을 발견했을 때, 순환경로를 출력하는데 있어서 스택의 인덱스를 이용해, 저장경로를 탐색하지 않고 출력하는 방법을 제안하였다. 실험에서는 임의의 정점과 간선을 생성하여 그래프로 만들고, 각 알고리즘에 따른 모든 정점을 찾을 수 있는지, 그래프 상황에 따라 어떠한 장단점이 있는지, 간선이 많아질수록 인덱스 순환탐색 알고리즘보다 탐색시간이 얼마나 차이를 보이는지를 확인하였다. 웹 구조처럼 일정한 크기의 웹페이지와 많은 수의 링크가 존재하는 그래프에서 정점제거 순환탐색 알고리즘이 순환을 찾는데 적합하다는 것을 입증했다.

• Journal of IKEEE
• /
• v.27 no.1
• /
• pp.1-11
• /
• 2023

Path driving tests are necessary for the development of self-driving cars or robots. These tests are being conducted in simulation as well as real environments. In particular, for development using reinforcement learning and deep learning, development through simulators is also being carried out when data of various environments are needed. To this end, it is necessary to utilize not only manually designed paths but also various randomly and automatically designed paths. This test site design can be used for actual construction and manufacturing. In this paper, we introduce a method for randomly generating a driving test path consisting of a combination of arcs and segments. This consists of a method of determining whether there is a collision by obtaining the distance between an arc and a line segment, and an algorithm that deletes part of the path and recreates an appropriate path if it is impossible to continue the path.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.402-405
• /
• 2008

네트워크에 연결되는 장치의 개수가 늘어남에 따라서 각 장치에 패킷을 전달하는 경로 결정에 필요한 라우팅 정보의 양도 늘어나고 있다. 라우팅 정보의 양이 증가하여 라우팅 테이블의 크기가 커질 경우 패킷의 전달 경로를 결정하기 위한 테이블 검색 시간이 길어져 라우팅 성능이 저하될 수 있다. 본 논문에서는 지리적 정보를 이용하여 지리적 거리로 계산한 다음 홉 라우터와 네트워크 상의 라우팅 경로에서 계산된 다음 홉 라우터가 동일할 경우 해당 엔트리를 삭제하는 방법으로 라우팅 테이블의 크기를 작게 유지하는 한편 라우팅은 정상적으로 수행하는 기법을 소개하고자 한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.3D
• /
• pp.317-323
• /
• 2008

Mass transit information can contribute many benefits to users. Especially, transportation information technology is developing highly with information technology in Korea recently. Hereafter, it is expected to give 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 algorithm in public transportation networks including travel and transfer attributes. In this research, constraints are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding condition arbitrarily is proposed by making the maximum value as variables. In this study, transfer frequency, total travel time, seat confirmation, transfer time and travel time become constraint condition based on k path finding algorithm considering service time constraint condition. Moreover, case study about user customized transfer information is performed in Seoul and metropolitan subway networks.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.3
• /
• pp.573-583
• /
• 2015

Amcache.hve file is a registry hive file regarding Program Compatibility Assistant, which stores the executed information of applications. With Amcache.hve file, We can know execution path, first executed time as well as deleted time. Since it checks both the first install time and deleted time, Amcache.hve file can be used to draw up the overall timeline of applications when used with the Prefetch files and Iconcache.db files. Amcache.hve file is also an important artifact to record the traces of anti-forensic programs, portable programs and external storage devices. This paper illustrates the features of Amcache.hve file and methods for utilization in digital forensics such as estimation of deleted time of applications.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.91-99
• /
• 2019

Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.505-507
• /
• 1998

상속은 객체 지향 원리에서 만의 특성으로 추상화 레벨을 높여주고, 소프트웨어의 재사용을 강력히 지원하며, 대체 원리를 따른다. 또한 유지 보수의 용이성, 신뢰성등의 잇점을 제공한다. 그러나 측정 결과에 따르면 상속 계층이 깊어질수록 재사용이 어렵다고 조사되었으며 이는 재사용뿐아니라 개발에 있어서도 장애의 요인이 된다. 상속의 깊이를 최소화하기 위해서는 우선 상속 계층에서 직접적, 또는 간접적으로 사용되는 instance variable과 method만을 제외하고는 모두 삭제되어야 한다. 그러나, 다형성이 적용된 클래스는 정적(static) 분석이 불가능하므로 다형성을 제거하되, 다형성이 적용되었을 때와 동일한 모든 state, 기능 및 동작이 유지된 상태에서 처리되어야 한다. 다형성이 제거될 때 구현의 세부 사항은 변경하지 않음으로써 black box의 이점을 살린다. 다중상속의 경우는 각각의 상속 경로에 대하여 동일한 처리를 반복 수행하여 결과를 얻을 수 있으며, instance variable과 method의 access 레벨에 따라 처리 방법이 조금씩 달라진다. 본 논문에서는 C++에서의 다형성과 불필요한 instance variable과 method의 제거알고리즘에 대하여 논한다.