AN OPTIMAL COMPOSITION PLAN SELECTION USING MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION

Abstract

Domain-ontology based Particle Swarm Optimization (PSO)-inspired Balanced Iterative Reducing and Clustering using Hierarchies (BIRCH) and Improved Bipartite graph is an efficient web service composition approach. It composed a number of web services to achieve high customer satisfaction. It also improves the clustering quality and reduced the processing time of web service composition. The most verification problems are easily verified by using Petri Net in planning, verification and execution phase. In order to provide more efficient automatic web service composition, in this paper multiple Quality of Service (QoS) parameters like cost, accuracy, accessibility, robustness, scalability, modifiability and security are included in Petri net-based algebra approach. While adding a greater number of QoS parameters there will be multi-objective services composition optimization problem. It is solved by introducing a Multi-Objective Genetic Algorithm (MOGA) and Multi-Objective PSO (MOPSO) algorithm. It selects qualitative different services from multiple functionally identical web services which achieve the best reliability model. Thus, the automatic web service composition is performed for discovering the appropriate services by satisfying the customer requirements. Experimental results show that the proposed method performs better than the existing method.

Authors and Affiliations

PARIMALAM. T AND MEENAKSHI SUNDARAM. K,

Keywords

Related Articles

COMPARISON OF FEATURE EXTRACTION TECHNIQUES FOR EEG BASED RAIN-COMPUTER INTERFACE

The analysis of electroencephalogram(EEG) signals, for implementation of brain-computer interface (BCI), has enticed a lot of interest in the research community. It can be used in a variety of applications ranging from...

ANALYSIS OF SOCIAL MEDIA TEXTUAL CONTENT USING ACCIDENT DATA SETS FOR CONTEXT RECOGNITION BY GENETIC ALGORITHM

There is huge amount of data which is being processed daily. According to statistic world’s population is 7 billion and 6 billion people has smart phones. So, having smart phones there are various application which con...

IMPROVED PRE-COPY APPROACH FOR A SECURITY BASED LIVE VIRTUAL MACHINE MIGRATION IN CLOUD COMPUTING

In current time Cloud Computing is the most recent pattern where IT applications and foundations are provided as 'administrations' under a use based installment model to its end-clients. Normally two issues happen amid...

APP FOR PLACING ORDERS AND BARGAINING WITH AI AT A RESTAURANT

The proposed system attempts to implement various new technologies to an app for enabling users to place orders and bargain the prices with a machine learning powered bot. Such a system can provide new experience to th...

MULTI-LEVEL ENERGY EFFICIENT IMPROVED UNEQUAL CLUSTERING IN WIRELESS SENSOR NETWORKS

In wireless sensor networks (WSNs), the node distribution in the unequal clustering is rapidly used for distributing the load and increase the network lifetime. In tradition unequal clustering mechanism, the nodes whic...

Download PDF file
  • EP ID EP46525
  • DOI 10.34218/IJCET.10.1.2019.024
  • Views 202
  • Downloads 0

How To Cite

PARIMALAM. T AND MEENAKSHI SUNDARAM. K, (2019). AN OPTIMAL COMPOSITION PLAN SELECTION USING MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION. International Journal of Computer Engineering & Technology (IJCET), 10(1), -. https://europub.co.uk/articles/-A-46525