Research Article | Open Access | Download PDF
Volume 52 | Number 1 | Year 2017 | Article Id. IJETT-V52P213 | DOI : https://doi.org/10.14445/22315381/IJETT-V52P213
Multi-Objective QoS-based Reusable Service Selection enhanced with Artificial Bee Colony (MQRSABC)
A. Florence Deepa, J.G.R. Sathiaseelan
Citation :
A. Florence Deepa, J.G.R. Sathiaseelan, "Multi-Objective QoS-based Reusable Service Selection enhanced with Artificial Bee Colony (MQRSABC)," International Journal of Engineering Trends and Technology (IJETT), vol. 52, no. 1, pp. 80-85, 2017. Crossref, https://doi.org/10.14445/22315381/IJETT-V52P213
Abstract
Multi-objective optimization has been a difficult problem and a research focus in the field of science and engineering. An enhanced Artificial Bee Colony (ABC) optimization algorithm, called the QoS-Based Reusable Service Selection with Multi-Objective Constraints using Artificial Bee Colony (MQRSABC) Algorithm, is proposed to measure the quality of the search time and execution time better. In this proposal, the fast non-dictated population selection strategy are applied to measure the quality of the solution and select the better ones. An innovative solution generation strategy is designed to exploit the neighbourhood of the existing solutions. Likewise, a novel fitness calculation method is presented to calculate the selecting probability for onlookers. The proposed algorithm is validated on benchmark functions in terms of search time, execution time and reusability constraint with the existing approaches PSO and ACO. The experimental results show that the proposed approach can find solutions with competitive convergence and diversity within a shorter period of time, when compared with the traditional multiobjective algorithms. Subsequently, it can be considered as a feasible alternative to solve the multi-objective optimization problems.
Keywords
Artificial Bee Colony, Particle Swarm Optimization, Ant Colony Optimization, Multi- Objective Constraints, Quality of Service, Reusable Service Selection.
References
[1] Nakamura Kazuto, et al. Value-based dynamic composition and evaluation of Web Services. IPSJ SIG Technical Reports, 2006, 9-16.
[2] Yilmaz, A. Erdinc, and Pinar Karagoz. "Improved genetic algorithm based approach for QoS aware web service composition." Web Services (ICWS), 2014 IEEE International Conference on. IEEE, 2014.
[3] Ding, Zhijun, Youqing Sun, Junjun Liu, Meiqin Pan, and Jiafen Liu. "A genetic algorithm based approach to transactional and QoS-aware service selection." Enterprise Information Systems 11, no. 3 (2017): 339-358.
[4] Zhang, An, et al. "Service composition based on discrete particle swarm optimization in military organization cloud cooperation." Journal of Systems Engineering and Electronics 27.3 (2016): 590-601.
[5] da Silva, Alexandre Sawczuk, et al. "Particle swarm optimisation with sequence-like indirect representation for web service composition." European Conference on Evolutionary Computation in Combinatorial Optimization. Springer, Cham, 2016.
[6] Al-Ani, Aymen Dawood, and Jochen Seitz. "QoS-aware routing in multi-rate ad hoc networks based on ant colony optimization." Network Protocols and Algorithms 7, no. 4 (2016): 1-25.
[7] Karaboga D., Akay B. A comparative study of artificial Bee colony algorithm. Applied Mathematics and Computation. 2009;214(1):108–132. doi: 10.1016/ j.amc.2009.03.090.
[8] Abro A. G. Performance enhancement of artificial bee colony optimization algorithm [Ph.D. thesis] 2013.
[9] Karaboga D., Basturk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization. 2007;39(3):459–471. doi: 10.1007/s10898- 007-9149-x.
[10] Zhu G., Kwong S. Gbest-guided artificial bee colony algorithm for numerical function optimization. Applied Mathematics and Computation. 2010;217(7):3166–3173. doi: 10.1016/j.amc.2010.08.049.
[11] Gao W., Liu S., Huang L. A global best artificial bee colony algorithm for global optimization. Journal of Computational and Applied Mathematics. 2012;236(11):2741–2753. doi: 10.1016 /j.cam.2012.01.013.