Centre of Software Technology and Management, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, UKM Bangi, 43600 Selangor, Malaysia
Ms. Narjes Khatoon Naseri
Centre of Software Technology and Management, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, UKM Bangi, 43600 Selangor, Malaysia
In this paper, the novel heuristic search algorithm called Smart Root Search (SRS) was examined for solving a set of different-sized service time–cost optimization in cloud computing service composition (STCOCCSC) problems, and its performance was compared with those of the ICACRO-C, ICACRO-I, ICA, and Niching PSO algorithms. STCOCCSC is an np-hard problem due to the large number of unique services available as well as the many service providers who provide services with different quality levels. Finding closer-to-optimal solutions supports cloud clients by providing them with higher quality-lower price services. The SRS obtained results proved that the SRS provided 6.74, 11.2, 47.95, and 87.29 percent performance improvement on average to the comparative algorithms, respectively, for all considered five problems. Furthermore, employing symmetry concepts in dividing the problem search space helps the algorithm to avoid premature convergence and any efficiency reduction while facing higher-dimensional search spaces. Due to these achievements, the SRS is a multi-purpose, flexible, and scalable heuristic search algorithm capable of being utilized in various optimization applications.
In this paper, a novel heuristic search algorithm called Smart Root Search (SRS) is proposed. SRS employs intelligent foraging behavior of immature, mature and hair roots of plants to explore and exploit the problem search space simultaneously. SRS divides the search space into several subspaces. It thereupon utilizes the branching and drought operations to focus on richer areas of promising subspaces while extraneous ones are not thoroughly ignored. To achieve this, the smart reactions of the SRS model are designed to act based on analyzing the heterogeneous conditions of various sections of different search spaces. In order to evaluate the performance of the SRS, it was tested on a set of known unimodal and multimodal test functions. The results were then compared with those obtained using genetic algorithms, particle swarm optimization, differential evolution and imperialist competitive algorithms and then analyzed statistically. The results demonstrated that the SRS outperformed comparative algorithms for 92% and 82% of the investigated unimodal and multimodal test functions, respectively. Therefore, the SRS is a promising nature-inspired optimization algorithm.
20 December 2010 in Journal of Mathematics and Computer Science
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.
In recent years researchers have tried to apply Stochastic Algorithms for solving Optimization problems. Some of these algorithms like Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and Artificial Immune Systems (AIS) are more known because of their significant abilities in finding optimal solutions of the problems comparing to others. Although these algorithms show many advantages in solving optimization problems, they face some drawbacks affect on their performance. Local optima issues and lack of local search capability are two obvious weaknesses that each of the algorithms confronts at least one. To cope these challenges, in this study, plants' root growth intelligences will be inspired in proposing a novel nature-inspired optimization algorithm called Smart Root Search (SRS). The SRS simulates the extracted intelligent behaviors of plant roots in finding nutrition and water in soil. The proposed algorithm will provide embedded exploitation mechanisms besides quick and effective exploring features for escaping of the trap of local optima, and uses problem-space division. Using partitioned problem search space not only enhances ability of the algorithm to avoid of local optima, but makes it a scalable and flexible method in performing balanced search activities. The algorithm will further demonstrate its high-performance search ability in confronting high-dimensional search-space problems.