Skip to main content
SpringerLink
Log in

Robust clustering approach for the shortest path problem on finite capacity fuzzy queuing network

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper introduces a new model in the field of fuzzy queuing networks based on the clustering and finite capacity concepts. The proposed model includes fuzzy queuing systems which are located at the nodes of the network. Arc lengths, interarrival times, and service times are all fuzzy triangular fuzzy numbers. In order to find the shortest path on this network, queuing systems should be transformed to waiting times. The waiting times of each system are calculated by a conditional transformation. On the other hand, a robust fuzzy method is proposed for clustering of the arriving customers to the network. Robustness of this method prevents noisy data to affect results. Outputs of the clustering reduce shortest path calculations drastically. Based on a simulation process, the fuzzy queuing network is reduced to a deterministic network. A robust simulated annealing is designed for this network to find the shortest path. Numerical results showed that the clustering process is successful in eliminating outliers, and could be addressed as an efficient method. The convergence and solution time of the algorithm is reasonably better in comparison with published methods. Several experiments are conducted to compare the proposed method with corresponding researches.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kant K (1992) Introduction to computer system performance evaluation. McGraw-Hill, New York

    Google Scholar 

  2. Kleinrock L (1976) Queuing systems. Wiley, New York

    Google Scholar 

  3. Lavenberg SS (1983) Computer performance modeling handbook. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  4. Balsamo S (1994) Properties and analysis of queuing network models with finite capacities. In: Donatiello L, Nelson R (eds) Performance evaluation of computer and communication systems, lecture notes in computer science, vol 729. Springer, Berlin

    Google Scholar 

  5. Balsamo S, De Nitto PV, Onvural R (2001) Analysis of queuing networks with blocking. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  6. Balsamo S, Clo MC, Donaiello L (1993) Cycle time distribution of cyclic networks with blocking. Perform Eval 17:159–168

    Article  MATH  Google Scholar 

  7. Perros HG (1989) Open queuing networks with blocking. In: Takagi H (ed) Stochastic analysis of computer and communications systems. North-Holland, Amsterdam

    Google Scholar 

  8. Van Dijk N (1991) On ‘stop = repeat’ servicing for non-exponential queuing networks with blocking. J Appl Prob 28:159–173

    Article  MATH  Google Scholar 

  9. Van Dijk N (1991) ‘Stop = recirculate’ for exponential product form queuing networks with departure blocking. Oper Res Lett 10:343–351

    Article  MathSciNet  MATH  Google Scholar 

  10. Onvural RO (1990) Survey of closed queuing networks with blocking. ACM Comput Surv 22:83–121

    Article  Google Scholar 

  11. Awan IU, Kouvatsos DD (1999) Approximate analysis of QNMs with space and service priorities. In: Kouvatsos DD (ed) Performance analysis of ATM networks. Kluwer Academic Publishers, IFIP Publication, Dordrecht

    Google Scholar 

  12. Dallery Y, Frein Y (1993) On decomposition methods for tandem queuing networks with blocking. Oper Res 14:386–399

    Article  MathSciNet  Google Scholar 

  13. Lee HS, Bouhchouch A, Dallery Y, Frein Y (1995) Performance evaluation of open queuing networks with arbitrary configurations and finite buffers. In: Proceedings of the Third International Workshop on Queuing Networks with Finite Capacity, Bradford

  14. Majumdar S (1991) Interval arithmetic for performance analysis of distributed computing systems. In: Proceedings of the Canadian Conference on Electrical and Computer Engineering, Quebec

  15. Majumdar S, Ramadoss R (1995) Interval-based performance analysis of computing systems. International Workshop on Modeling and Simulation of Computer and Telecommunication Systems, Durham

  16. Luthi J, Majumdar S, Haring G (1996) Mean value analysis for computer systems with variabilities. In: Workload in Proceedings of the IEEE International Computer Performance Dependability Symposium, Los Alamitos

  17. Luthi J, Hating G (1997) Bottleneck analysis for computer and communication systems with workload variabilities and uncertainties. In: Troth L, Breitenecker F (eds) Proceedings of Second International Symposium on Mathematical Modeling, Vienna

  18. Kaufmann A, Gupta MM (1992) Fuzzy mathematical models in engineering and management science. North Holland, Amsterdam

    Google Scholar 

  19. Zadeh LA (1965) Fuzzy sets. Inform Control 8:338–353

    Article  MathSciNet  MATH  Google Scholar 

  20. Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York

    Book  MATH  Google Scholar 

  21. Voppner FH, Klawonn F, Kruse R, Runkler T (1999) Fuzzy cluster analysis: methods for classification data analysis and image recognition. Wiley, New York

    Google Scholar 

  22. Yang MS (1993) A survey of fuzzy clustering. Math Comput Model 18:1–16

    Article  MATH  Google Scholar 

  23. Wu KL, Yang MS (2002) Alternative c-means clustering algorithms. Pattern Recognit 35:2267–2278

    Article  MATH  Google Scholar 

  24. Yang MS, Ko CH (1996) On a class of fuzzy c-numbers clustering procedures for fuzzy data. Fuzzy Sets Syst 84:49–60

    Article  MathSciNet  MATH  Google Scholar 

  25. Camino MGCA, Frosini G, Lazzerini B, Marcelloni F (2005) On the noise distance in robust fuzzy c-means. World Acad Sci Eng Technol 1:124–128

    Google Scholar 

  26. Davé RN, Krishnapuram R (1997) Robust clustering methods: a unified view. IEEE Trans Fuzzy Syst 5:270–293

    Article  Google Scholar 

  27. Davé RN (1993) Robust fuzzy clustering algorithms. Second IEEE International Conference on Fuzzy Systems 2:1281–1286

    Google Scholar 

  28. Davé RN, Sen S (2002) Robust fuzzy clustering of relational data. IEEE Trans Fuzzy Syst 10:713–727

    Article  Google Scholar 

  29. Kim J, Krishnapuram R, Davé RN (1996) Application of the least trimmed squares techniques to prototype-based clustering. Pattern Recognit Lett 17:633–641

    Article  Google Scholar 

  30. Frigui H, Krishnapuram R (1999) A robust competitive algorithm with applications in computer vision. IEEE Trans Pattern Anal Mach Intell 21:450–465

    Article  Google Scholar 

  31. Keller A (2000) Fuzzy clustering with outliers. In 19th International Conference of the North American Fuzzy Information Processing Society, Atlanta

  32. Biukaghazadeh P, Fatemi Ghomi SMT (2010) network of fuzzy queues: a shortest path. International Industrial Engineering Conference (IIEC), Iran

  33. Liu B, Liu YK (2002) Expected value of fuzzy variable and fuzzy expected value models. IEEE Trans Fuzzy Syst 10:445–450

    Article  Google Scholar 

  34. Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculation by fast computing machines. J Chem Phys 21:1087–1092

    Article  Google Scholar 

  35. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  MATH  Google Scholar 

  36. Pal NR, Pal K, Bezdek JC (1997) A mixed c means clustering model. IEEE international conference on fuzzy systems, Spain

  37. D’Urso P (2005) Fuzzy clustering for data time arrays with inlier and outlier time trajectories. IEEE Trans Fuzzy Syst 13:583–604

    Article  Google Scholar 

  38. Kersten PR (1999) Fuzzy order statistics and their application to fuzzy clustering. IEEE Trans Fuzzy Syst 7:708–712

    Article  Google Scholar 

  39. Hathaway RJ, Bezdek JC, Hu Y (2000) Generalized fuzzy c-means clustering strategies using Lp norm distances. IEEE Trans Fuzzy Syst 8:576–582

    Article  Google Scholar 

  40. Leski JM (2003) Towards a robust fuzzy clustering. Fuzzy Sets Syst 137:215–233

    Article  MathSciNet  MATH  Google Scholar 

  41. Krishnapuram R, Keller J (1993) A possibilistic approach to clustering. IEEE Trans Fuzzy Syst 1:98–110

    Article  Google Scholar 

  42. Krishnapuram R, Keller J (1996) The possibilistic c-means algorithm: insights and recommendations. IEEE Trans Fuzzy Syst 4:385–393

    Article  Google Scholar 

  43. Davé R (1991) Characterization and detection of noise in clustering. Pattern Recognit Lett 12:657–664

    Article  Google Scholar 

  44. Selim SZ, Ismail MA (1984) Soft clustering of multidimensional data: a semi-fuzzy approach. Pattern Recognit 17:559–568

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, 1591634311, Tehran, Iran

    M. Aminnayeri & P. Biukaghazadeh

Authors
  1. M. Aminnayeri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Biukaghazadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Aminnayeri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aminnayeri, M., Biukaghazadeh, P. Robust clustering approach for the shortest path problem on finite capacity fuzzy queuing network. Int J Adv Manuf Technol 61, 745–755 (2012). https://doi.org/10.1007/s00170-011-3719-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3719-2

Keywords

Search

Navigation