Web Services Composition based on Domain Ontology and Discrete Particle Swarm Optimization

  • Zhenwu Wang
  • Ming Chen
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 252)


This paper proposes an approach for web services composition based on domain ontology and discrete particle swarm optimization (DPSO) algorithm. This method builds an optimized graph for service composition based on domain ontology and its reasoning capability, and then a discrete particle swarm optimization algorithm based on the graph is proposed to accomplish service composition. The simulation results show that it can produce good results, especially when the amount of web services is large.


Particle Swarm Optimization Particle Swarm Optimization Algorithm Service Composition Domain Ontology Composite Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    M. Li, D.Z. Wang, X.Y. Du, and S. Wang, “Dynamic Composition of Web Services based on Domain Ontology”, Chinese Journal of Computers, 28(4),645–650 (2005).Google Scholar
  2. 2.
    J. Wu, Z. h. Wu, Y. Li and S.G. Deng, “Web Service Discovery and Similarity of Words”, Chinese Journal of Computers, 28(4), 596–602 (2005).Google Scholar
  3. 3.
    J.F. Zhao, B. Xie, L. Zhang, F.q. Yang, “A Web Services Supporting DomainFeature”, Chinese Journal of Computers, 28(4),732–738 (2005).Google Scholar
  4. 4.
    Y.W. Zhong, J.g. Yang and Z.Y. Ning, “Discrete particle swarm optimization algorithm for TSP problem”, System Engineering —Theory & Practice,6,89–93 (2006).Google Scholar
  5. 5.
    M. Clerc, “Discrete particle swarm optimization”, Onwubolu GC, Babu BV, New Optimization Techniques in Engineering, SpringerVerlag (2004).Google Scholar
  6. 6.
    D.R. Pan, “QoS Multicast Routing Optimization Algorithm Based on SCE Algorithm and Particle Swarm Optimization Algorithms”, Computer and Information Technology, 14–18,(2006).Google Scholar
  7. 7.
    J. Qing, W.b. Xu and J. Sun, “QoS Multicast Routing Optimization Algorithm Based on Particle Swarm Optimization Algorithms”, Computer Engineering and Applications, 27(1),106–108 (2006).Google Scholar
  8. 8.
    S. Gao, B. Han, X.J. Wu, and J.Y. Yang, “Solving traveling salesman problem by hybrid particle swarm optimization algorithm”, Control and Decision,, 19(11), 1287–1289 (2004).MathSciNetMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2007

Authors and Affiliations

  • Zhenwu Wang
    • 1
  • Ming Chen
    • 1
  1. 1.Department of Computer Science and TechnologyChina University of PetroleumBeijingChina

Personalised recommendations