Chance-constrained programming for fuzzy quadratic minimum spanning tree problem

Author

Gao, Jinwu ; Lu, Mei ; Liu, LinZhong

Author_Institution

Dept. of Math. Sci., Tsinghua Univ., Beijing, China

Volume

2

fYear

2004

fDate

25-29 July 2004

Firstpage

983

Abstract

This paper investigates a minimum spanning tree (MST) problem with fuzzy costs and quadratic cost structure, which we call the fuzzy quadratic minimum spanning tree problem (FQMST). After formulating the FQMST problem as a chance-constrained programming model based on a credibility measure, the deterministic equivalent is proposed when the fuzzy direct costs and fuzzy interactive costs are characterized by trapezoidal fuzzy numbers. Then, a genetic algorithm is designed for solving FQMST problems. Finally, a numerical example is provided for illustrating the effectiveness of the genetic algorithm.

Keywords

constraint handling; fuzzy set theory; genetic algorithms; quadratic programming; trees (mathematics); chance constrained programming model; credibility measure; fuzzy direct costs; fuzzy interactive costs; fuzzy quadratic minimum spanning tree problem; genetic algorithm; quadratic cost structure; trapezoidal fuzzy numbers; Algorithm design and analysis; Chromium; Costs; Genetic algorithms; Mathematics; Possibility theory; Power measurement; Quadratic programming; Traffic control; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

Fuzzy Systems, 2004. Proceedings. 2004 IEEE International Conference on

ISSN

1098-7584

Print_ISBN

0-7803-8353-2

Type

conf

DOI

10.1109/FUZZY.2004.1375541

Filename

1375541