Optimization of queueing structures by firefly algorithm

Abstract

In the chapter we describe the application of firefly algorithm in discrete optimization of simple queueing structures such as queueing systems. The optimization of these systems is complicated and there is not any universal method to solve such problem. We briefly cover basic queueing systems. Hence, Markovian systems with exponential service times and a Poisson arrival process with losses, with finite capacity and impatient customers and closed queueing system with finite number of jobs are presented. We consider structural optimization, for example maximization of overall profits and minimizing costs controlled by the number of servers. We show the results of performed experiments. © 2014 Springer International Publishing Switzerland.