Optimization of Queueing Structures by Firefly Algorithm

Part of the Studies in Computational Intelligence book series (SCI, volume 516)


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.


Queueing systems Queueing structures Structural optimization Cost optimization Optimization algorithm Firefly algorithm 


  1. 1.
    Bhat, U. N.: An Introduction to Queueing Theory. In: Modeling and Analysis in Applications. Birkhauser, Verlag, Boston (2008)Google Scholar
  2. 2.
    Bolch, G. et al.: Queueing networks and markov chains. In: Modeling and Performance Evaluation with Computer Science Applications. Wiley, New York (1998)Google Scholar
  3. 3.
    Filipowicz, B.: Stochastic Models in Operation Research: Analysis and Synthesis of Queueing Systems and Networks. Warsaw, WNT (1996). (in Polish)Google Scholar
  4. 4.
    Filipowicz, B., Kwiecień, J.: Queueing systems and networks: models and applications. Bulletin of the Polish Academy of Sciences. Tech. Sci. 56, 379–390 (2008)Google Scholar
  5. 5.
    Gautam, N.: Analysis of Queues: Methods and Applications. CRC Press, Taylor and Francis Group, Boca Raton (2012)Google Scholar
  6. 6.
    Gross, D. et al.: Fundamentals of Queueing Theory, 4th edn. Wiley, New York (2008)Google Scholar
  7. 7.
    Kleinrock, L.: Queueing Systems, vol. I: Theory. Wiley, New York (1975)Google Scholar
  8. 8.
    Kleinrock, L.: Queueing Systems, vol. II: Computer Applications. Wiley, New York (1976)Google Scholar
  9. 9.
    Kwiecień, J., Filipowicz, B.: Firefly algorithm in optimization of queueing systems. Bulletin of the Polish Academy of Sciences. Tech. Scie. 60, 363–368 (2012)Google Scholar
  10. 10.
    Lin, ChH, Ke, J.Ch.: Optimization analysis for an infinite capacity queueing system with multiple queue-dependent servers: genetic algorithms. Int. J. Comp. Math. 88(7), 1430–1442 (2011)Google Scholar
  11. 11.
    Łukasik, S., \(\dot{Z}\)ak, S.: Firefly algorithm for continuous constrained optimization task, computational collective intelligence. Semantic web, social networks and multiagent systems. LNCS 5796, 97–106 (2009)Google Scholar
  12. 12.
    Mishra, S.S., Yadav, D.K.: Computational approach to profit optimization of a loss-queueing system. J. Appl. Comput. Sci. Math. 9, 78–82 (2010)Google Scholar
  13. 13.
    Stidham, S. Jr.: Optimal Design of Queueing Systems. CRC Press, Taylor and Francis Group, Boca Raton (2009)Google Scholar
  14. 14.
    Verma, R.K.: Multiobjective optimization of a queueing system. J. Math. Program. Oper. Res. 17, 103–111 (1986)MATHGoogle Scholar
  15. 15.
    Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Frome (2008)Google Scholar
  16. 16.
    Yang, X.S.: Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications. SAGA, LNCS 5792, 169–178 (2009)Google Scholar
  17. 17.
    Yang, X.S.: Firefly Algorithm—Matlab files, available: Accessed 25 Feb 2012

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.AGH University of Science and TechnologyKrakowPoland

Personalised recommendations