Firefly algorithm in optimization of queueing systems

Open access


Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.

[1] X.S. Yang, Nature-Inspired Metaheuristic Algorithms, Luniver Press, London, 2008.

[2] X. S. Yang, “Firefly algorithms for multimodal optimization”, Stochastic Algorithms: Foundations and Applications, SAGA, Lecture Notes in Computer Sciences 5792, 169-178 (2009).

[3] S. Łukasik and S. Żak, “Firefly algorithm for continuous constrained optimization task”, Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems LNCS 5796, 97-106 (2009).

[4] M.K. Sayadi, R. Ramezanian, and N. Ghaffari-Nasab, “A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems”, Int. J. Industrial Eng. Computations 1, 1-10 (2010).

[5] G. Bolch, S. Greiner, H. de Meer, and K.S. Trivedi, Queueing Networks and Markov Chains. Modeling and Performance Evaluation with Computer Science Applications, John Wiley&Sons, London, 1998.

[6] B. Filipowicz, Modeling and Optimization of Queueing Systems. Volume 1, Markovian Systems, T. Rudkowski Publishing House, Cracow, 1999, (in Polish).

[7] B. Filipowicz and J. Kwiecień, “Queueing systems and networks: models and applications”, Bull. Pol. Ac.: Tech. 56 (4), 379-390 (2008).

[8] Ch.H. Lin and J.Ch. Ke, “Optimization analysis for an infinite capacity queueing system with multiple queue-dependent servers: genetic algorithms”, Int. J. Computer Mathematics 88 (7), 1430-1442 (2011).

[9] X.S. Yang, Firefly Algorithm - Matlab files, (2011).

[10] W. Oniszczuk, “Loss tandem networks with blocking - a semi-Markow approach”, Bull. Pol. Ac.: Tech. 58 (4), 673-681 (2010).

[11] S. Balsamo, V. de Nito Persone, and R. Onvural, Analysis of Queueing Networks with Blocking, Kluwer Academic Publishers, Boston, 2001.

Bulletin of the Polish Academy of Sciences Technical Sciences

The Journal of Polish Academy of Sciences

Journal Information

IMPACT FACTOR 2016: 1.156
5-year IMPACT FACTOR: 1.238

CiteScore 2016: 1.50

SCImago Journal Rank (SJR) 2016: 0.457
Source Normalized Impact per Paper (SNIP) 2016: 1.239

Cited By


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 139 139 18
PDF Downloads 71 71 11