Skip to main content
SpringerLink
Log in

Genetic Cost Optimization of the GI/M/1/N Finite-Buffer Queue with a Single Vacation Policy

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7895))

Included in the following conference series:

Abstract

In the artice, problem of the cost optimization of the GI/M/1/N-type queue with finite buffer and a single vacation policy is analyzed. Basing on the explicit representation for the joint transform of the first busy period, first idle time and the number of packets transmitted during the first busy period and fixed values of unit costs of the server’s functioning an optimal set of system parameters is found for exponentially distributed vacation period and 2-Erlang distribution of inter arrival times. The problem of optimization is solved using genetic algorithm. Different variants of the load of the system are considered as well.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gabryel, M., Woźniak, M., Nowicki, R.K.: Creating learning sets for control systems using an evolutionary method. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) EC 2012 and SIDE 2012. LNCS, vol. 7269, pp. 206–213. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Gupta, U.C., Banik, A.D., Pathak, S.S.: Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline. Journal of Applied Mathematics and Stochastic Analysis 3, 353–373 (2005)

    Article  MathSciNet  Google Scholar 

  3. Gupta, U.C., Sikdar, K.: Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation. Appl. Math. Comput. 174(2), 1498–1525 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kella, O.: Optimal control of the vacation scheme in an M/G/1 queue. Oper. Res. 38(4), 724–728 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kempa, W.M.: GI/G/1/ ∞ batch arrival queuing system with a single exponential vacation. Math. Method. Oper. Res. 69(1), 81–97 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kempa, W.M.: Some new results for departure process in the M X/G/1 queuing system with a single vacation and exhaustive service. Stoch. Anal. Appl. 28(1), 26–43 (2009)

    Article  MathSciNet  Google Scholar 

  7. Kempa, W.M.: Characteristics of vacation cycle in the batch arrival queuing system with single vacations and exhaustive service. Int. J. Appl. Math. 23(4), 747–758 (2010)

    MathSciNet  MATH  Google Scholar 

  8. Kempa, W.M.: On departure process in the batch arrival queue with single vacation and setup time. Annales UMCS, Informatica 10(1), 93–102 (2010)

    Article  MathSciNet  Google Scholar 

  9. Kempa, W.M.: The virtual waiting time in a finite-buffer queue with a single vacation policy. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 47–60. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Lillo, R.E.: Optimal operating policy for an M/G/1 exhaustive server-vacation model. Methodol. Comput. Appl. 2(2), 153–167 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Niu, Z., Takahashi, Y.: A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes. Queueing Syst. 31, 1–23 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Niu, Z., Shu, T., Takahashi, Y.: A vacation queue with setup and close-down times and batch Markovian arrival processes. Perform. Evaluation 54(3), 225–248 (2003)

    Article  Google Scholar 

  13. Nowicki, R.K., Kempa, W.M., Woźniak, M.: Characteristics of vacation cycle in a finite-buffer queue with single vacation policy - analytical study with optimization. Int. J. Appl. Math. Comp. Sci. (submitted)

    Google Scholar 

  14. Takagi, H.: Queueing Analysis, vol. 1: Vacation and Priority Systems, vol. 2. Finite Systems. North-Holland, Amsterdam (1993)

    Google Scholar 

  15. Takagi, H.: M/G/1/N queues with server vacations and exhaustive service. Oper. Res. 42(5), 926–939 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Teghem Jr., J.: Control of the service process in a queueing system. Eur. J. Oper. Res. 23, 141–158 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Teghem Jr., J.: Optimal control of a removable server in an M/G/1 queue with finite capacity. Eur. J. Oper. Res. 31, 358–367 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tian, N., Zhang, Z.G.: Vacation queueing models. Theory and applications. Springer, New York (2006)

    MATH  Google Scholar 

  19. Woźniak, M.: Model of artificial intelligence for active control of selected vehicle dynamic characteristics, PhD. Thesis, Czestochowa University of Technology, Department of Mechanical Engineering and Computer Science, Czestochowa (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Intelligence, Czestochowa University of Technology, Al. Armii Krajowej 36, 42-200, Czestochowa, Poland

    Marcin Gabryel & Robert K. Nowicki

  2. Institute of Mathematics, Silesian University of Technology, ul. Kaszubska 23, 44-100, Gliwice, Poland

    Marcin Woźniak & Wojciech M. Kempa

Authors
  1. Marcin Gabryel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert K. Nowicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcin Woźniak
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wojciech M. Kempa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski , Marcin Korytkowski  & Rafał Scherer ,  & 

  2. AGH University of Science and Technology, Michiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, University of California, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Electrical and Computer Engineering, University of Louisville, 405 Lutz Hall, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gabryel, M., Nowicki, R.K., Woźniak, M., Kempa, W.M. (2013). Genetic Cost Optimization of the GI/M/1/N Finite-Buffer Queue with a Single Vacation Policy. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2013. Lecture Notes in Computer Science(), vol 7895. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38610-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38610-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38609-1

  • Online ISBN: 978-3-642-38610-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation