Fuzzy quadratic minimum spanning tree problem

被引:40
作者
Gao, JW [1 ]
Lu, M [1 ]
机构
[1] Tsing Hua Univ, Dept Math Sci, Beijing 100084, Peoples R China
基金
中国国家自然科学基金; 高等学校博士学科点专项科研基金;
关键词
minimum spanning tree; fuzzy programming; genetic algorithm; credibility measure;
D O I
10.1016/j.amc.2004.06.051
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 Prufer 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. (c) 2004 Published by Elsevier Inc.
引用
收藏
页码:773 / 788
页数:16
相关论文
共 24 条
[1]  
[Anonymous], 1988, POSSIBILITY THEORY A
[2]  
Bondy J.A., 2008, GRAD TEXTS MATH
[3]   RANKING OF FUZZY-SETS BASED ON THE CONCEPT OF EXISTENCE [J].
CHANG, PT ;
LEE, ES .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1994, 27 (9-10) :1-21
[4]   Fuzzy decision networks and deconvolution [J].
Chang, PT ;
Lee, ES .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1999, 37 (11-12) :53-63
[5]   CHANCE-CONSTRAINED PROGRAMMING [J].
CHARNES, A ;
COOPER, WW .
MANAGEMENT SCIENCE, 1959, 6 (01) :73-79
[6]  
Christofides N, 1975, GRAPH THEORY ALGORIT
[7]  
Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390
[8]   EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS [J].
GABOW, HN ;
GALIL, Z ;
SPENCER, T ;
TARJAN, RE .
COMBINATORICA, 1986, 6 (02) :109-122
[9]  
Gen M., 2000, Genetic Algorithms and Engineering Optimization
[10]   A STUDY OF THE RANKING FUNCTION-APPROACH THROUGH MEAN-VALUES [J].
GONZALEZ, A .
FUZZY SETS AND SYSTEMS, 1990, 35 (01) :29-41