| Previous | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 |
¡@
Feng-Tse Lin
Department of Applied Mathematics
Chinese Culture University
Taipei, 111 Taiwan
E-mail: ftlin@faculty.pccu.edu.tw
We examine a linear programming problem formulation in which the constraint coefficients
are not precisely given in the work. We investigate the possibility of applying
GAs to solve this kind of fuzzy linear programming problem without defining membership
functions for fuzzy numbers, using the extension principle, interval arithmetic, and
£\-cut operations for fuzzy computations, and using a penalty method for constraint violations.
The proposed approach simulates every fuzzy number by distributing it into certain
partition points. GAs are then used to evolve the values in each partition point. As a
result, the final values represent the membership grade of that fuzzy number. After calculating
the estimated values of each uncertain coefficient, we obtain a defuzzified linear
programming problem. The crisp problem can then be solved using the following GA
stage. The empirical results show that the proposed approach can obtain very good solutions
within the given bounds for each fuzzy coefficient, thereby accomplishing flexible
linear programming.
Received June 14, 2006; revised August 30 & October 18, 2006; accepted October 26, 2006.
Communicated by Pau-Choo Chung.
*Small part of contents has been presented at the 10th Conference on Artificial Intelligence and Applications,
Dec. 2-3, 2005.