Color Revolution: A Novel Operator for Imperialist Competitive Algorithm in Solving Cloud Computing Service Composition Problem

被引:2
|
作者
Jula, Amin [1 ]
Sundararajan, Elankovan A. [2 ]
Othman, Zalinda [1 ]
Naseri, Narjes Khatoon [2 ]
机构
[1] Univ Kebangsaan Malaysia, Ctr Artificial Intelligent CAIT, Fac Informat Sci & Technol, Bangi 43600, Selangor, Malaysia
[2] Univ Kebangsaan Malaysia, Ctr Software Technol & Management, Fac Informat Sci & Technol, Bangi 43600, Selangor, Malaysia
来源
SYMMETRY-BASEL | 2021年 / 13卷 / 02期
关键词
cloud computing; color revolution operator; imperialist competitive algorithm; quality of service; service composition; service time-cost; OPTIMIZATION; PREDICTION; SELECTION;
D O I
10.3390/sym13020177
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
In this paper, a novel high-performance and low-cost operator is proposed for the imperialist competitive algorithm (ICA). The operator, inspired by a sociopolitical movement called the color revolution that has recently arisen in some countries, is referred to as the color revolution operator (CRO). The improved ICA with CRO, denoted as ICACRO, is significantly more efficient than the ICA. On the other hand, cloud computing service composition is a high-dimensional optimization problem that has become more prominent in recent years due to the unprecedented increase in both the number of services in the service pool and the number of service providers. In this study, two different types of ICACRO, one that applies the CRO to all countries of the world (ICACRO-C) and one that applies the CRO solely to imperialist countries (ICACRO-I), were used for service time-cost optimization in cloud computing service composition. The ICACRO was evaluated using a large-scale dataset and five service time-cost optimization problems with different difficulty levels. Compared to the basic ICA and niching PSO, the experimental and statistical tests demonstrate that the ability of the ICACRO to approach an optimal solution is considerably higher and that the ICACRO can be considered an efficient and scalable approach. Furthermore, the ICACRO-C is stronger than the ICACRO-I in terms of the solution quality with respect to execution time. However, the differences are negligible when solving large-scale problems.
引用
收藏
页码:1 / 26
页数:25
相关论文
共 50 条
  • [41] Solving a multi-product distribution planning problem in cross docking networks: An imperialist competitive algorithm
    Javanmard, Shima
    Vahdani, Behnam
    Tavakkoli-Moghaddam, Reza
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 70 (9-12): : 1709 - 1720
  • [42] An Improved Artificial Bee Colony Algorithm for Cloud Computing Service Composition
    Xu, Bin
    Qi, Jin
    Wang, Kun
    Wang, Ye
    [J]. PROCEEDINGS OF THE 11TH EAI INTERNATIONAL CONFERENCE ON HETEROGENEOUS NETWORKING FOR QUALITY, RELIABILITY, SECURITY AND ROBUSTNESS, 2015, : 310 - 317
  • [43] Software-as-a-Service Composition in Cloud Computing Using Genetic Algorithm
    Toh, Samuel Yu
    Tang, Maolin
    [J]. NEURAL INFORMATION PROCESSING (ICONIP 2018), PT II, 2018, 11302 : 542 - 551
  • [44] An evolution strategy based service composition algorithm in cloud computing systems
    Xiao, Peng
    Zhang, Yanping
    [J]. International Review on Computers and Software, 2012, 7 (03) : 996 - 1003
  • [45] Solving cold start problem in tag-based recommender systems using discrete Imperialist Competitive Algorithm
    Jafari, Mohammad Hossein
    Tabrizi, Ghamarnaz Tadayon
    Jalali, Mehrdad
    [J]. 2014 INTERNATIONAL CONGRESS ON TECHNOLOGY, COMMUNICATION AND KNOWLEDGE (ICTCK), 2014,
  • [46] Dynamic Service Scheduling in Cloud Computing Using a Novel Hybrid Algorithm
    Liang, Helan
    Zhang, Yingwu
    Du, Yanhua
    [J]. 2015 IEEE 12TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE), 2015, : 257 - 262
  • [47] A hybrid imperialist competitive algorithm for solving economic lot and delivery scheduling problem in a four-lestage supply chain
    Kia, Hamidreza
    Ghodsypour, Seyed Hassan
    Davoudpour, Hamid
    [J]. ADVANCES IN MECHANICAL ENGINEERING, 2017, 9 (02):
  • [48] Solving the k-Coverage and m-Connected Problem in Wireless Sensor Networks through the Imperialist Competitive Algorithm
    Sheikh, Hemmat
    Barkhoda, Wafa
    [J]. JOURNAL OF INTERCONNECTION NETWORKS, 2020, 20 (01)
  • [49] Solving Dynamic Spectrum Management Problem Based on Cloud Computing Using Genetic Algorithm
    Ping-Liang Chen
    Yu-Cheng Lin
    Shin-Jia Chen
    [J]. Journal of Electronic Science and Technology, 2013, (02) : 132 - 139
  • [50] Solving Dynamic Spectrum Management Problem Based on Cloud Computing Using Genetic Algorithm
    PingLiang Chen
    YuCheng Lin
    ShinJia Chen
    [J]. JournalofElectronicScienceandTechnology., 2013, 11 (02) - 139