基于弧长均值和方差的集装箱站场排队网络最短路问题研究

Shortest Path Problem Research Based on the Mean and Variance of the Arc Length in the Container Yard Queuing Network

集装箱站场排队网络属于随机的动态服务系统,顾客从网络的起点进入一直到终点离开该系统的时间长短则反映集装箱站场的服务水平.为使顾客在这一过程花费的时间最短,根据稳态条件下的排队系统理论,结合多准则最短路问题,提出了一种基于弧长均值和方差的双准则最短路算法,并通过算例证明了该算法的可行性.文中提到的方法还适用于寻找随机路径问题中从起点到终点的最短路.

A container yard queuing network is a stochastic and dynamic service system,and the amount of time that a customer spends from his entering the network to leaving it reflects the service level of the system.In order that the customer spends the least time in this process,we propose herein an algorithm of bicriteria shortest path of the queuing network based on the queuing theory under the steady-state condition with multi-criteria shortest path problems.Through an numerical example,it is proved to be feasible.Moreover,the proposed method is suitable for finding the shortest route from the origin to the destination in stochastic routing problems.