Based on the characteristics of " water spider" work,the scheduling of " water spider" operating system is viewed as a vehicle routing problem.In order to minimize objective function T that includes expected waiting time of each station and free time of the "water spider",the mathematical model of "water spider" operating system is built based on the queuing theory.Combined with the actual situation of "water spider" operations,the "water spider" operating system under first come first service strategy,stack strategy,one center multiple partition strategy and multiple center multiple partition strategy are respectively described and analyzed.Simulation models under the four scheduling policy are built based on Monte Carlo simulation,and the results of the four models are calculated.Through comparative analyses,the average completion time of task,the average arrival time of task,the average waiting time of task and " water spider" free rate under the four strategies are compared.The advantages and disadvantages of four scheduling strategies are shown.
"water spider" workvehicle routing problemqueuing theorymathematical modelscheduling policymonte Carlo simulation
NETL
NSTL
维普
万方数据
