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

WIRELESS SENSOR NETWORKS CONGESTION AND ROLE OF ARTIFICIAL INTELLIGENCE

The occurrence of the congestion has an extremely deleterious impact on the performance of Wireless Sensor Network (WSNs). Some novel blockage control method utilizing computerized reasoning for remote sensor systems....

A COMPARATIVE STUDY ON GOOGLE APP ENGINE AMAZON WEB SERVICES AND MICROSOFT WINDOWS AZURE

In today Internet has grown to be persistent in daily livelihood furthermore Cloud computing is a rising model where computing resources offered over the Internet as scalable, on-demand (Web) services. An association d...

MACHINE AS ONE PLAYER IN INDIAN COWRY BOARD GAME: BASIC PLAYING STRATEGIES

Cowry game is an ancient board game from India, also known as Chowka Bhara. It is a race game of chance and strategy for 2-4 players, in which playing pieces are moved around a square board according to the throw of sp...

A STUDY ON REGULARIZATION FUNCTIONS AND REGULATION PARAMETERS IN IMAGE RESTORATION

The aim of this paper is to apply the regularization functions namely TV norm, l1 norm and l0 norm and regularization parameters with these norms in image restoration. This class of problems results from combining a li...

RELIEFF FEATURE SELECTION BASED ALZHEIMER DISEASE CLASSIFICATION USING HYBRID FEATURES AND SUPPORT VECTOR MACHINE IN MAGNETIC RESONANCE IMAGING

Alzheimer disease is a form of dementia that results in memory-related problems in human beings. An accurate detection and classification of Alzheimer disease and its stages plays a crucial role in human health monitor...

Download PDF file
  • EP ID EP46525
  • DOI 10.34218/IJCET.10.1.2019.024
  • Views 211
  • 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