跳到主要导航 跳到搜索 跳到主要内容

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

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名Proceedings - 2010 International Conference on Intelligent Computing and Integrated Systems, ICISS2010
12-15
页数4
DOI
出版状态已出版 - 2010
活动2010 IEEE International Conference on Intelligent Computing and Integrated Systems, ICISS2010 - Guilin, 中国
期限: 22 10月 201024 10月 2010

出版系列

姓名Proceedings - 2010 International Conference on Intelligent Computing and Integrated Systems, ICISS2010

会议

会议2010 IEEE International Conference on Intelligent Computing and Integrated Systems, ICISS2010
国家/地区中国
Guilin
时期22/10/1024/10/10

学术指纹

探究 'A GA maintained by binary heap and transitive reduction for addressing PSP' 的科研主题。它们共同构成独一无二的学术指纹。

引用此