GA-BHTR for Partner Selection Problem

Fei Tao; Lin Zhang; Yuanjun Laili

doi:10.1007/978-3-319-08840-2_6

GA-BHTR for Partner Selection Problem

Fei Tao^*
, Lin Zhang
, Yuanjun Laili

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

In this chapter, GA-BHTR (genetic algorithm maintained by using binary heap and transitive reduction) [1] for addressing partner selection problem (PSP) in a virtual enterprise [2] is introduced. Based on ordinary initialization, an improved binary heap strategy is configured before it with uniform population input and output to realize initialization improvement. It is designed to simplify the directed acrylic graph that represents the precedence relationship among the subprojects in PSP and enhance the searching diversity of the algorithm. Then, in order to avoid solutions from converging to a constant value early during evolution, multiple communities are used instead of a single community in GA-BHTR. Operators are configured in different communities independently. Communication among communities is executed by periodic interchange.

Original language	English
Title of host publication	Springer Series in Advanced Manufacturing
Publisher	Springer Nature
Pages	157-189
Number of pages	33
DOIs	https://doi.org/10.1007/978-3-319-08840-2_6
State	Published - 2015

Publication series

Name	Springer Series in Advanced Manufacturing
ISSN (Print)	1860-5168
ISSN (Electronic)	2196-1735

Keywords

Engineering Optimization Problem
Multiple Community
Precedence Relationship
Topology Order
Virtual Enterprise

Access to Document

10.1007/978-3-319-08840-2_6

Cite this

@inbook{af20f2f11d734ea98adbb2bf75c36eef,

title = "GA-BHTR for Partner Selection Problem",

abstract = "In this chapter, GA-BHTR (genetic algorithm maintained by using binary heap and transitive reduction) [1] for addressing partner selection problem (PSP) in a virtual enterprise [2] is introduced. Based on ordinary initialization, an improved binary heap strategy is configured before it with uniform population input and output to realize initialization improvement. It is designed to simplify the directed acrylic graph that represents the precedence relationship among the subprojects in PSP and enhance the searching diversity of the algorithm. Then, in order to avoid solutions from converging to a constant value early during evolution, multiple communities are used instead of a single community in GA-BHTR. Operators are configured in different communities independently. Communication among communities is executed by periodic interchange.",

keywords = "Engineering Optimization Problem, Multiple Community, Precedence Relationship, Topology Order, Virtual Enterprise",

author = "Fei Tao and Lin Zhang and Yuanjun Laili",

note = "Publisher Copyright: {\textcopyright} 2015, Springer International Publishing Switzerland.",

year = "2015",

doi = "10.1007/978-3-319-08840-2\_6",

language = "英语",

series = "Springer Series in Advanced Manufacturing",

publisher = "Springer Nature",

pages = "157--189",

booktitle = "Springer Series in Advanced Manufacturing",

}

TY - CHAP

T1 - GA-BHTR for Partner Selection Problem

AU - Tao, Fei

AU - Zhang, Lin

AU - Laili, Yuanjun

PY - 2015

Y1 - 2015

N2 - In this chapter, GA-BHTR (genetic algorithm maintained by using binary heap and transitive reduction) [1] for addressing partner selection problem (PSP) in a virtual enterprise [2] is introduced. Based on ordinary initialization, an improved binary heap strategy is configured before it with uniform population input and output to realize initialization improvement. It is designed to simplify the directed acrylic graph that represents the precedence relationship among the subprojects in PSP and enhance the searching diversity of the algorithm. Then, in order to avoid solutions from converging to a constant value early during evolution, multiple communities are used instead of a single community in GA-BHTR. Operators are configured in different communities independently. Communication among communities is executed by periodic interchange.

AB - In this chapter, GA-BHTR (genetic algorithm maintained by using binary heap and transitive reduction) [1] for addressing partner selection problem (PSP) in a virtual enterprise [2] is introduced. Based on ordinary initialization, an improved binary heap strategy is configured before it with uniform population input and output to realize initialization improvement. It is designed to simplify the directed acrylic graph that represents the precedence relationship among the subprojects in PSP and enhance the searching diversity of the algorithm. Then, in order to avoid solutions from converging to a constant value early during evolution, multiple communities are used instead of a single community in GA-BHTR. Operators are configured in different communities independently. Communication among communities is executed by periodic interchange.

KW - Engineering Optimization Problem

KW - Multiple Community

KW - Precedence Relationship

KW - Topology Order

KW - Virtual Enterprise

UR - https://www.scopus.com/pages/publications/85151538906

U2 - 10.1007/978-3-319-08840-2_6

DO - 10.1007/978-3-319-08840-2_6

M3 - 章节

AN - SCOPUS:85151538906

T3 - Springer Series in Advanced Manufacturing

SP - 157

EP - 189

BT - Springer Series in Advanced Manufacturing

PB - Springer Nature

ER -

GA-BHTR for Partner Selection Problem

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this