• 한국ITS학회:학술대회논문집
• /
• 2003.11a
• /
• pp.8-13
• /
• 2003

• Journal of Korean Society of Transportation
• /
• v.27 no.2
• /
• pp.179-187
• /
• 2009

Currently, the signalized intersections in Korea are operated without providing an emergency vehicle preemption control strategy. Thus, it might threaten the safety of the pedestrians and drivers on highways when an emergency vehicle faces congested traffic conditions. The existing preemption control is activated when an emergency vehicle is detected along a path. This enables emergency vehicles to progress uninterrupted, but it also increases the delay of other vehicles. In this paper, a revised preemption control strategy considering queue length restrictions is proposed to make both a progressive movement of an emergency vehicle and reduce delay of other vehicles simultaneously. By applying the preemption control strategy through a simulation study, it was shown that delay of an emergency vehicle decreased to 44.3%-96.1% and speed increased to 8.8%-42.0% in all 9 cases as compared with a conventional signal control. The existing preemption control is superior for oversaturated conditions (v/c >1.0) or a link length less than 200m. However, the preemption control considering queue length constraints shows better performance than the existing preemption control when the v/c is less than 0.8 and a link length is longer than 500m.

• Journal of the Korea Society for Simulation
• /
• v.24 no.3
• /
• pp.27-35
• /
• 2015

We analyze an M/G/1/K queueing system with queue-length dependent service and arrival rates. There are a single server and a buffer with finite capacity K including a customer in service. The customers are served by a first-come-first-service basis. We put two thresholds $L_1$ and $L_2$($${\geq_-}L_1$$ ) on the buffer. If the queue length at the service initiation epoch is less than the threshold $L_1$, the service time of customers follows $S_1$ with a mean of ${\mu}_1$ and the arrival of customers follows a Poisson process with a rate of ${\lambda}_1$. When the queue length at the service initiation epoch is equal to or greater than $L_1$ and less than $L_2$, the service time is changed to $S_2$ with a mean of $${\mu}_2{\geq_-}{\mu}_1$$. The arrival rate is still ${\lambda}_1$. Finally, if the queue length at the service initiation epoch is greater than $L_2$, the arrival rate of customers are also changed to a value of $${\lambda}_2({\leq_-}{\lambda}_1)$$ and the mean of the service times is ${\mu}_2$. By using the embedded Markov chain method, we derive queue length distribution at departure epochs. We also obtain the queue length distribution at an arbitrary time by the supplementary variable method. Finally, performance measures such as loss probability and mean waiting time are presented.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.2
• /
• pp.361-367
• /
• 2019

Ramp metering is a traffic management technique that reduces the congestion of Expressway by controlling vehicles entering the highway. It is widely used outside the country, and Korea is also operating in seven sites (Seoul Ring Expressway). Ramp metering has the advantage of reducing congestion of Expressway, but there are disadvantages, as queuing occurs because vehicles are waiting for ramp, and the ramp queue affects adjacent roads at rush hour. To solve this problem, we improved the ramp metering algorithm to reduce the metering rate more spaces on ramp and to increase the metering rate less spaces. In order to evaluate this, the combined evaluation index was used and it was found that the result satisfied the equity and efficiency at the same time.

• Journal of Korean Society of Transportation
• /
• v.21 no.4
• /
• pp.79-90
• /
• 2003

Internal metering policy(IMP) is a control strategy to improve the quality of traffic flow within a network by avoiding queue spillback or intersection blockage. It is a more aggressive control strategy than the current control strategy employed in COSMOS. A preliminary study was made to incorporate the IMP logic within the COSMOS system to improve its' functionality at oversaturated conditions. From the study results, a set of guideline for real implementation was recommended : traffic conditions, detector configurations, and control procedures, etc. A simulation study was performed to evaluate the effectiveness of the proposed guidelines. It was shown that the occurrence of queue spillback was minimized. and overall network performance was also improved by applying IMP logic as compared to COSMOS control onl.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.251-252
• /
• 2000

• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.275-284
• /
• 1998

신호화 교차로는 한정된 시간 자원을 각 접근로별로 서로 다른 수요에 적절하게 효과적으로 배분함으로써 그 운영효율이 극대화될 수 있다. 현재 서울시 기존 전자신호시스템은 검지기체계를 갖추고 있으나 주로 시간대별 제어방식(TOD제어)을 사용하고 있다. 이에 대한 대안으로 실시간 교차로신호제어시스템인 이른바 첨단신호시스템이 개발되어 서울시 강남지역 61개소에서 시범운영중에 있다. 첨단신호시스템은 접근로별 수요에 따라 녹색시간을 배분하는 방식을 적용하고 있는데, 본 논문에서는 첨단신호시스템의 운영효율성을 평가하기 위하여 실제 교통수요와 운영녹색시간을 비교·분석하였다. 그 결과로 얻은 결론은 다음과 같다. 첫째, 방출차량에 의한 포화도의 비율을 고려하여 주기 및 녹색시간을 결정하는 첨단신호제어시스템의 알고리즘은 비포화시 직진이동류에 대한 녹색시간은 수요에 비해 과대산출운영되고 있다. 둘째, 좌회전의 경우 대기차량의 패턴이 불규칙할 때, 실시간 녹색시간제어기능이 미흡하다. 따라서, 향후에는 교통수요를 고려할 수 있는 알고리즘의 보다 심도있는 연구·개발이 요구되며, 또한 비포화 상황이 아닌 과포화 상황에도 적용될 수 있는 알고리즘의 개발이 이루어져야할 것으로 보인다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.171-177
• /
• 2009

This study presents the switching strategy between admission control and pricing control policies and clarifies the properties of the switching strategy in an M/M/1/K queueing system. In addition, this study demonstrates that employing the switching strategy can significantly improve the maximum total expected profit.

• Journal of Korea Society of Industrial Information Systems
• /
• v.23 no.1
• /
• pp.53-63
• /
• 2018

In this paper, we analyze the waiting time of a queueing system with D-BMAP (discrete-time batch Markovian arrival process) and D-policy. Customer group or packets arrives at the system according to discrete-time Markovian arrival process, and an idle single server becomes busy when the total service time of waiting customer group exceeds the predetermined workload threshold D. Once the server starts busy period, the server provides service until there is no customer in the system. The steady-state waiting time distribution is derived in the form of a generating function. Mean waiting time is derived as a performance measure. Simulation is also performed for the purpose of verification and validation. Two simple numerical examples are shown.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.33-46
• /
• 2022

This paper, in order to minimize the ground waiting time of an Air tanker, the queuing theory, that is, a queue that calculates the waiting time under single-server and multi-server situations, was used in the study. Since the national budget and resources are limited, the unlimited increase of the logistics support service team is limited. Therefore, the number of logistic support service teams that can adaptively control the ground waiting time according to the wartime preparation stage or war environment was calculated. The results of this study provide a stipulated standard for calculating the optimal number of air tanker logistic support service teams of the Air Force, providing a basis for the logistical commander to assign logistic support service teams to each stage from peacetime to wartime.