{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:40:10Z","timestamp":1766158810085,"version":"build-2065373602"},"reference-count":50,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Minimum spanning tree problem (MSTP) has allured many researchers and practitioners due to its varied range of applications in real world scenarios. Modelling these applications involves the incorporation of indeterminate phenomena based on their subjective estimations. Such phenomena can be represented rationally using uncertainty theory. Being a more realistic variant of MSTP, in this article, based on the principles of the uncertainty theory, we have studied a multi-objective minimum spanning tree problem (MMSTP) with indeterminate problem parameters. Subsequently, two uncertain programming models of the proposed uncertain multi-objective minimum spanning tree problem (UMMSTP) are developed and their corresponding crisp equivalence models are investigated, and eventually solved using a classical multi-objective solution technique, the epsilon-constraint method. Additionally, two multi-objective evolutionary algorithms (MOEAs), non-dominated sorting genetic algorithm II (NSGAII) and duplicate elimination non-dominated sorting evolutionary algorithm (DENSEA) are also employed as solution methodologies. With the help of the proposed UMMSTP models, the practical problem of optimizing the distribution of petroleum products was solved, consisting in the search for symmetry (balance) between the transportation cost and the transportation time. Thereafter, the performance of the MOEAs is analyzed on five randomly developed instances of the proposed problem.<\/jats:p>","DOI":"10.3390\/sym14010106","type":"journal-article","created":{"date-parts":[[2022,1,9]],"date-time":"2022-01-09T23:35:09Z","timestamp":1641771309000},"page":"106","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["On Multi-Objective Minimum Spanning Tree Problem under Uncertain Paradigm"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3149-2840","authenticated-orcid":false,"given":"Saibal","family":"Majumder","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, NSHM Knowledge Campus Durgapur, Durgapur 713212, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7324-731X","authenticated-orcid":false,"given":"Partha Sarathi","family":"Barma","sequence":"additional","affiliation":[{"name":"Center for Distance and Online Education, The University of Burdwan, Burdwan 713104, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2576-8919","authenticated-orcid":false,"given":"Arindam","family":"Biswas","sequence":"additional","affiliation":[{"name":"School of Mines and Metallurgy, Kazi Nazrul University (Public University), Asansol 713340, India"}]},{"given":"Pradip","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Durgapur, Durgapur 713209, India"}]},{"given":"Bijoy Kumar","family":"Mandal","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, NSHM Knowledge Campus Durgapur, Durgapur 713212, India"}]},{"given":"Samarjit","family":"Kar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Institute of Technology Durgapur, Durgapur 713209, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4414-8547","authenticated-orcid":false,"given":"Pawe\u0142","family":"Ziemba","sequence":"additional","affiliation":[{"name":"Institute of Management, University of Szczecin, 70-453 Szczecin, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.ijpsycho.2014.04.001","article-title":"The trees and the forest: Characterization of complex brain networks with minimum spanning trees","volume":"92","author":"Stam","year":"2014","journal-title":"Int. J. Psychophysiol."},{"key":"ref_2","first-page":"54","article-title":"Minimum spanning trees and single linkage cluster analysis","volume":"18","author":"Gower","year":"1969","journal-title":"J. R. Stat. Soc. Ser. C (Appl. Stat.)"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0262-8856(96)01105-5","article-title":"2D image segmentation using minimum spanning trees","volume":"15","author":"Xu","year":"1997","journal-title":"Image Vis. Comput."},{"key":"ref_4","first-page":"37","article-title":"O jist\u00e9m problem minim\u00e1ln\u00edm","volume":"III","year":"1926","journal-title":"Pr\u00e1ce Morav. P\u0159\u00edrodov\u0115deck\u00e9 Spole\u010dnosti"},{"key":"ref_5","first-page":"57","article-title":"O jist\u00e9m problem minim\u00e1ln\u00edm","volume":"IV","year":"1930","journal-title":"Pr\u00e1ce Morav. P\u0159\u00edrodov\u0115deck\u00e9 Spole\u010dnosti"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"key":"ref_8","unstructured":"Ehrgott, M. (2005). Multi-Criteria Optimization, Springer."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.cor.2006.02.023","article-title":"Computing all efficient solutions of the bi-objective minimum spanning tree problem","volume":"35","author":"Steiner","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1111\/j.1475-3995.2011.00815.x","article-title":"Multi-criteria path and tree problems: Discussion on exact algorithms and applications","volume":"19","author":"Pascoal","year":"2012","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0377-2217(98)00016-2","article-title":"Genetic algorithm approach on multi-criteria minimum spanning tree problem","volume":"114","author":"Zhou","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Moradkhan, M.D., and Browne, W.N. A knowledge-based evolution strategy for the multi-objective minimum spanning tree problem. Proceedings of the 2006 IEEE International Conference on Evolutionary Computation, Vancouver, BC, Canada, 16\u201321 July 2006.","DOI":"10.1109\/CEC.2006.1688471"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"5051","DOI":"10.19026\/rjaset.5.4396","article-title":"Research on multi-objective minimum spanning tree algorithm based on ant algorithm","volume":"5","author":"Li","year":"2013","journal-title":"Res. J. Appl. Sci. Eng. Technol."},{"key":"ref_14","unstructured":"Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. (1993). Network Flows, Prentice-Hall."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of the minimum spanning tree problem","volume":"7","author":"Graham","year":"1985","journal-title":"Ann. Hist. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(81)90004-4","article-title":"Stochastic spanning tree problem","volume":"3","author":"Ishii","year":"1981","journal-title":"Discret. Appl. Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","article-title":"On the value of a random minimum spanning tree problem","volume":"10","author":"Frieze","year":"1985","journal-title":"Discret. Appl. Math."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0895-7177(95)00183-3","article-title":"Confidence regional method of stochastic spanning tree problem","volume":"22","author":"Ishii","year":"1995","journal-title":"Math. Comput. Model."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/11496915_24","article-title":"On two-stage stochastic minimum spanning trees","volume":"Volume 3509","author":"Kaibel","year":"2005","journal-title":"Integer Programming and Combinatorial Optimization"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"012004","DOI":"10.1088\/1757-899X\/1047\/1\/012004","article-title":"Optimization of the production plan of drill bits with fuzzy constraints based on a heuristic method","volume":"1047","author":"Orazbayev","year":"2021","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Zhumadillayeva, A., Orazbayev, B., Santeyeva, S., Dyussekeyev, K., Li, R.Y.M., Crabbe, M.J.C., and Yue, X.-G. (2020). Models for oil refinery waste management using determined and fuzzy conditions. Information, 11.","DOI":"10.3390\/info11060299"},{"key":"ref_22","unstructured":"Liu, B. (2007). Uncertainty Theory, Springer. [2nd ed.]."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liu, B. (2009). Theory and Practice of Uncertain Programming, Springer. [2nd ed.].","DOI":"10.1007\/978-3-540-89484-1"},{"key":"ref_24","unstructured":"Liu, B. (2010). Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty, Springer."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1016\/j.camwa.2011.07.058","article-title":"Shortest path problem with uncertain arc lengths","volume":"62","author":"Gao","year":"2011","journal-title":"Comput. Math. Appl."},{"key":"ref_26","first-page":"18","article-title":"Uncertain programming model for Chinese postman problem with uncertain weights","volume":"11","author":"Zhang","year":"2012","journal-title":"Ind. Eng. Manag. Syst."},{"key":"ref_27","first-page":"3901","article-title":"A new uncertain programming model for project scheduling problem","volume":"15","author":"Zhang","year":"2012","journal-title":"Information"},{"key":"ref_28","first-page":"9","article-title":"Two uncertain programming models for inverse minimum spanning tree problem","volume":"12","author":"Zhang","year":"2013","journal-title":"Ind. Eng. Manag. Syst."},{"key":"ref_29","first-page":"76","article-title":"A chance-constrained programming model for inverse spanning tree problem with uncertain edge weights","volume":"5","author":"Zhang","year":"2013","journal-title":"Int. J. Adv. Comput. Technol."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0218488515500038","article-title":"Path optimality conditions for minimum spanning tree problem with uncertain edge weights","volume":"23","author":"Zhou","year":"2015","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1142\/S0218488516500264","article-title":"Uncertain distribution-minimum spanning tree problem","volume":"24","author":"Zhou","year":"2016","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"385","DOI":"10.12720\/jcm.9.5.385-390","article-title":"Uncertain quadratic minimum spanning tree problem","volume":"9","author":"Zhou","year":"2014","journal-title":"J. Commun."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/j.asoc.2016.07.054","article-title":"Degree constrained minimum spanning tree problem with uncertain edge weights","volume":"56","author":"Gao","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10845-014-1015-3","article-title":"Minimum spanning tree problem of uncertain random network","volume":"28","author":"Sheng","year":"2017","journal-title":"J. Intell. Manuf."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/s12652-017-0493-5","article-title":"Degree constrained minimum spanning tree problem of uncertain random network","volume":"8","author":"Gao","year":"2017","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"ref_36","first-page":"506","article-title":"Sustainable multi-depot emergency facilities location-routing problem with uncertain information","volume":"333","author":"Zhang","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_37","first-page":"296","article-title":"On a bi-criterion formulation of the problems of integrated system identification and system optimization","volume":"1","author":"Haimes","year":"1971","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGAII","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_39","first-page":"575","article-title":"Improving computational mechanics optimum design using helper objectives: An application in frame bar structures","volume":"Volume 4403","author":"Greiner","year":"2007","journal-title":"Proceedings of the 4th International Conference on Evolutionary MultiCriterion Optimization, EMO 2007, Matsushima, Japan, 5\u20138 March 2007"},{"key":"ref_40","first-page":"3","article-title":"Some research problems in uncertainty theory","volume":"3","author":"Liu","year":"2009","journal-title":"J. Uncertain Syst."},{"key":"ref_41","first-page":"181","article-title":"Expected value of function of uncertain variables","volume":"4","author":"Liu","year":"2010","journal-title":"J. Uncertain Syst."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TFUZZ.2002.800692","article-title":"Expected value of fuzzy variable and fuzzy expected value models","volume":"10","author":"Liu","year":"2002","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","article-title":"Chance-constrained programming","volume":"6","author":"Charnes","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","article-title":"jMetal: A Java framework for multi-objective optimization","volume":"42","author":"Durillo","year":"2011","journal-title":"Adv. Eng. Softw."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multi-objective evolutionary algorithms: A comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_46","unstructured":"Zhou, A., Jin, Y., Zhang, Q., Sendhoff, B., and Tsang, E. (2006, January 16\u201321). Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. Proceedings of the 2006 IEEE International Conference on Evolutionary Computation, CEC 2006, Vancouver, BC, Canada."},{"key":"ref_47","unstructured":"Van Veldhuizen, D.A., and Lamont, G.B. (1998). Multi-Objective Evolutionary Algorithm Research: A History and Analysis, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB. Technical Report TR-98-03."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","article-title":"Performance assessment of multi-objective optimizers: An analysis and review","volume":"7","author":"Zitzler","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1080\/10618600.2017.1305277","article-title":"Letter-value plots: Boxplots for large data","volume":"26","author":"Hofmann","year":"2017","journal-title":"J. Comput. Graph. Stat."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/00031305.1998.10480559","article-title":"Violin Plots: A Box Plot-Density Trace Synergism","volume":"52","author":"Hintze","year":"1998","journal-title":"Am. Stat."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/1\/106\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:27:00Z","timestamp":1760362020000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/1\/106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,8]]},"references-count":50,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["sym14010106"],"URL":"https:\/\/doi.org\/10.3390\/sym14010106","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,1,8]]}}}