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 条
  • [1] Imperialist competitive algorithm with PROCLUS classifier for service time optimization in cloud computing service composition
    Jula, Amin
    Othman, Zalinda
    Sundararajan, Elankovan
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (01) : 135 - 145
  • [2] Imperialist competitive algorithm with PROCLUS classifier for service time optimization in cloud computing service composition
    Data Mining and Optimization Research Group, Centre for Artificial Intelligence, UKM Bangi, 43600 Selangor, Malaysia
    不详
    [J]. Expert Sys Appl, 1 (135-145):
  • [3] An Imperialist Competitive Algorithm for Service Composition and Optimal Selection in Cloud Manufacturing
    Akbaripour, Hossein
    Houshmand, Mahmoud
    Kerdegari, Adeleh
    [J]. 2017 5TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL AND BUSINESS INTELLIGENCE (ISCBI), 2017, : 129 - 133
  • [4] INVESTIGATION OF REVOLUTION OPERATOR IN IMPERIALIST COMPETITIVE ALGORITHM (ICA)
    Soltani-Sarvestani, M. A.
    Badamchizadeh, M. A.
    Soltani-Sarvestani, Sh.
    Javanray, Delaram
    [J]. FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING (ICCEE 2011), 2011, : 255 - +
  • [5] An imperialist competitive algorithm for solving constrained optimization problem
    Lei, De-Ming
    Cao, San-Qiang
    Li, Ming
    [J]. Kongzhi yu Juece/Control and Decision, 2019, 34 (08): : 1663 - 1671
  • [6] A new imperialist competitive algorithm for solving TSP problem
    [J]. Zhang, Xin-Long (mtxinlong@126.com), 1600, Northeast University (31):
  • [7] An imperialist competitive algorithm for virtual machine placement in cloud computing
    Jamali, Shahram
    Malektaji, Sepideh
    Analoui, Morteza
    [J]. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2017, 29 (03) : 575 - 596
  • [8] Solving Economic Load Dispatch Problem by Imperialist Competitive Algorithm
    Ayoub, M. A.
    Henry, H. A.
    Abdelmaksoud, S. M.
    Salama, M. M.
    [J]. 2019 21ST INTERNATIONAL MIDDLE EAST POWER SYSTEMS CONFERENCE (MEPCON 2019), 2019, : 65 - 70
  • [9] Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
    Xu, Shuhui
    Wang, Yong
    Huang, Aiqin
    [J]. ALGORITHMS, 2014, 7 (02): : 229 - 242
  • [10] An Efficient Imperialist Competitive Algorithm for Solving the QFD Decision Problem
    Ji, Xue
    Gao, Qi
    Yin, Fupeng
    Guo, Hengdong
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016