Using and application of OWA aggregation operator in fuzzy assignment problem

Classical logic consists of binary values. The precise values can not sometimes correspond the conditions required to be stated. Cases that can be expressed by relative comparison go out of view the binary values. For some concepts of similarity and uncertainty, the use of fuzzy logic would be more appropriate for understanding and absorbing the situation. Mathematically, being fuzzy is has solution set which includes one and zero bounded interval not only one and zero. This infinity solution set gives the problem a flexibility. In this thesis, the use of the OWA aggregation operator in fuzzy assignment problems after a certain algorithm has been studied. The stress function, which reflects the distribution of the OWA weights, is converged through the segmented linear function in the direction of certain patterns. For this purpose, artificial bee colony algorithm was used. In addition, the number of straight segments used in the creation of the segmented linear function can be automatically detected by the algorithm without prior parameterization. It has been found that OWA aggregation operator is more suitable for fuzzy assignment problems compared to other operators. For the visual expression of this problem, the software has developed with C# programming language.