Skip to main content
Springer Nature Link
Log in

Finding an optimal core on a tree network with M/G/c/c state-dependent queues

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We consider the stochastic queue core problem on a tree network. Our aim is to find an optimal path on a tree network subject to the average travel time of particles moving along the tree for service given by a server traversing along the optimal path. We assume that particles originating at a node on a tree network request their demands for service randomly and the server is modeled first by an M/M/1 and then by an M/G/1 queue using the FIFO discipline. We consider that all paths along which the particles travel are modeled with an M/G/c/c state-dependent queue with the particles being independent of each other having demands according to the Poisson distribution. Two algorithms are developed for computing the optimal path on a tree network along with the M/M/1 and the M/G/1 queues. The computational complexity of the algorithms and illustrative numerical results obtained by implementations of the algorithms in MATLAB software environment are given.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Alstrup S, Lauridsen PW, Sommerlund P, Thorup M (2001) Finding cores of limited length, IT-C technical report series 2000–4, University of Copenhagen

  • Avella P, Boccia M, Sforza A, Vasil’Ev I (2005) A branch-and-cut algorithm for the median-path problem. Comput Optim Appl 32:215–230

    Article  MathSciNet  MATH  Google Scholar 

  • Averbakh I, Berman O (1999) Algorithms for path medi-centers of a tree network. Comput Oper Res 26:1395–1409

    Article  MathSciNet  MATH  Google Scholar 

  • Batta R (1989) The stochastic queue median over a finite discrete set. Oper Res 37:648–652

    Article  MathSciNet  MATH  Google Scholar 

  • Batta R, Berman O (1989) A location model for a facility operating as an M/G/k queue. Networks 19:717–728

    Article  MathSciNet  MATH  Google Scholar 

  • Becker RI, Chang Y, Lari I, Scozzari A, Storchi G (2002) Finding the \(l\)-core of a tree. Discrete Appl Math 118:25–42

    Article  MathSciNet  MATH  Google Scholar 

  • Berman O, Drezner Z (2007) The multiple server location problems. Oper Res Soc 58:91–99

    Article  MATH  Google Scholar 

  • Berman O, Krass D (2002) Facility location problems with stochastic demands and congestion. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, Berlin, pp 329–371

  • Berman O, Larson RC (1978) The congested median problem. Operations research center working paper, OR, 076-78

  • Berman O, Larson RC (1982) The median problem with congestion. Comput Oper Res 9:119–126

    Article  Google Scholar 

  • Berman O, Mandowsky R (1986) Location-allocation on congested networks. Eur J Oper Res 26:238–250

    Article  MathSciNet  MATH  Google Scholar 

  • Cheah J, Smith JM (1994) Generalized M/G/c/c state dependent queueing models and pedestrian traffic flow. Queueing Syst 15:365–386

    Article  MATH  Google Scholar 

  • Chiu SS, Berman O, Larson RC (1985) Locating a mobile server queuing facility on a tree network. Manag Sci 31:764–772

    Article  MATH  Google Scholar 

  • Gavish B, Sridhar S (1995) Computing the 2-median on tree network is O(nlogn) time. Networks 26:305–317

    Article  MathSciNet  MATH  Google Scholar 

  • Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5:212–221

    Article  MathSciNet  Google Scholar 

  • Hedetniemi SM, Cockaine EJ, Hedetniemi ST (1981) Linear algorithms for finding the Jordan center and path center of a tree. Transp Sci 15:98–114

    Article  MathSciNet  Google Scholar 

  • Jain R, Smith JM (1997) Modeling vehicular traffic flow using M/G/c/c state dependent queueing models. Transp Sci 4:324–336

    Article  MATH  Google Scholar 

  • Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems: part 2. The p-medians. SIAM J Appl Math 37:539–560

    Article  MathSciNet  MATH  Google Scholar 

  • Little JDC (1961) A proof for the queuing formula: \(L=\lambda \)W. Oper Res 9:383–387

    Article  MathSciNet  MATH  Google Scholar 

  • Mitchell DH, Smith JM (2001) Topological network design of pedestrian networks. Transp Res Part B 35:107–135

    Article  Google Scholar 

  • Morgan CA, Slater PJ (1980) A linear algorithm for a core of a tree. J Algorithms 1:247–258

    Article  MathSciNet  MATH  Google Scholar 

  • Moshtagh M, Fathali J, Smith JM (2018) The stochastic queue core problem, evacuation network, and state-dependent queues. Eur J Oper Res 269(2):730–748

    Article  MathSciNet  MATH  Google Scholar 

  • Slater PJ (1982) Locating central paths in a graph. Transp Sci 16:1–18

    Article  Google Scholar 

  • Tamir A (1996) An \(O(pn^2)\) algorithm for the p-median and related problems on tree graphs. Oper Res Lett 19:59–64

    Article  MathSciNet  MATH  Google Scholar 

  • Tregenza PR (1976) The design of interior circulation. Van Nostrand Reinhold Company, New York

    Google Scholar 

  • Wang Q, Batta R, Rump CM (2002) Algorithms for a facility location problem with stochastic customer demand and immobile servers. Ann Oper Res 111:17–34

    Article  MathSciNet  MATH  Google Scholar 

  • Yuhaski S, Smith JM (1989) Modeling circulation systems in buildings using state dependent models. Queuing Syst 4:319–338

    Article  MathSciNet  MATH  Google Scholar 

  • Zaferanieh M, Fathali J (2012) Finding a core of a tree with pos/neg weight. Math Methods Oper Res 76:147–160

    Article  MathSciNet  MATH  Google Scholar 

  • Zaferanieh M, Fathali J (2017) The stochastic queue core problem on a tree. arXiv:1701.01812 [math.OC]

Download references

Acknowledgements

The first and second authors are thankful to Shahrood University of Technology and the fourth author thanks Sharif University of Technology for supporting this work.

Author information

Authors and Affiliations

  1. Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran

    Mehrdad Moshtagh & Jafar Fathali

  2. Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, MA, 01003, USA

    James MacGregor Smith

  3. Faculty of Mathematical Sciences, Sharif University of Technology, Tehran, Iran

    Nezam Mahdavi-Amiri

Authors
  1. Mehrdad Moshtagh
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jafar Fathali
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. James MacGregor Smith
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Nezam Mahdavi-Amiri
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jafar Fathali.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Moshtagh, M., Fathali, J., Smith, J.M. et al. Finding an optimal core on a tree network with M/G/c/c state-dependent queues. Math Meth Oper Res 89, 115–142 (2019). https://doi.org/10.1007/s00186-018-0651-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-018-0651-3

Keywords