• Proceedings of the Korea Association of Information Systems Conference
• /
• 2005.12a
• /
• pp.155-161
• /
• 2005

3자물류 시장의 급부상, 운송업계의 경쟁가열화, 운송경로의 다양화 및 글로벌화가 추구되면서 복합운송을 고려한 수송계획의 효율화가 필요한 실정이다. 본 연구에서는 국제물류에서 이루어지고 있는 복합운송을 고려한 최적수송계획 알고리즘을 제안하고자 한다. 화물과 경유지의 고려는 운송수단에 따라 동적으로 변화하는 NP-hard문제로써 가지치기 알고리즘(pruning algorithm)을 이용하여 문제를 단순화시키고, 운송수단을 제약조건으로 한 휴리스틱 최단경로 알고리즘을 제안하였다. 이를 부산항에서 로테르담항까지 실제로 사용되는 경로문제에 적용해 봄으로써 본 알고리즘의 효율성을 검증하였다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.19 no.6
• /
• pp.14-25
• /
• 2020

This research proposes a methodology to evaluate the rationality of passengers' route choice who make trips within Seoul metropolitan subway based on smart card data. The rationality of user route choice is divided into the degree of determinacy and similarity concepts as basic principle. Determinacy is the degree to which the route selected by the passenger is identical to the system optimal path. Similarity indicates the degree to which the route is similar to the system optimal path. The K-path search method is used for path enumeration, which allows for measurement of determinacy. To assess determinacy within similarity, transfer tag data of private operators is used. Consequently, the concept of similarity applied to the model is such that the passenger's path choice is identical to the path taken using the tag reader. Results show that the determinacy of appearance of the shortest path (K=1) is 90.4%, while the similarity of appearance as K=(2-10) is 7.9%, summing to 98.3%. This indicates that trips on the metropolitan subway network are being rationally explained. 1.7% of irrational trips are attributed to the unexplainable error term that occurs due to the diversity of passengers.

• Journal of the military operations research society of Korea
• /
• v.33 no.2
• /
• pp.31-47
• /
• 2007

The main purpose of this study is to find out the best solution of the vehicle routing problem with hard time window by using both genetic algorithm and heuristic. A mathematical programming model was also suggested in the study. The suggested mathematical programming model gives an optimal solution by using ILOG-CPLEX. This study also suggests a hybrid genetic algorithm which considers the improvement of generation for an initial solution by savings heuristic and two heuristic processes. Two heuristic processes consists of 2-opt and Or-opt. Hybrid genetic algorithm is also compared with existing problems suggested by Solomon. We found better solutions rather than the existing genetic algorithm.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.135-146
• /
• 2004

For improving the effectiveness of travel information, some rational paths are needed to provide them to users driving in real road network. To meet it, k-shortest path algorithms have been used in general. Although the k-shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which nay lead to incorrect travel information to the users. In case of considering the network consisting of several turn prohibitions popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns are not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. Such problem could be solved by expansion technique adding extra links and nodes to the network for describing turn penalties, but this method could not apply to large networks as well as dynamic case due to its overwhelming additional works. This paper proposes a link-based shortest path algorithm for the travel information in real road network where exists turn prohibitions. It enables to provide efficient alternative paths under consideration of overlaps among paths. The algorithm builds each path based on the degree of overlapping between each path and stops building new path when the degree of overlapping ratio exceeds its criterion. Because proposed algorithm builds the shortest path based on the link-end cost instead or node cost and constructs path between origin and destination by link connection, the network expansion does not require. Thus it is possible to save the time or network modification and of computer running. Some numerical examples are used for test of the model proposed in the paper.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.5
• /
• pp.555-562
• /
• 1999

VLSI 시스템 설계 단게에서 시스템의 고성능 및 고신뢰성을 보장하는 것이 중용한 요건이 되고 있다. 본 논문은 회로의 긴 경로들과 짧은 경로들 상에 존재하는 구성요소들간의 시간지연들이 타이밍 제약조건들을 만족하도록 최적화시킴으로서 고성능 및 고신뢰도를 동시에 실현할 수 있는 효율적인 알고리즘을 제안한다. 과거에는 VLSI 시스템의 고성능을 실현하기 위한 긴 경로 최적화와 고신뢰도를 실현하기 위한 짧은 경로 최적화를 각각 독립적으로 수행하는 방법들이 제안되었다. 본 논문은 긴 경로들 및 짧은 경로들 상의 시간지연 요소들을 동시에 최적화함으로써 적절한 수행시간과 적은 메모리 요구량의 오버헤드를 허용하는 범위에서 효과적인 단계들로 수행되는 병합 알고리즘을 제안하고자한다. 그리고 제안된 병합 알고리즘의 효율성을 입증하기 위해 벤치마크 회로들을 이용하여 실험 결과들을 보여줄 것이다.

• Economic Analysis
• /
• v.27 no.3
• /
• pp.1-32
• /
• 2021

This study empirically analyzes whether bank capital channel and risk-taking channel for monetary policy work for domestic banks in South Korea by analyzing the impact of the expansionary monetary policy on the rate spread between deposit and loan, capital ratio, and loan amount. For the empirical analysis, the Uhlig (2005)'s sign-restricted SVAR(Structural Vector Auto-Regression) model is used. The empirical results are as follows: the bank's interest rate margin increases, the capital ratio improves, risk-weighted asset ratio increases, and the amount of loans increases in response to expansionary monetary shock. This empirical results confirm that bank capital channel and risk-taking channel work in domestic banks, similar to the previous research results. The implications of this study are as follows. Although the expansionary monetary policy has the effect of improving the bank's financial soundness and profitability in the short term as bank capital channel works, it could negatively affect the soundness of banks by encouraging banks to pursue risk in the long run as risk-taking channel works. It is necessary to note that the capital ratio according to the BIS minimum capital requirement of individual banks may cause an illusion in supervising the soundness of the bank. So, the bank's aggressive lending expansion may lead to an inherent weakness in the event of a crisis. Since the financial authority may have an illusion about the bank's financial soundness if the low interest rate persists, the authority needs to be actively interested in stress tests and concentration risk management in the pillar 2 of the BIS capital accord. In addition, since system risk may increase, it is necessary to conduct regular stress tests or preemptive monitoring of assets concentration risk.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.8
• /
• pp.50-57
• /
• 2003

Controlling rotorcraft to fly precisely through multiple, irregularly, and closely spaced waypoints is a common and practical mission. However, finding an optimal trajectory for this kind of mission is quite challenging. Usability of traditional approaches such as inverse control or direct methods to this kind of problem is limited because of either limitation on the specification of the constraints or requirement of extensive computation time. This paper proposes a method that can easily compute the full trajectory and control history for rotorcraft to pass through waypoints while satisfying other general constraints of states such as velocities and attitudes on each waypoint. The proposed method is applied to rotorcraft guidance problems of slalom and linear trajectory in the middle of general curved trajectory. The algorithm is test for various situations and demonstrates its usability.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.363-366
• /
• 2009

변이영상은 두 스테레오 영상의 시차에 의해 발생하는 각 화소의 변위를 수록한 영상이다. 이 영상은 깊이영상을 생성하여 시점 간 가상영상을 생성하는데 사용된다. 따라서 변이영상은 다시점 비디오 서비스와 직접적인 연관이 있다. 본 논문에서는 유일성(uniqueness)제약과 순차성(ordering) 제약을 사용하여 기준영상과 참조영상 사이의 관계를 이용하여 생성한 변이 공간 영상(DSI : disparity space image)으로부터 비용 행렬을 계산하여 최적의 변이 경로를 찾아가는 다이내믹 프로그래밍을 분석 하였다. 다이내믹 프로그래밍은 정밀한 변이 맵을 얻을 수 있고, 다른 방식들에 비해 연산 속도가 빠르다는 장점을 가지고 있지만, 영상의 화소값의 변화가 없는 영역에서 이전의 경로를 계속 유지하려는 성질에 때문에 발생 하는 오류확산과 가려진 (occluded) 영역에 의한 오차로 인해 정확한 경로를 찾을 수 없는 경우가 빈번히 발생 하여 에러율이 높아지는 단점을 가지고 있다. 이러한 이론을 토대로 기존의 기법들에 비하여 정확도가 우수한 기법들을 제안하였다. 개선된 역 추적 과정을 이용하여 기존의 다이내믹 프로그래밍 기반의 스테레오 정합 기법들보다 우수성이 뛰어난 결과들을 나타내었다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.957-965
• /
• 2018

This study presents a geographic information system based dump truck route exploring system (DRES) which provides construction managers and hauling operators with efficient route information that can improve earthmoving productivity by reducing hauling time. The system is comprised of Network Analyst from Esri as a route exploring engine and a network data model. The network data model includes information on weight limit of bridges, height limit of pedestrian overpasses, and one way that impedes dump trucks' hauling efficiency. A construction manager is expected to input origin and destination point in the user interface, and the system generates an efficient route that avoids bridges with weight limit or pedestrian overpasses with height limit. The system was applied to a real earthmoving project to test its applicability, and it was found that the system functions as intended.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.01a
• /
• pp.31-34
• /
• 2015

로봇 경로 탐색은 주어진 시작 지점으로부터 목표 지점까지 장애물에 부딪히지 않는 경로를 찾는 것이다. 본 연구에서는 시간 제약이 있는 상황에서 로봇 경로 탐색을 위한 유전자 알고리즘을 제안한다. 제안하는 유전자 알고리즘은 적은 세대 수에서도 해를 찾을 수 있도록 수렴에 집중한 초기화, 유전자 연산자, 자연선택 방법을 사용하였다. 기존 유전 알고리즘들과의 비교 실험은 제안하는 유전 알고리즘이 경로 탐색을 위해 적은 세대 수를 사용하면서도 가장 짧은 경로를 찾을 수 있음을 보여준다.