earticle

논문검색

Simulated Annealing Versus Genetic Based Service Selection Algorithms

초록

영어

In service oriented architecture, services are the basic assemble that aims to assist the building of business application in a more flexible and interoperable manner for enterprise collaboration. To satisfy the needs of service clients and to adapt to changing needs, service composition is performed to compose the various capabilities of available services. With the proliferation of services presenting similar functionalities around the web, the task of service selection for service composition is intricate. It is vital to provide systematic methodology for selecting required web services according to their non-functional characteristics or reliability. In this paper, the simulated annealing algorithm is developed to maximize the non-functional Characteristic reliability of the composite web service and the genetic algorithm is developed and theses two algorithms are compared based on the time complexity and optimality of results.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Service Selection Based on Service Reliability
 4. Service Selection Based on Genetic Algorithm
  4.1 Encoding of the Chromosomes
  4.2 Fitness Function
  4.3 Group Selection
  4.4 Crossover
  4.5 Mutation
  4.6 Elitism
  4.6 Pseudo Code
  4.7 Computational Complexity
 5. Service Selection Based on Simulated Annealing
  5.1 Initial Solution
  5.2 Exploring Neighbor Solutions
  5.3 Acceptance Probability
  5.4 Pseudo Code
  5.5 Computational Complexity
 6. Experimental Result
 7. Performance Comparison
 8. Conclusion
 Acknowledgement
 References

저자정보

  • L. Arockiam Department of Computer Science, St.Joseph’s College, TN, India
  • N. Sasikaladevi Department of Computer Science, St.Joseph’s College, TN, India

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.