论文部分内容阅读
一、问题的提出 复杂随机服务系统的优化或规划设计问题,因系统和运行环境的复杂性及随机性,一般都采用计算机模拟技术。如果把N个随机服务系统组成一个复杂的排队网络系统,用计算机模拟也能得到比较好的解决。可是,当每个子系统的状态都比较多(设i子系统的状态数为S_i),因为模拟技术不能直接求最优解这一固有缺陷,要确定系统的最优运行状态就必须把所有各子系统不同状态之间的匹配情况都进行模拟(这便需要对整个系统模拟S_1 S_2…S_N次),然后再比较各次模拟结果,从中选出最优解。如果系统的状态数较大或一次模拟花费的机时较长,则S_1 S_2…S_N次模拟所花费的总机时
First, the question raised Complex random service system optimization or planning and design issues, due to the complexity of the system and operating environment and randomness, the general use of computer simulation technology. If the N random service system to form a complex queuing network system, computer simulation can get a better solution. However, when the state of each subsystem is relatively large (assuming the number of subsystems i is S_i), because simulation technology can not directly find the optimal solution, it is necessary to determine the optimal operating conditions of all subsystems The matching between different states of the subsystems is simulated (which needs to simulate S_1S_2 ... S_N times for the whole system), and then compare the simulation results to select the optimal solution. If the system has a large number of states or a long simulation time spent on the machine, S_1S_2 ... S_N simulates the total switchboard time spent