A GA maintained by binary heap and transitive reduction for addressing PSP

A genetic algorithm (GA) maintained by binary heap and transitive reduction for addressing partner selection problem (PSP) in virtual enterprise is proposed. Compared with the traditional GA for addressing PSP, there are three creative contributions in the proposed algorithm. They are: (a) In order to reduce the time complexity of PSP, an algorithm for generating the directed acrylic graph that represents the precedence relationship among subprojects in PSP is designed firstly; (b) An algorithm for simplifying the graph is proposed; and (c) An algorithm using the turntable maintained by the binary heap to select the better solutions generated during the evolution is proposed. The simulation and experiment results demonstrated that the proposed algorithm has good effectiveness and performance for addressing PSP.