Skip to main navigation Skip to search Skip to main content

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

  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2010 International Conference on Intelligent Computing and Integrated Systems, ICISS2010
Pages12-15
Number of pages4
DOIs
StatePublished - 2010
Event2010 IEEE International Conference on Intelligent Computing and Integrated Systems, ICISS2010 - Guilin, China
Duration: 22 Oct 201024 Oct 2010

Publication series

NameProceedings - 2010 International Conference on Intelligent Computing and Integrated Systems, ICISS2010

Conference

Conference2010 IEEE International Conference on Intelligent Computing and Integrated Systems, ICISS2010
Country/TerritoryChina
CityGuilin
Period22/10/1024/10/10

Keywords

  • Binary heap
  • Genetic algorithm (GA)
  • Partner selection problem (PSP)
  • Transitive reduction

Fingerprint

Dive into the research topics of 'A GA maintained by binary heap and transitive reduction for addressing PSP'. Together they form a unique fingerprint.

Cite this