Optimization of Routing Probabilities through the Queueing Network

Queueing designs play an essential role in the operations management of a communication system. The optimization of the routing probabilities through the queueing network has been attaching considerable importance. This problem aims to determine the optimal routing probabilities for minimizing the total cost. In this paper, an approach that integrates ordinal optimization (OO) into ant lion optimization (ALO) is developed to look for an outstanding design within a very short period. The developed approach has two modules. In the first module, the ALO supported by a crude estimate is utilized to establish a candidate subset containing critical designs. In the second module, the optimal computing budget allocation (OCBA) procedure is adopted to select an outstanding design from the candidate subset. The proposed approach has been applied to a queueing network design of 3 queues. The experimental results show that the superiority of the developed method in the solution quality and computing efficiency.