Fuzzy quadratic minimum spanning tree problem

Fuzzy quadratic minimum spanning tree problem

0.00 Avg rating0 Votes
Article ID: iaor2007918
Country: Netherlands
Volume: 164
Issue: 3
Start Page Number: 773
End Page Number: 788
Publication Date: May 2005
Journal: Applied Mathematics and Computation
Authors: ,
Keywords: fuzzy sets, programming: quadratic, heuristics: genetic algorithms
Abstract:

In this paper, a fuzzy quadratic minimum spanning tree problem is formulated as expected value model, chance-constrained programming and dependent-chance programming according to different decision criteria. Then the crisp equivalents are derived when the fuzzy costs are characterized by trapezoidal fuzzy numbers. Furthermore, a simulation-based genetic algorithm using Prüfer number representation is designed for solving the proposed fuzzy programming models as well as their crisp equivalents. Finally, a numerical example is provided for illustrating the effectiveness of the genetic algorithm.

Reviews

Required fields are marked *. Your email address will not be published.