Algorithm for Fuzzy Maximum Flow Problem in Hyper-Network Setting

Abstract

Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this paper, we consider a generalized fuzzy version of maximum flow problem in hyper-networks setting. Our algorithm is a class of genetic algorithms and based on genetic tricks. The crisp equivalents of fuzzy chance constraints in hyper-networks setting are defined, and the execution steps of encoding and decoding are presented. Finally, we manifest the implement procedure.