• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.177-185
• /
• 2002

본 논문의 목적은 링크통행시간 자료를 수집하는 시스템에서 소요 프로브차량대수에 영향을 주는 요소들을 규명하고. 최적의 소요 프로브차량대수를 결정하는 모형을 개발하는데 있다. 자가용승용차, 택시, 버스, 택배차량 등 여러 종류의 차량들이 프로브차량으로 사용될 수 있다. 그러나 일정한 정확도 이상의 교통정보를 수집하기 위해서 얼마나 많은 프로브차량이 필요한지에 대한 연구는 그다지 깊이 있게 이루어지지 않았다. 적정 소요 프로브차량대수는 링크통행시간 자료수집 기술 수집대상 링크의 공간적 범위, 프로브차량의 종류 및 운행 특성, 자료수집 시스템의 신뢰도, 수집되는 자료의 정확도 등에 영향을 받게 된다. 소요 프로브차량대수를 결정하는 링크당 평균 통행시간 자료수, 프로브차량 밀도의 최소 확률, 그리고 자료 미수집링크의 허용비율의 3가지 결정기준이 정의되었다. 또한 이러한 결정기준에 대해 소요 프로브차량대수를 산출하는 모형이 개발되었다. 일반적으로 주기당, 링크당 평균 필요 통행시간 자료수$(d_R)$, 단위길이당 프로브차량의 대수 또는 밀도$(n_{min} or {\alpha})$, 일정 프로브차량밀도 이상의 확률($\beta$), 그리고 자료 미수집링크의 비율($\gamma$)이 클수록 소요 프로브차량대수는 증가한다. 민간 교통정보회사의 통행시간 수집시스템에서 소요 프로브차량대수를 산정하는 사례연구가 수행되었으며, 여러가지 조건에서 소요 프로브차량대수가 산출되었다.

• International Journal of Highway Engineering
• /
• v.13 no.2
• /
• pp.57-65
• /
• 2011

In this study, estimated the minimum lane width for the curved section by analyzing of lateral sway distance and compared the lane width for result of this study and a precedent study for straight section on urban roads. Then suggested minimum lane width of road alignments and vehicle classes. The lane width of curved section that was investigated was 2.79m~3.40m. Analysis of frequency distribute and cumulative frequency distribution for lateral sway distance on the basis of 85% of the suggested vehicles. The result of study, minimum lane width for the curved section was 2.31m~2.58m in the case of small size car and 2.80m~3.27m in the case of large size car. Result of this study is judged that it is necessary to case for introduction of green transit, during road construction and construct a road for small size car. Expect result of this study can be used for the application of flexible design standard according the purpose of road designer.

• Journal of the military operations research society of Korea
• /
• v.34 no.2
• /
• pp.143-162
• /
• 2008

This paper aims to formulate the method of estimating the wartime stockpile requirement of 155mm self-propelled artillery including intelligent ammunition for armored vehicles, currently being developed. The usual method of utilizing war-game simulation results in considerable margins in expected occupancy ratio between ground forces and air forces for each weapon system for armored vehicles. Also, the method tends to produce excessive output greater than the minimal stockpile requirements; therefore, the study aims to overcome limitations like these by the allocation method for each weapon system according to targets. This allocation method is better than war-game simulation method.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• Journal of Korean Society of Transportation
• /
• v.21 no.4
• /
• pp.29-44
• /
• 2003

A balanced evaluation system for a bus route network was proposed for a mid-sized suburban city. The evaluation system consists of 7 criteria-accessibility, riding comfort. transfer rate, directness of route, productivity of operation, regional equity, and minimum requirement of bus fleet - and quantitative indicators representing each of the criteria. The proposed system was applied in Siheung, a suburban city in Seoul Metropolitan Area. Four alternative scenarios of bus route network including the existing one were evaluated. The results showed that the suggested criteria and indicators are acceptable for the evaluation of a bus route network. In order to enhance the proposed evaluation procedure, further studies on the normalization of produced values and weights for each of the indicators are needed.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.8
• /
• pp.4742-4748
• /
• 2014

A semi-automatic clutch was developed for drivers of vehicles with manual transmission. The clutch is operated by pressing a switch on the gear stick without stepping on a clutch pedal when the driver wants to shift gears. To automatic control a clutch, driving information is provided by sensors installed under the vehicle. On the other hand, sensors are prone to failure under severe driving conditions and a long time is needed to install or repair these sensors in the vehicle. In this paper, a semi-automatic clutch that received driving information by CAN communication from the ECU was developed and a pneumatic actuator was used to operate the clutch. The semi-automatic clutch by a pneumatic cylinder was operated with a supply air pressure of more than 3bar.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.940-947
• /
• 2010

A Parking Guidance and Information Service System is to provide real-time parking-information and the shortest parking-path for increasing the user's convenience, relieving traffic congestion, reducing illegal parking, and maximizing the efficiency of parking management. This paper discusses the result of the needs analysis, design, and implementation of the Parking Guidance and Information Service System. Furthermore, it analyzes and compares the parking time and vehicle turnover rate before and after the system installation.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• Journal of the Korean Society for Precision Engineering
• /
• v.2 no.1
• /
• pp.21-27
• /
• 1985

차량, 항공, 교량 및 기계구조물 등 랜덤한 실동하중을 받는 구조물의 응력 및 변위, 진동등의 피로 Data 또는 TRAFFIC 등에 의한 건축물의 변위 및 응력발생빈도를 집록하기 위한 Histogram Recorder System에 대한 내용과 측정예를 소개하고자 한다. 본 System은 8(4)챈 널의 스트레인 게이지 또는 스트레인 게이지식 각종변환기와 각종 Sensor로부터의 출력전압 등 Analog 입력을 수록하여, Digital 처리하여 micro computer를 사용, 미리 프로그램된 방식에 따라 측정과 동시에 실동시간으로 해석처리하여 빈도수로서 내부에 기억저장 시키는 것이다. 따라서 본 Histogtram Recorder 본체는 소형으로 견고하며 조금도 제어부분을 갖지 않고 소요의 해석방법의 프로그램백만을 셋트한 개별의 제어기만을 통해가지고 프로그램을 기입만 하며는 그다음은 손하나 안대고도, 그리고도 또 측정중에 제3자에 의한 제어조작 잘못이 발생할 위험도 없고 1 년이상에 걸친 장기간의 .+-. 32 Slices의 각 레벨당 각각 40 억을 넘는 대량의 빈도수를 자동적으로 집록 할 수가 있다. 집록된 Data는 제어장치에 의해 정리된 Datam는 제어장치에 의해 정리된 Histogram의 형태로 읽어나갈 수가 있어 관찰이 가능할 뿐만 아니라 프린터기록 또는 기록장치에 이송시켜서 Data 만 따로 가져올 수가 있어 필요에 따라서는 one line으로 Host computer에 접속시킬 수가 있어 더욱 고도의 처리를 할 수가 있다. 빈도해석프로그램으로서는 극대, 극소, 최대, 최소, 진폭, 시간 등을 pack으로서 준비되어 있어 이에 대한 시스템의 고성 동작 및 성능등을 소개하고자 한다.