کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
382589 660772 2013 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A decision-making method for personalized composite service
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
A decision-making method for personalized composite service
چکیده انگلیسی


• Oriented to service selection with personalized need, a decision-making method is presented.
• For the user need with single objective, an algorithm is designed based on PSO and NT.
• For the user need with MOMC, a method is proposed based on NPSO and the optimization theory of PSO.
• Experimental results show that the proposed decision-making method owns better performance.

Web services are emerging technologies that enable application to application communication and reuse of autonomous services. Web services composition is a concept of integrating component services to conduct complex business transactions based on functionality and performance constraints. With the rapid growth of Web services on the Internet, the services owing the same functionality and different performance become more and more, and different users care for different quality. Therefore, designing effective decision-making method for the personalized composite service has become a fundamental problem for the application based on Web service. In this paper, oriented to the user need with single optimization objective, an efficient algorithm, which consists of Particle Swarm Optimization (PSO) and Niche technology, is presented to solve the Web service selection problem. Furthermore, in view of the practical composition requirements including multiple optimization objectives, an algorithm used to resolve the service selection with multi-objective multi-constraint is designed based on NPSO and the intelligent optimization theory of multi-objective PSO, which can produce a set of Pareto optimal composite services by means of optimizing various objective functions simultaneously. Experimental results show that NPSO algorithm owns better global convergence ability with faster convergence speed. Meanwhile, multi-objective multi-constraint NPSO is both feasible and efficient.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 40, Issue 15, 1 November 2013, Pages 5804–5810
نویسندگان
,