Abstract
Web service location allocation problem is an important problem in the modern IT industry. In this paper, the two major objectives, i.e. deployment cost and network latency, are considered simultaneously. In order to solve this new multi-objective problem effectively, we adopted the framework of binary Particle Swarm Optimization (PSO) due to its efficacy that has been demonstrated in many optimization problems. Specifically, we developed two PSO variants, one with weighted-sum fitness function (WSPSO) and the other with dominance-based fitness function. Concretely, it uses the fast Non-dominate Sorting scheme, and thus is called NSPSO. The experimental results showed that both PSO variants performed better than NSGA-II, which is the one of the most commonly used multi-objective genetic algorithms. Furthermore, we have found that NSPSO achieved a more diverse set of solutions than WSPSO, and thus covers the Pareto front better. This demonstrates the efficacy of using the dominance-based fitness function in solving multi-objective Web service location allocation problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aboolian, R., Sun, Y., Koehler, G.J.: A location allocation problem for a web services provider in a competitive market. Eur. J. Oper. Res. 194(1), 64–77 (2009)
Ballani, H., Costa, P., Karagiannis, T., Rowstron, A.: Towards predictable datacenter networks. In: ACM SIGCOMM (2011)
Coello, C., Pulido, G., Lechuga, M.: Handling multiple objectives with particle swarm optimization. IEEE Trans. Evol. Comput. 8(3), 256–279 (2004)
Coello, C.A.C.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191(11), 1245–1287 (2002)
Coello, C.A.C.: Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput. Intell. Mag. 1(1), 28–36 (2006)
Dan, A., Johnson, R.D., Carrato, T.: Soa service reuse by design. In: Proceedings of the 2nd International Workshop on Systems Development in SOA Environments, pp. 25–28. SDSOA 2008, ACM (2008)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)
Guo, C., Lu, G., Wang, H., Yang, S., Kong, C., Sun, P., Wu, W., Zhang, Y.: Secondnet: a data center network virtualization architecture with bandwidth guarantees. In: ACM CONEXT 2010. Association for Computing Machinery, Inc. (2010)
Huang, H., Ma, H., Zhang, M.: An enhanced genetic algorithm for web service location-allocation. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds.) DEXA 2014, Part II. LNCS, vol. 8645, pp. 223–230. Springer, Heidelberg (2014)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108 (1997)
Kessaci, Y., Melab, N., Talbi, E.G.: A pareto-based genetic algorithm for optimized assignment of vm requests on a cloud brokering environment. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2496–2503 (2013)
Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the pareto archived evolution strategy. Evol. Comput. 8(2), 149–172 (2000)
Larumbe, F., Sanso, B.: Optimal location of data centers and software components in cloud computing network design. In: 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp. 841–844 (2012)
Li, X.: A non-dominated sorting particle swarm optimizer for multiobjective optimization. In: Cantú-Paz, E., et al. (eds.) Genet. Evol. Comput. - GECCO 2003. LNCS, vol. 2723, pp. 37–48. Springer, Heidelberg (2003)
Mei, Y., Tang, K., Yao, X.: Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans. Evol. Comput. 15(2), 151–165 (2011)
Organization for the advancement of structured information standards (OASIS): Web Services Business Process Execution Language (WS-BPEL) Version 2.0 (2007)
Papazoglou, M.P., Heuvel, W.J.: Service oriented architectures: approaches, technologies and research issues. VLDB J. 16(3), 389–415 (2007)
Phan, D.H., Suzuki, J., Carroll, R., Balasubramaniam, S., Donnelly, W., Botvich, D.: Evolutionary multiobjective optimization for green clouds. In: Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 19–26. GECCO 2012, ACM (2012)
Ran, S.: A model for web services discovery with QoS. SIGecom Exch. 4(1), 1–10 (2003)
Sun, Y.: A Location model for web services intermediaries. Ph.D. thesis, aAI3120151 (2003)
Sun, Y., Koehler, G.J.: A location model for a web service intermediary. Decis. Support Syst. 42(1), 221–236 (2006)
Zhang, Y., Zheng, Z., Lyu, M.: Exploring latent features for memory-based QoS prediction in cloud computing. In: 2011 30th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 1–10 (2011)
Zheng, Z., Zhang, Y., Lyu, M.: Distributed QoS evaluation for real-world web services. In: 2010 IEEE International Conference on Web Services (ICWS), pp. 83–90 (2010)
Zhou, J., Niemela, E.: Toward semantic QoS aware web services: issues, related studies and experience. In: IEEE/WIC/ACM International Conference on Web Intelligence. WI 2006, pp. 553–557 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Tan, B., Mei, Y., Ma, H., Zhang, M. (2016). Particle Swarm Optimization for Multi-Objective Web Service Location Allocation. In: Chicano, F., Hu, B., García-Sánchez, P. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2016. Lecture Notes in Computer Science(), vol 9595. Springer, Cham. https://doi.org/10.1007/978-3-319-30698-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-30698-8_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-30697-1
Online ISBN: 978-3-319-30698-8
eBook Packages: Computer ScienceComputer Science (R0)