185
Views
12
CrossRef citations to date
0
Altmetric
Original Articles

Fuzzy α-minimum spanning tree problem: definition and solutions

, , &
Pages 311-335 | Received 10 Aug 2014, Accepted 27 Jan 2015, Published online: 12 Apr 2016
 

Abstract

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.

Notes

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by a grant from the National Social Science Foundation of China [grant number 13CGL057].

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.