• Title/Summary/Keyword: 대기 행렬 모형

Search Result 116, Processing Time 0.028 seconds

Development of A System Optimum Traffic Control Strategy with Cell Transmission Model (Cell Transmission 이론에 근거한 시스템최적 신호시간산정)

  • 이광훈;신성일
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.5
    • /
    • pp.193-206
    • /
    • 2002
  • A signal optimization model is proposed by applying the Cell-Transmission Model(CTM) as an embedded traffic flow model to estimate a system-optimal signal timing plan in a transportation network composed of signalized intersections. Beyond the existing signal-optimization models, the CTM provides appropriate theoretical and practical backgrounds to simulate oversaturation phenomena such as shockwave, queue length, and spillback. The model is formulated on the Mixed-Integer Programming(MIP) theory. The proposed model implies a system-optimal in a sense that traffic demand and signal system cooperate to minimize the traffic network cost: the demand departing from origins through route choice behavior until arriving at destinations and the signal system by calculating optimal signal timings considering the movement of these demand. The potential of model's practical application is demonstrated through a comparison study of two signal control strategies: optimal and fixed signal controls.

Application of Control Variable with Routing Probability to Queueing Network Simulation (대기행렬 네트워크 시뮬레이션에서 분지확률 통제변수의 응용)

  • Kwon, Chi-Myung;Lim, Sang-Gyu
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.3
    • /
    • pp.71-78
    • /
    • 2012
  • This research discusses the application of the control variables to achieve a more precise estimation for the target response in queueing network simulation. The efficiency of control variable method in estimating the response depends upon how we choose a set of control variables strongly correlated with the response and how we construct a function of selected control variables. For a class of queuing network simulations, the random variables that drive the simulation are basically the service-time and routing probability random variables. Most of applications of control variable method focus on utilization of the service time random variables for constructing a controlled estimator. This research attempts to suggest a controlled estimator which uses these two kinds of random variables and explore the efficiency of these estimators in estimating the reponses for computer network system. Simulation experiments on this model show the promising results for application of routing probability control variables. We consider the applications of the routing probability control variables to various simulation models and combined control variables using information of service time and routing probability together in constructing a control variable as future researches.

A Workflow Time Analysis Applying the Queueing Model (대기행렬모형에 의한 워크플로우 시간분석)

  • Park, Jinsoo
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.3
    • /
    • pp.1-9
    • /
    • 2014
  • Traditional workflow time analyses have been performed treating an activity as an independent M/M/1queueing system. Using the general forms of performance measures in the M/M/1 system, various aspects of analyses can be performed. Especially, on the time analysis of an AND structure in a workflow system, the mean system sojourn time can be formalized by applying the performance measures of M/M/1 system. In the real workflow system, the AND structure cannot be described correctly under the assumption of independent M/M/1 systems. To overcome this limitation, this research makes the assumption that the all activities for a task starts simultaneously. In this situation, the theoretical solution can be derived using the performance measures of the M/G/1 system. In addition, the simulation modeling method will be proposed to analyze the AND structure of a real workflow system. Finally, some numerical results from the theoretical solutions and simulation models will be provided for verification. The main performance measures used in this research are mean queueing time and mean sojourn time.

Speed Estimation by Applying Volume Weighted Average Methods in COSMOS (교통량 가중평균 방법을 적용한 COSMOS 속도 추정)

  • Lee Sang-soo;Lee Seung-hwan;Oh Young-Tae;Song Sung-ju
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.2 no.1 s.2
    • /
    • pp.63-73
    • /
    • 2003
  • COSMOS(Cycle, Offset, Split Model for Seoul), a real-time traffic adaptive signal system. estimates queue lengths on each approach on the basis of arithmetic average spot speeds calculated on loop detectors installed at each of two adjacent lanes. In this paper, A new method, a traffic volume-weighted average method, was studied and compared with the existing arithmetic average method. It was found that the relationship between the ratio of volumes of two lanes and the difference of average speed of each lane has a linear form. With field data, The two methods were applied and the proposed method shows more stable and reasonable queue estimation results.

  • PDF

A Non-preemptive Priority 2-Class MAP/G/1 Queue with Individual Thresholds (다중 임계점을 고려한 비축출형 우선순위 2-계층 MAP/G/1 대기행렬모형)

  • Seo, Won-Ju;Lee, Ho-U
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.866-872
    • /
    • 2005
  • 본 연구는 비축출형 우선순위 2-계층 대기행렬을 다룬다. 각 계층별 고객들은 마코비안 도착과정(Markovian arrival process, MAP)에 의하여 시스템에 도착하고, 각 계층마다 고유의 임계점을 갖는다. 시스템 내에 고객들이 존재하지 않으면 서어버는 유휴해지고 어느 계층이든지 상관없이 계층에 부여된 임계점에 먼저 도달하면 서어버는 서비스를 시작한다. 우선순위가 높은 고객들을 먼저 서비스하는 비축출형 우선순위 서비스규칙을 따른다. 본 연구에서는 각 계층별 고객들의 대기시간분포에 대한 라플라스(Laplace-Stieltjes) 변환과 평균 대기시간을 유도한다.

  • PDF

Goal Programming as a Modern Management Technique (현대 경영관리기법으로서의 목표계획법)

  • 노부호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.7 no.1
    • /
    • pp.5-9
    • /
    • 1982
  • 우리나라 경영학계 내지는 기업경영에 경영과학(Management Science)의 여러가지 기법이 정식으로 소개되기 시작한 것은 70년대 후반이라고 생각된다. 경영과학의 기법에는 선형계획법·재고관리모형·대기행렬모형·모의(Simulation) 모형·네트웍(Network) 모형 등 여러가지가 있지만, 이중 선형계획법이 우리에게 가장 익숙한 모형이고 기업의 실제 문제해결에도 가장 많이 이용되고 있다. 지금 소개하고자 하는 목표계획법도 경영과학기법의 하나로 모형계획법과 매우 유사한 기법이다.

  • PDF

Application of Multi-Server Queuing Theory to Estimate Vehicle Travel Times at Freeway Electronic Toll-Collection Systems (고속도로 자동요금징수시스템의 차량 통행시간 산정을 위한 다중서비스 대기행렬이론 연구)

  • Sung, Hyun-Jin;Choi, Jai-Sung;Kim, Sang-Youp
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.2
    • /
    • pp.22-34
    • /
    • 2011
  • This paper presents the investigation results of a research on how engineers can analyze the economic effect of the ETCS(Electronic Toll Collection System) installed to minimize the vehicle delays on freeway tollgates during toll payments. This research considered this economic effect to occur in the form of vehicle passing time reductions at the ETCS, and the multi-service queuing theory was applied to estimate these values. This research found: 1) When vehicles approaching tollgates show Poisson distribution and the service time of the ETCS shows Exponential distribution, the multi-service queuing theory would be applicable for estimating vehicle passing times at toll-gates, 2) Despite the ETCS placement, exit sections of tollgates give a greater reduction of vehicle passing times than entering sections due to more delays at conventional toll payments, and 3)The ETCS would not guarantee vehicle passing time reductions all the time, because in such a case as many vehicles were queuing at the ETCS, the total delay level for a toll gate would increase greatly. In addition, in order to examine the accuracy of the estimated vehicle passing values, this research compared the values from the multi-service queuing theory with the observed values from a set of field survey values at freeway toll-gates, and found that the two values were in a good agreement with a very low error range of 1-3 seconds per vehicle. Based on this result, the multi-service queuing theory was recommended for practice.

Ana1ysis of Unobservable Queueing Model with Arrival and Departure Points: LCFS (도착 및 이탈시점에 근거한 관측 불가능한 후입선출 대기행렬 모형의 분석)

  • Kim, Yun-Bae;Park, Jin-Soo
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.2
    • /
    • pp.75-81
    • /
    • 2007
  • Previous queue inference has been studied with some limits. Larson's inference engine, which is the basis for this paper, also processed with basic assumption that arrival process is poisson process. Our inference method, which relaxes the poisson process assumption, must be a useful tool for looking into unobservable inside of queueing systems, as well as calculating accurate system performance. This paper employs these inference methods and proves the validity. Then we apply this method to system analysis for more complicated models. At first, we suggest methods to system with known number of servers, then expand to unknown number of servers. For validating our inference approach, we run some simulation models and compare true values with our results.

  • PDF

Stable Algorithm for a BMAP/SM/1 Queueing System (BMAP/SM/1 대기시스템의 정상 알고리즘 개발)

  • Kim, Che-Soong;Oh, Young-Jin
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.2
    • /
    • pp.31-36
    • /
    • 2006
  • 대기행렬 모형은 통신시스템이나 통신망 구현에 가장 적합한 수리모형으로 알려져 있고, 이에 대한 연구가 상당히 많이 진행되고 있다. 본 논문에서는 재해가 발생될 수 있는 BMAP/SM/1 대기시스템으로, 재해가 발생했을 경우 시스템 복구가 즉시 이루어지지 않고 임의 시간 후 복구 되는 시스템을 고려대상으로 하고 있다. 시스템의 정보입력흐름은 상호종속 또는 그룹 입력이 허용되는 배치마코프 도착과정으로 가정하였고, 또한 서비스분포는 세미 마코프 프로세스를 따른다고 가정하였다. 아울러 시스템에 재해가 발생하면 모든 고객은 즉시 시스템을 떠나게 되고, 재해복구는 임의 시간 후에 이루어진다. 임베디드 마코프체인의 안전상태 확률분포가 유도를 위한 정상 알고리즘 개발이 이루어졌다.