TY - JOUR
T1 - Green partner selection in virtual enterprise based on Pareto genetic algorithms
AU - Zhang, Yue
AU - Tao, Fei
AU - Laili, Yuanjun
AU - Hou, Baocun
AU - Lv, Lin
AU - Zhang, Lin
PY - 2013/8
Y1 - 2013/8
N2 - The partner selection problem (PSP) in virtual enterprise has been comprehensively investigated from the aspects of research fields, contents, attributes or criteria been considered, and algorithms. With the consideration of environmental protection, the importance of "green criteria" in PSP is introduced, and two new green criteria, i.e., carbon emission and lead content in manufacturing production, are firstly brought into PSP. A formulation of PSP with green criteria is established which includes four objectives and six constraints. A new improved algorithm, named Pareto genetic algorithm for PSP (Pareto-PSGA), is designed for addressing the specific PSP. With Pareto solution ideas, vector encoding, random selection, two-point crossover, and single-point mutation for Pareto solutions are designed in the Pareto-PSGA. Experimental results demonstrate that compared with other typical intelligent algorithms such as simulated annealing and particle swarm optimization, Pareto-PSGA shows high performance in solving the specific PSP with more suitable Pareto solutions in shorter time.
AB - The partner selection problem (PSP) in virtual enterprise has been comprehensively investigated from the aspects of research fields, contents, attributes or criteria been considered, and algorithms. With the consideration of environmental protection, the importance of "green criteria" in PSP is introduced, and two new green criteria, i.e., carbon emission and lead content in manufacturing production, are firstly brought into PSP. A formulation of PSP with green criteria is established which includes four objectives and six constraints. A new improved algorithm, named Pareto genetic algorithm for PSP (Pareto-PSGA), is designed for addressing the specific PSP. With Pareto solution ideas, vector encoding, random selection, two-point crossover, and single-point mutation for Pareto solutions are designed in the Pareto-PSGA. Experimental results demonstrate that compared with other typical intelligent algorithms such as simulated annealing and particle swarm optimization, Pareto-PSGA shows high performance in solving the specific PSP with more suitable Pareto solutions in shorter time.
KW - Genetic algorithm
KW - Pareto solutions
KW - Partner selection
KW - Virtual enterprise
UR - https://www.scopus.com/pages/publications/84891482302
U2 - 10.1007/s00170-012-4634-x
DO - 10.1007/s00170-012-4634-x
M3 - 文章
AN - SCOPUS:84891482302
SN - 0268-3768
VL - 67
SP - 2109
EP - 2125
JO - International Journal of Advanced Manufacturing Technology
JF - International Journal of Advanced Manufacturing Technology
IS - 9-12
ER -