In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is pre...In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is presented for estimating vehicular queue length using data from both point detectors and probe vehicles. The methodology applies the shockwave theory to model queue evolution over time and space. Using probe vehicle locations and times as well as point detector measured traffic states,analytical formulations for calculating the maximum and minimum( residual) queue length are developed. The proposed methodology is verified using ground truth data collected from numerical experiments conducted in Shanghai,China. It is found that the methodology has a mean absolute percentage error of 17. 09%,which is reasonably effective in estimating the queue length at traffic signalized intersections. Limitations of the proposed models and algorithms are also discussed in the paper.展开更多
This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and take...This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length . When he returns, if the queue length reaches or exceeds threshold , the server is immediately turned on but is temporarily unavailable due to a random setup time before offering service. If not, the server stays in the system until the queue length at least being . We derive the system size distribution and confirm the stochastic decomposition property. We also derive the recursion expressions of queue length distribution and other performance measures. Finally, we present some numerical examples to show the analytical results obtained. Sensitivity analysis is also performed.展开更多
A gated service single vacation M/G/1 queue with setup and closedown periods,and different customer arrival rates,is studied in this paper.The probability generating function of the number of systems for customers who...A gated service single vacation M/G/1 queue with setup and closedown periods,and different customer arrival rates,is studied in this paper.The probability generating function of the number of systems for customers who are at the initial moment of service period is analyzed by using a total probability theorem,and the stability condition of the system is obtained.The stationary distribution of the queue length is solved by the regeneration cycle method.The stochastic decomposition of queue length in the steady state is calculated,and the service cycle is obtained.Moreover,classified discussions are established in order to solve the steady-state distribution for the waiting time.The variation of system performance indicators with parameters is analyzed by performing numerical experiments.展开更多
In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we direct...In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we directly obtain the recursion formula of the L transformation of the transient queue length distribution at any time t , as well as the recursion formula of the equilibrium distribution for calculating conveniently.Furthermore we obtain the stochastic decompositions of the queue length and waiting time in equilibrium.展开更多
This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient ...This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient queue-length distribution is derived. Furthermore, the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are obtained. Especially some results for the single-arrival M/G/1 queue with single server vacation and bulk-arrival M-x/G/1 queue but with no server vacation can be derived directly by the results obtained in this paper.展开更多
In this paper we study a Geo/T-IPH/1 queue model,where T-IPH denotes the discrete time phase type distribution defined on a birth-and-death process with countably many states.The queue model can be described by a quas...In this paper we study a Geo/T-IPH/1 queue model,where T-IPH denotes the discrete time phase type distribution defined on a birth-and-death process with countably many states.The queue model can be described by a quasi-birth-anddeath(QBD)process with countably phases.Using the operator-geometric solution method,we first give the expression of the operator and the joint stationary distribution.Then we obtain the probability generating function(PGF)for stationary queue length distribution and sojourn time distribution,respectively.展开更多
This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times...This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributios. A GI/M/1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distribution of the GI/M/1 type Markov process is found explicitly and, consequently, the distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times. Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time. These results can be used to analyze not only the queue length, but also the composition of the queue. Computational methods are developed for calculating steady state distributions related to the queue lengths, sojourn times, and waiting times.展开更多
In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the di...In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.展开更多
Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and...Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.展开更多
In order to describe the travel time of signalcontrolled roads, a travel time model for urban basic roads based on the cumulative curve is proposed. First, the traffic wave method is used to analyze the formation and ...In order to describe the travel time of signalcontrolled roads, a travel time model for urban basic roads based on the cumulative curve is proposed. First, the traffic wave method is used to analyze the formation and dispersion of the vehicle queue. Cumulative curves for road entrances and exits are established. Based on the cumulative curves, the travel time of the one-lane road under stable flow input is derived. And then, the multi-lane road is decomposed into a series of single-lane links based on its topological characteristics. Hence, the travel time function for the basic road is obtained. The travel time is a function of road length, flow and control parameters. Numerical analyses show that the travel time depends on the supply-demand condition, and it has high sensitivity during peak hours.展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant No.51138003)
文摘In order to estimate vehicular queue length at signalized intersections accurately and overcome the shortcomings and restrictions of existing studies especially those based on shockwave theory,a new methodology is presented for estimating vehicular queue length using data from both point detectors and probe vehicles. The methodology applies the shockwave theory to model queue evolution over time and space. Using probe vehicle locations and times as well as point detector measured traffic states,analytical formulations for calculating the maximum and minimum( residual) queue length are developed. The proposed methodology is verified using ground truth data collected from numerical experiments conducted in Shanghai,China. It is found that the methodology has a mean absolute percentage error of 17. 09%,which is reasonably effective in estimating the queue length at traffic signalized intersections. Limitations of the proposed models and algorithms are also discussed in the paper.
文摘This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length . When he returns, if the queue length reaches or exceeds threshold , the server is immediately turned on but is temporarily unavailable due to a random setup time before offering service. If not, the server stays in the system until the queue length at least being . We derive the system size distribution and confirm the stochastic decomposition property. We also derive the recursion expressions of queue length distribution and other performance measures. Finally, we present some numerical examples to show the analytical results obtained. Sensitivity analysis is also performed.
基金supported by the National Natural Science Foundation of China(61973261)the Natural Science Foundation of Jilin Province(20210101151JC).
文摘A gated service single vacation M/G/1 queue with setup and closedown periods,and different customer arrival rates,is studied in this paper.The probability generating function of the number of systems for customers who are at the initial moment of service period is analyzed by using a total probability theorem,and the stability condition of the system is obtained.The stationary distribution of the queue length is solved by the regeneration cycle method.The stochastic decomposition of queue length in the steady state is calculated,and the service cycle is obtained.Moreover,classified discussions are established in order to solve the steady-state distribution for the waiting time.The variation of system performance indicators with parameters is analyzed by performing numerical experiments.
基金This work was supported by the National Outstanding Youth Science Foundation ( 7972 50 0 2 ) andthe Nature Education Minister
文摘In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we directly obtain the recursion formula of the L transformation of the transient queue length distribution at any time t , as well as the recursion formula of the equilibrium distribution for calculating conveniently.Furthermore we obtain the stochastic decompositions of the queue length and waiting time in equilibrium.
基金the National Outstanding Youth Science Foundation !(79725002) the Youth Science Foundation of UEST.
文摘This paper studies the bulk-arrival M-x/G/1 queue with single server vacation. By introducing the server busy period and using the Laplace transform, the recursion expression of the Laplace transform of the transient queue-length distribution is derived. Furthermore, the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are obtained. Especially some results for the single-arrival M/G/1 queue with single server vacation and bulk-arrival M-x/G/1 queue but with no server vacation can be derived directly by the results obtained in this paper.
基金This work was supported by the National Natural Science Foundation of China(No.61174160)Post-Doctoral Science Foundation of Central South University(No.125011)The authors are grateful to the three anonymous referees and the editor for their careful reading and invaluable comments and suggestions,which are helpful to improve the paper.This research completed when the first author was a post-doctoral fellow in School of Mathematics,Central South University。
文摘In this paper we study a Geo/T-IPH/1 queue model,where T-IPH denotes the discrete time phase type distribution defined on a birth-and-death process with countably many states.The queue model can be described by a quasi-birth-anddeath(QBD)process with countably phases.Using the operator-geometric solution method,we first give the expression of the operator and the joint stationary distribution.Then we obtain the probability generating function(PGF)for stationary queue length distribution and sojourn time distribution,respectively.
文摘This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributios. A GI/M/1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distribution of the GI/M/1 type Markov process is found explicitly and, consequently, the distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times. Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time. These results can be used to analyze not only the queue length, but also the composition of the queue. Computational methods are developed for calculating steady state distributions related to the queue lengths, sojourn times, and waiting times.
文摘In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.
文摘Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.
基金The National Basic Research Program of China (973 Program) ( No. 2006CB705505)the Basic Scientific Research Fund of Jilin University ( No. 200903209)
文摘In order to describe the travel time of signalcontrolled roads, a travel time model for urban basic roads based on the cumulative curve is proposed. First, the traffic wave method is used to analyze the formation and dispersion of the vehicle queue. Cumulative curves for road entrances and exits are established. Based on the cumulative curves, the travel time of the one-lane road under stable flow input is derived. And then, the multi-lane road is decomposed into a series of single-lane links based on its topological characteristics. Hence, the travel time function for the basic road is obtained. The travel time is a function of road length, flow and control parameters. Numerical analyses show that the travel time depends on the supply-demand condition, and it has high sensitivity during peak hours.
