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

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.39-47
• /
• 2018

The Dial Algorithm, based on single link based calculation, is unable to reflect cyclic paths arising in actual urban transportation networks. At the same time, redefining the paths more efficiently can, by strict standards, lead to irrational results stemming from reduction in the size of the network to be analyzed. To solve these two problems of the Dial algorithm, the research herein proposes a vine network method applied to a link based Dial Algorithm, in which the original three step alogrithm is modified into a vine network-based three step process. Also, an analysis of two case study networks show feasible replication of the predicted cyclic path, unrealistic flow, and unsteady transit, as well as alleviation of the problem of irrational path allocation.

• Journal of Navigation and Port Research
• /
• v.26 no.5
• /
• pp.517-524
• /
• 2002

This study aims to analyse the actual conditions of Korean fishing boat being seized in Japan's EEZ and to provide the countermeasures against that problem. According to the analysis of that actual conditions, Korean fishermen are trespassing Japan's EEZ in which fishery resources are abundant because of exhaustion of fishery resources and polluted water in Korean coastal sean. In the past, That behavior was not illegal. Now, however, it became illegal with the effectuation of the United National Conventions on the Law of the Sea(1994) and the Korean-Japanese Fisheries Agreement(1999). In order to resolve that problem on a long-term basis, it is necessary to turn over national fishery policy, to provide fishing people with other means of living, and to establish the Korean-Japanese cooperation system of fishery management. Most of all, it is urgent to mitigate and remit a penalty which was executed in Japan, to amplify personal and material resources need to guide and control fishery, and to construct a close cooperation system between the National Maritime Policy Agency and the Ministry of Maritime and Fisheries Affairs.