Linear Physical Programming-Based Approach for Web Service Selection

Selection of Web service according to different quality of service (QoS) has received much interest to support rapid and dynamic composition of services. Such problem is a multiple attribute decision making (MADM) problem and the most commonly used method is simple additive weight method (SAW). Weight-based approach is simple to use but with some limitations: these weights have no physical meaning and hard to set. Linear physical programming (LPP) is a new effective and computationally approach to overcome such limitations of SAW. In this paper, a LPP based approach for quality driven Web service selection is proposed. Firstly we give two improvements of LPP: determine proper initial value of convexity parameter without iterations and use the simple form of preference function. Then we discuss implementation when apply LPP to Web service selection problem and solve the optimization problem using genetic algorithm. An example is provided to explain how the method works.

[1]  Jana Koehler,et al.  Web Service Composition - Current Solutions and Open Problems , 2003 .

[2]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[3]  Quan Z. Sheng,et al.  Quality driven web services composition , 2003, WWW '03.

[4]  Huaimin Wang,et al.  Quality driven Web services selection , 2005, IEEE International Conference on e-Business Engineering (ICEBE'05).

[5]  Achille Messac,et al.  Physical programming - Effective optimization for computational design , 1996 .

[6]  Schahram Dustdar,et al.  A survey on web services composition , 2005, Int. J. Web Grid Serv..

[7]  Miroslaw Malek,et al.  Current solutions for Web service composition , 2004, IEEE Internet Computing.