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 条
  • [21] Service composition and optimal selection in cloud manufacturing: landscape analysis and optimization by a hybrid imperialist competitive and local search algorithm
    Akbaripour, Hossein
    Houshmand, Mahmoud
    NEURAL COMPUTING & APPLICATIONS, 2020, 32 (15) : 10873 - 10894
  • [22] Service composition and optimal selection in cloud manufacturing: landscape analysis and optimization by a hybrid imperialist competitive and local search algorithm
    Hossein Akbaripour
    Mahmoud Houshmand
    Neural Computing and Applications, 2020, 32 : 10873 - 10894
  • [23] Solving the n-Queens Problem Using a Tuned Hybrid Imperialist Competitive Algorithm
    Masehian, Ellips
    Akbaripour, Hossein
    Mohabbati-Kalejahi, Nasrin
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2014, 11 (06) : 550 - 559
  • [24] Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm
    Nazari-Shirkouhi, S.
    Eivazy, H.
    Ghodsi, R.
    Rezaie, K.
    Atashpaz-Gargari, E.
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (12) : 7615 - 7626
  • [25] Solving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
    Azizmohammadi, R.
    Amiri, M.
    Tavakkoli-Moghaddam, R.
    Mohammadi, M.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2013, 26 (09): : 1031 - 1042
  • [26] Solving the fuzzy p-hub center problem using imperialist competitive algorithm
    Abbasi, Mehdi
    Sadough, Fatemeh
    Mahmoudi, Amin
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2024, 15 (12) : 6163 - 6183
  • [27] Modified Moth-Flame Optimization Algorithm for Service Composition in Cloud Computing Environments
    Yang, Yeling
    Song, Miao
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2025, 16 (01) : 913 - 922
  • [28] An Evolutionary Multitasking Algorithm for Cloud Computing Service Composition
    Bao, Liang
    Qi, Yutao
    Shen, Mengqing
    Bu, Xiaoxuan
    Yu, Jusheng
    Li, Qian
    Chen, Ping
    SERVICES - SERVICES 2018, 2018, 10975 : 130 - 144
  • [29] Software-as-a-Service Composition in Cloud Computing Using Genetic Algorithm
    Toh, Samuel Yu
    Tang, Maolin
    NEURAL INFORMATION PROCESSING (ICONIP 2018), PT II, 2018, 11302 : 542 - 551
  • [30] Nature inspired meta-heuristic algorithms for solving the service composition problem in the cloud environments
    Asghari, Saied
    Navimipour, Nima Jafari
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2018, 31 (12)