A new approach in modeling and solving the minimal spanning tree problem

Document Type : Original Article

Authors

Abstract

One of the most important developments in fuzzy theory is hesitant fuzzy sets. In this expansion, in addition to the possibility of considering numbers fuzzy, the opinions of different decision-makers can be considered to prevent inconsistencies and conflicts between their views and, of course, to make the data more consistent with the prevailing reality of the issues. In this research, we intend to carefully present a new method with comparative fuzzy sets to compare these types of numbers with the characteristics that hesitant fuzzy sets have. For this purpose, while paying attention to the fuzzy nature of the opinion of each of the different experts, the commonality between their views and issues such as optimistic or pessimistic attitudes is sufficiently careful. The issue of determining the tree with minimum weight is one of the main and widely used issues in various branches of science and engineering. Given the widespread use of this problem in streaming networks and the discussion of uncertainties in real-world application problems, the following paper presents the efficiency process for finding the minimum peripheral tree with hesitant fuzzy data, in which a new ranking method is proposed. Used in this post. We then solve a numerical example to verify process performance. At the end, the conclusion of the research and suggestions for further research are given.

Keywords


[1] داریوش، ف. شریفیان، هنگامه. سجادی راد، احمد. (۱۳۹۵) شناسایی و دسته بندی صنایع اثرگذار با استفاده از درخت فراگیر کمینه فاصله فرامتریک با توجه به هدفمندی یارانه ها (مطالعه موردی: بورس اوراق بهادار تهران). مجله‌ی مطالعات اقتصاد، مدیریت مالی و حسابداری، دوره دوم، شماره ۱/۲ ، صص. ۱۰ تا ۲۷.
 
[2] مودب، ه. ملائک، م ب. کوثری، ا. ر. (۱۳۹۹) مسیرهای بهینه ترکیبی (هوایی- دریایی) با استفاده از درخت پوشای کمینه و برنامه ریزی عدد صحیح. مجله‌ی مهندسی مکانیک شریف، دوره ۳۶۰۰۰۳، شماره ۲.
 
[3] سعادتی، س ز. ساجدی، ه. (۱۳۹۲) تجمیع داده‌ها در شبکه‌های حسگر بی سیم مبتنی بر خوشه بندی و درخت پوشای کمینه. مجله‌ی علوم و فناوری‌های پدافند نوین، شماره ۴ (پیاپی ۱۴).
 
[4] سرایی، م ح. رضایی، م ر. عادلی، م. (۱۳۹۹) حل مسئله درخت پوشای کمینه در طراحی شبکه‌ی رسانه‌ای اجتماعی ایزوله‌ی مدیریت بحران زلزله (مطالعه موردی: شهر گرگان). فصلنامه مطالعات ساختار و کارکرد شهری، سال هفتم، شماره ۲۳، صص. ۲۹ تا ۵۵.
 
[5] Al Mamun, A., Rajaskaran, S. (2016) An Efficient Minimum Spanning Tree Algorithm. IEEE Symposium on Computers and Communication (ISCC).
 
[6] Mordeson, J. N, Mathew, S. and Davender S. Malik. (2018). Fuzzy Graph Theory with Applications to Human Trafficking (1st. ed.). Springer Publishing Company, Incorporated.
 
[7] Mordeson, J. N., Mathew, S. (2019). Advanced topics in fuzzy graph theory. Springer Publishing Company, Incorporated.
 
[8] Torra, V, (2010). Hesitant fuzzy sets, Int J Intell Syst 25, 529–539.
 
[9] Zhang, X.L, Xu, Z.S. (2012). A MST clustering analysis method under hesitant fuzzy environment. Control and Cybernetics 41, 645–666.
 
[10] Zimmermann, (1995) H. J. Fuzzy set theory and its Application, kluwer Academic publishers, Boston / Derdecht / London.
 
[11] Ranjbar, M., Miri, S. M., and S. Effati, (2020). Hesitant fuzzy numbers with (α, k)-cuts in compact intervals and applications, Expert Systems with Applications, vol. 151, p. 113363.
 
[12] Ma, M., Friedman, M., and Kandel, A. (1999). A new fuzzy arithmetic, fuzzy sets and systems, vol. 108, no. 1, pp. 83-90.
 
[13] Abbasi Shureshjani. R., Darehmiraki, M. (2013), A new parametric method for ranking fuzzy numbers, Indagationes Mathematicae. 24, 518–529.
 
[14] Ahuja, R. K., T.L. Magnanti, T. L., Orlin, J. B., Network Flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.