Correlation-aware resource service composition and optimal-selection in manufacturing grid

被引:150
作者
Tao, Fei [1 ]
Zhao, Dongming [2 ]
Hu Yefa [1 ]
Zhou, Zude [1 ]
机构
[1] Wuhan Univ Technol, Hubei Digital Mfg Key Lab, Sch Mech & Elect Engn, Wuhan 430070, Peoples R China
[2] Univ Michigan, Dept Elect & Comp Engn, Dearborn, MI 48128 USA
关键词
Manufacturing grid (MGrid); Resource service composition; Particle swarm optimization (PSO); Resource service composition model; Resource service composition and optimal-selection; PARTICLE SWARM OPTIMIZATION;
D O I
10.1016/j.ejor.2009.02.025
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
For a multi-resource service request task (MRSRTask) in manufacturing grid (MGrid) system, in addition to the search for all qualified resource services according to each subtask, the system selects one candidate resource service for each subtask. Then the system generates a new composite resource service (CRS) and selects the optimal resource service composite path from all possible paths to execute the task with the given multi-objective (e. g., time minimization, cost minimization and reliability maximization) and multi-constraints. The above problem is defined as multi-objective MGrid resource service composition and optimal-selection (MO-MRSCOS) problem. The formulation is presented for an MO-MRSCOS problem. The correlations among resource services are taken into account during MGrid resource service composition, and a QoS description mode supporting resource service correlation is presented. The basic resource service composite modes (RSCM) for CRS are described, and the principles for translating a complicated RSCM into a simple sequence RSCM are presented for simplifying the resolving process and complexity of MO-MRSCOS problem. A new method based on the principles of particle swarm optimization (PSO), is proposed for solving MO-MRSCOS problem. Unlike previous works: (a) the proposed PSO algorithms combine the non-dominated sorting technique to achieve the selection of global best position and private best position; (b) the parameters of particle updating formulation in PSO are dynamical generated in order to make a compromise between the global exploration and local exploitation abilities of PSO; (c) permutation-based and objective-based population trimming operators are applied in PSO to maintain diversity of solutions in population. The experimental results and performance comparison show that the proposed method is both effective and efficient. (C) 2009 Elsevier B. V. All rights reserved.
引用
收藏
页码:129 / 143
页数:15
相关论文
共 29 条
[1]  
[Anonymous], 2001, THESIS U PRETORIA PR
[2]  
CHI YL, 2007, EXPERT SYSTEMS APPL, V2, P1500
[3]   Handling multiple objectives with particle swarm optimization [J].
Coello, CAC ;
Pulido, GT ;
Lechuga, MS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :256-279
[4]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[5]  
Eberhart R., 1998, PROC 1998 INT C NEUR, P5
[6]  
Fan YS, 2004, LECT NOTES COMPUT SC, V3032, P653
[7]   Semantics-based dynamic service composition [J].
Fujii, K ;
Suda, T .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2005, 23 (12) :2361-2372
[8]   Distributed multimedia service composition with statistical QoS assurances [J].
Gu, XH ;
Nahrstedt, K .
IEEE TRANSACTIONS ON MULTIMEDIA, 2006, 8 (01) :141-151
[9]   Dynamic service composition in pervasive computing [J].
Kalasapur, Swaroop ;
Kumar, Mohan ;
Shirazi, Behrooz A. .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2007, 18 (07) :907-918
[10]  
Kennedy J. F., 2001, Swarm intelligence