"""稳态 M/M/c:利用率接近 1 时的排队等待。运行:python mmf_queueing.py。""" import json import math # math 用于小规模阶乘复核,NumPy 比较逐场景指标,Matplotlib 显示等待曲线。 import matplotlib.pyplot as plt import numpy as np def erlang_c(arrival, service, servers): # 使用同一单位的速率:arrival 是整个系统的到达率;service 是每窗服务率。 if arrival < 0 or service <= 0 or servers < 1 or int(servers) != servers: raise ValueError("请使用非负到达率、正服务率和正整数窗口数") capacity = servers * service # rho 是平均忙碌比例;到达率达到总服务率时没有有限的稳态平均等待。 rho = arrival / capacity if rho >= 1: raise ValueError("利用率须小于 1 才有稳态等待指标") # 用递推计算末项在截断概率中的占比 B,避免直接计算大阶乘。 load = arrival / service fraction = 1.0 for j in range(1, servers + 1): # fraction 表示状态 0 到 j 中,j 个忙窗这一状态的权重占比。 weighted = load * fraction fraction = weighted / (j + weighted) # 把满员状态之后的几何尾部纳入归一化,得到到达顾客需要等待的概率。 p_wait = fraction / (1 - rho + rho * fraction) # wq 单位是分钟,lq 单位是人。两者通过 Lq = λ Wq 相互复核。 wq = p_wait / (capacity - arrival) lq = p_wait * rho / (1 - rho) return rho, p_wait, wq, lq def direct_p_wait(arrival, service, servers): # 课堂小规模复核:用原始公式的有限项与几何尾部。 load = arrival / service rho = load / servers finite_sum = sum(load**k / math.factorial(k) for k in range(servers)) tail = load**servers / math.factorial(servers) / (1 - rho) return tail / (finite_sum + tail) def main(): # 服务台参数为教学假设,每个窗口平均用 1/3 分钟处理一人。 service, servers = 3.0, 2 arrivals = np.array([4.0, 5.7, 5.94]) # 每个场景给四个指标。转置从 3×4 变为 4×3,方便按指标解包。 rho, p_wait, wq, lq = np.array([erlang_c(rate, service, servers) for rate in arrivals]).T direct = [direct_p_wait(rate, service, servers) for rate in arrivals] np.testing.assert_allclose(p_wait, direct, atol=1e-12, rtol=0) np.testing.assert_allclose(lq, arrivals * wq, atol=1e-10, rtol=0) single_rho, _, single_wq, _ = erlang_c(1.5, service, 1) assert abs(single_wq - single_rho / (service - 1.5)) < 1e-12 # 只改变窗口数,保留最后一个高峰到达率,隔离扩容效果。 _, _, extra_wq, _ = erlang_c(arrivals[-1], service, servers + 1) result = { "rho": rho.tolist(), "p_wait": p_wait.tolist(), "wq": wq.tolist(), "lq": lq.tolist(), "wq_extra_server": float(extra_wq), } print("LAB_RESULT " + json.dumps(result)) # 用对数纵轴同时看清常规排队和靠近容量线时的陡增。 fig, ax = plt.subplots() capacity = service * servers # 同一横坐标比较两种配置。两窗方案在容量处无稳态,所以网格略早于虚线结束。 grid = np.linspace(0.5, capacity * 0.997, 180) for count in (servers, servers + 1): wait = [erlang_c(rate, service, count)[2] for rate in grid] ax.semilogy(grid, wait, label=f"{count} windows") ax.scatter(arrivals, wq, color="tab:red", label="Three scenarios", zorder=3) ax.axvline(capacity, color="0.45", linestyle="--", label="2-window capacity") ax.set(xlabel="Arrival rate (people/min)", ylabel="Mean queue wait (min, log scale)", title="M/M/c: rising wait near capacity") ax.legend() fig.tight_layout() if plt.get_backend().lower() == "agg": fig.canvas.draw() else: plt.show() if __name__ == "__main__": main()