在非抢占优先站点轮询系统中顾客等待时间

为了解决银行顾客排队现象,本文提出解决这种排队现象的服务策略,根据服务原则建立模型--具有非抢占优先站点轮询系统,讨论系统在平稳条件下,对于具有一个非抢占的优先权站点且采用穷尽服务方式下的轮询系统进行理论分析,利用排队理论,给出每个站点的队长的概率母函数及顾客的等待时间的拉普拉斯*斯蒂尔切斯变换,实现了该服务方案的定性分析.     

批到达离散时间轮询系统中顾客等待时间及队长

本对批到达离散时间轮询系统进行研究,在门限服务原则下,推出了原客等待时间和轮询周期的概率母函数,利用Markov链理论,得出了队列队长均值。     

逻辑环随机模型负荷非均衡的服务对策分析

本针对逻辑环随机服务模型中实际存在的站点负荷非均衡现象，（1）阐述该类系统的特点和基本要求；（2）分析已有单一服务策略和设置优先站点服务策略的局限性；（3）与分布系统的负荷分配和均衡问题进行对比；（4）探讨克服原有服务策略的不足，提高系统性能的着眼点；（5）分析新提出的服务策略。     

高负荷下分支型轮询排队网络的极限性态

本文研究服务策略具有一般分支性的轮询排队网络.所有队列共享一个服务器,且服务器依次服务每个队列.队列i中的顾客服务完后,以概率pi,j转移到队列j,或以概率pi,0离开系统.利用带移民的多型分支过程的极限定理,本文给出高负荷下服务器进入队列服务时队长联合分布的极限性态;结合平均准则方法,还得到平均等待时间的极限定理.     

基于覆盖率的递归K-均值方法及其在应急系统选址布局中的应用

应急服务的站点选址布局问题是城市应急管理领域中一个重要研究方向.在某行政区域中,为了保证绝大多数的应急需求都能获得及时而有效的服务,同时又要达到建立"最少站点"的目的,提出一种基于覆盖率的递归K-均值方法(CRRKC).与普通K-均值聚类分析不同,所提方法不需要事先给定K值,可以自动得出最佳聚类个数.在实际应用中,方法一方面可以自动计算出某区域所需要的全部站点个数,另一方面可以同时给出每个站点的基本地理位置,十分简便、快捷.仿真算例和实证分析验证了CR,RKC方法的有效性与稳健性.     

大型自行车共享系统的平均场极限理论与排队模型研究

人口的快速增长与空间的高度城市化带来了汽车尾气污染等环境污染问题,这已成为影响社会可持续发展的主要制约因素。基于此,近十年来自行车共享系统在世界多个国家的许多重要城市获得了高度重视并取得了迅速发展。然而,相比于自行车共享系统的快速发展,其相关研究却并未取得较大进展,主要原因在于它是一个大型的复杂系统,涉及密集的城市交通、异构的运营环境、多重的顾客偏好选择以及多渠道的收益管理等多种关联因素。在这种背景下,本文建立了一个通用的大型自行车共享系统,并提出了一种基于平均场极限理论与非时齐排队模型相结合的有效随机模型分析方法,包括利用平均场理论建立了非时齐排队系统、构建了经验测度过程(Empirical measure process)的非线性生灭过程、给出了分段结构下生灭过程的固定点的“几何之和”算法以及提供了问题站点稳态概率的数值计算等等。本文为研究大型自行车共享系统的随机模型提供了一个重要的发展途径,并有望能够用于分析更加一般的大型自行车共享系统。     

共享单车调度优化问题研究

针对共享单车站点经常出现的供需不平衡问题,提出人工调度策略,以提高单车利用率和用户满足率.首先将一天划分为几个用车高峰时段,根据每个站点的单车使用历史数据,计算各站点在每个时段的需求量区间;在区域内单车总投放量不变的前提下,基于每个时段初期各个站点存放的单车数量,确定单车调出站点和单车调入站点,进一步以站点之间的单车调度数量为决策变量,建立共享单车调度问题的整数规划模型,使区域内各个单车站点的供需量基本达到平衡,并且总调度成本最小.利用北京市海淀区共享单车数据进行模拟计算,对比分析了调度优化前后的共享单车利用率和用户满足率.结果显示,调度优化后,单车利用率平均提高7.78%,用户满足率平均提高13.09%;综合考虑企业调度成本和收入情况可以发现,通过调度优化,企业的平均利润增长率为7.53%.本文的研究结果可以帮助共享单车企业提升管理水平,增加利润.     

“公共自行车服务系统”优秀论文点评

<正>1 2013年"高教社杯"全国大学生数学建模竞赛D题公共自行车作为一种低碳、环保、节能、健康的出行方式,正在全国许多城市迅速推广与普及。在公共自行车服务系统中,自行车租赁的站点位置及各站点自行车锁桩和自行车数量的配置,对系统的运行效率与用     

大数据驱动的大型自行车共享系统及其站点车辆再平衡研究

近年来,大数据、云计算与物联网为复杂系统的组织与管理提供了有力的新型信息化技术,并引起了企业的组织架构与运营机制的多方面变化.基于此,本文首先针对大数据驱动的大型自行车共享系统构建了一个新的随机模型,既表达了大数据的重要作用,又描述了大型自行车共享系统的运营过程,特别是使用卡车对各个站点自行车的再平衡.其次,本文提出了一种研究大数据驱动的大型自行车共享系统的平均场极限理论,包括利用平均场理论建立非时齐的排队系统,由非时齐的排队系统建立系统的平均场方程组;给出了经验测度过程(empirical measure process)的非线性生灭过程,提出了分段结构下生灭过程的固定点的有效算法,由此能够计算每个站点稳态平均自行车数;用数值算例分析了每个站点稳态平均自行车数是如何依赖于自行车共享系统中的一些关键参数的.基于此,本文对大数据在大型自行车共享系统中所引起的物理效应进行了建模分析,从而为大型自行车共享系统的随机分析提供了一个极有研究潜力的重要发展方向.     

基于系统动力学的供应链库存策略仿真研究

针对一个动态、多级的供应链库存系统,应用系统动力学的方法,建立了供应链(s,S)库存策略下的物流成本模型,并通过动态仿真,分析了库存策略的变动对于供应链库存系统各级成员间库存供需的动态行为,提出了(s,S)策略下的供应链库存系统的有效管理方法.     

在D-策略控制下服务员单重休假且休假不中断的M/G/1排队系统分析

该文研究在D-策略控制下服务员单重休假且休假不中断的M/G/1 排队系统,其中当服务员休假结束归来时,如果系统中等待服务的顾客所需的总服务时间之和不小于事先给定的正数阀值D,服务员就立即开始服务.运用全概率分解技术、更新过程理论和拉普拉斯变换工具,本文在任意初始状态下讨论了队长的瞬态分布,导出了队长瞬态分布的拉普拉斯变...     

Transient solution of anM/M/1 queue with balking

An infinite capacityM/M/1 queue with balking is discussed. Defining the generating function in an unusual and direct way, the time-dependent solution for the system size is obtained elegantly.     

An M/M/2 queueing system with heterogeneous servers and multiple vacations

In this paper, a Markovian queue with two heterogeneous servers and multiple vacations has been studied. For this system, the stationary queue length distribution and mean system size have been obtained by using matrix geometric method. The busy period analysis of the system and mean waiting time distribution are discussed. Extensive numerical illustrations are provided.     

Batch arrival queue with N-policy and at most J vacations

This paper studies the operating characteristics of an M^[x]/G/1 queueing system with N-policy and at most J vacations. The server takes at most J vacations repeatedly until at least N customers returning from a vacation are waiting in the queue. If no customer arrives by the end of the Jth vacation, the server becomes idle in the system until the number of arrivals in the queue reaches N. We derive the system size distribution at a random epoch and departure epoch, as well as various system characteristics.     

Tail asymptotics for the queue length in an M/G/1 retrial queue

In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and hence the stationary queue length in an M/G/1 retrial queue is subexponential if the stationary queue length in the corresponding M/G/1 queue is subexponential. Our results for subexponential tails also apply to regularly varying tails, and we provide the regularly varying tail asymptotics for the stationary queue length of the M/G/1 retrial queue. AMS subject classifications: 60J25, 60K25     

Some results on a generalized M/G/1 feedback queue with negative customers

This paper deals with a generalized M/G/1 feedback queue in which customers are either “positive" or “negative". We assume that the service time distribution of a positive customer who initiates a busy period is G _e (x) and all subsequent positive customers in the same busy period have service time drawn independently from the distribution G _b (x). The server is idle until a random number N of positive customers accumulate in the queue. Following the arrival of the N-th positive customer, the server serves exhaustively the positive customers in the queue and then a new idle period commences. This queueing system is a generalization of the conventional N-policy queue with N a constant number. Explicit expressions for the probability generating function and mean of the system size of positive customers are obtained under steady-state condition. Various vacation models are discussed as special cases. The effects of various parameters on the mean system size and the probability that the system is empty are also analysed numerically. AMS Subject Classification: Primary: 60 K 25 · Secondary: 60 K 20, 90 B 22     

Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline

The dual queue consists of two queues, called the primary queue and the secondary queue. There is a single server in the primary queue but the secondary queue has no service facility and only serves as a holding queue for the overloaded primary queue. The dual queue has the additional feature of a priority scheme to help reduce congestion. Two classes of customers, class 1 and 2, arrive to the dual queue as two independent Poisson processes and the single server in the primary queue dispenses an exponentially distributed service time at the rate which is dependent on the customer’s class. The service discipline is preemptive priority with priority given to class 1 over class 2 customers. In this paper, we use matrix-analytic method to construct the infinitesimal generator of the system and also to provide a detailed analysis of the expected waiting time of each class of customers in both queues.     

L^2-策略休假下可修的M_1+M_2/G^x(M/G)/1匹配排队系统分析

双输人匹配排队系统是通常排队系统的一种推广．本文对该系统考察了Ｌ２－策略休假和服务台可修的两个重要因素．其中假定系统有两个不同的Ｐｏｉｓｓｏｎ输入，两类顾客按１：１作成一批进行服务，服务台的寿命服从指数分布，服务时间，修理时间和休假时间都服从一般连续型分布，利用向量马氏过程方法，得到了该排队系统的一些重要的稳态排队论指标和可靠性指标．     

Loss probability in a finite discrete-time queue in terms of the steady state distribution of an infinite queue

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that off-periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a finite-buffer queue and the corresponding infinite-buffer queue. With the result, the exact loss probability is obtained in terms of the queue length distribution in the corresponding infinite-buffer queue. Note that this result enables us to compute the loss probability very efficiently, since the queue length distribution in the infinite-buffer queue can be efficiently computed when off-periods are geometrically distributed. This revised version was published online in June 2006 with corrections to the Cover Date.     

Stochastic decompositions in the M/M/1 queue with working vacations

We demonstrate stochastic decomposition structures of the queue length and waiting time in an M/M/1/WV queue, and obtain the distributions of the additional queue length and additional delay. Furthermore, we discuss the relationship between the stochastic decomposition properties of the working vacation queue and those of the standard M/G/1 queue with general vacations.