Fuzzy α-minimum spanning tree problem: definition and solutions

In this paper, the minimum spanning tree problem is investigated on the graph with fuzzy edge weights. The notion of fuzzy -minimum spanning tree is presented based on the credibility measure, and then the solutions of the fuzzy -minimum spanning tree problem are discussed under different assumptions. First, we respectively, assume that all the edge weights are triangular fuzzy numbers and trapezoidal fuzzy numbers and prove that the fuzzy -minimum spanning tree problem can be transformed to a classical problem on a crisp graph in these two cases, which can be solved by classical algorithms such as the Kruskal algorithm and the Prim algorithm in polynomial time. Subsequently, as for the case that the edge weights are general fuzzy numbers, a fuzzy simulation-based genetic algorithm using Prüfer number representation is designed for solving the fuzzy -minimum spanning tree problem. Some numerical examples are also provided for illustrating the effectiveness of the proposed solutions.

[1]  Hiroaki Ishii,et al.  An Approach Based on Necessity Measure to the Fuzzy Spanning Tree Problems , 1996 .

[2]  L. Zadeh.  Fuzzy sets as a basis for a theory of possibility , 1999 .

[3]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[4]  Karel Antoš.  Minimum spanning tree problem , 2015 .

[5]  Temel Öncan,et al.  Design of capacitated minimum spanning tree with uncertain cost and demand parameters , 2007, Inf. Sci..

[6]  Hiroaki Ishii,et al.  Stochastic spanning tree problem , 1981, Discret. Appl. Math..

[7]  Fan Yang,et al.  Fuzzy arithmetic on LR fuzzy numbers with applications to fuzzy programming , 2015, J. Intell. Fuzzy Syst..

[8]  Mohammad Reza Meybodi,et al.  A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs , 2012, The Journal of Supercomputing.

[9]  Ping-Teng Chang,et al.  Fuzzy decision networks and deconvolution , 1999 .

[10]  Mitsuo Gen,et al.  An effective genetic algorithm approach to the quadratic minimum spanning tree problem , 1998, Comput. Oper. Res..

[11]  Akebo Yamakami,et al.  An Evolutionary Approach to Solve Minimum Spanning Tree Problem with Fuzzy Parameters , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[12]  Mitsuo Gen,et al.  Genetic algorithm approach on multi-criteria minimum spanning tree problem , 1999, Eur. J. Oper. Res..

[13]  Chien-Hung Liu,et al.  A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm , 2007, Expert Syst. Appl..

[14]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[15]  Alan Frieze,et al.  SPANNING TREE PROBLEM , 1985 .

[16]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[17]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[18]  Javad Akbari Torkestani.  DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH , 2012, Cybern. Syst..

[19]  Adam Janiak,et al.  The minimum spanning tree problem with fuzzy costs , 2008, Fuzzy Optim. Decis. Mak..

[20]  Jinwu Gao,et al.  Fuzzy quadratic minimum spanning tree problem , 2005, Appl. Math. Comput..

[21]  A. Cayley.  A theorem on trees , 2009 .

[22]  Chien-Hung Liu,et al.  A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[23]  Baoding Liu,et al.  Theory and Practice of Uncertain Programming , 2003, Studies in Fuzziness and Soft Computing.

[24]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[25]  Robert E. Osteen,et al.  Picture Skeletons Based on Eccentricities of Points of Minimum Spanning Trees , 1974, SIAM J. Comput..

[26]  H. Ishii,et al.  Confidence regional method of stochastic spanning tree problem , 1995 .

[27]  Chaitanya Swamy,et al.  Approximation algorithms for 2-stage stochastic optimization problems , 2006, SIGA.

[28]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[29]  Didier Dubois,et al.  Possibility theory , 2018, Scholarpedia.

[30]  Yian-Kui Liu,et al.  Expected value of fuzzy variable and fuzzy expected value models , 2002, IEEE Trans. Fuzzy Syst..

[31]  Mohit Singh,et al.  On Two-Stage Stochastic Minimum Spanning Trees , 2005, IPCO.

[32]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[33]  B ShmoysDavid,et al.  Approximation algorithms for 2-stage stochastic optimization problems , 2006 .

[34]  Lotfi A. Zadeh,et al.  A Theory of Approximate Reasoning , 1979 .