Virtual Machine Consolidation using Roulette wheel selection Strategy

Cloud computing data centers are growing rapidly in both number and capacity to meet the increasing demands for highly-responsive computing and massive storage. Such data centers consume enormous amounts of electrical energy resulting in high operating costs and carbon dioxide emissions. The reason for this extremely high energy consumption is not just the quantity of computing resources and the power inefficiency of hardware, but rather lies in the inefficient usage of these resources. Virtual Machine [VM] consolidation involves live migration of VMs hence the capability of transferring a VM between physical servers with a close to zero down time. It is an effective way to improve the utilization of resources and increase energy efficiency in cloud data centers. VM consolidation consists of host overload/under load detection, VM selection and VM placement. In Our Proposed Model We are going to use Roulette-Wheel Selection Strategy, Where the VM selects the Instance type and Physical Machine [PM] using Roulette-Wheel Selection Mechanism Keywords—searchable encryption, dynamic update, cloud computing

Enhanced Symbiotic Organisms Search and Hydrological Cycle Algorithms for Real Power Loss Diminution and Voltage Stability Enhancement

In this chapter, enhanced symbiotic organisms search (ESOS) algorithm and hydrological cycle (HC) algorithm are projected to solve factual power loss lessening problem. Symbiotic search algorithm is based on the actions between two different organisms in the ecosystem: mutualism, commensalism, and parasitism. Exploration procedure has been initiated arbitrarily, and each organism indicates a solution with fitness value. Quasi-oppositional-based learning and chaotic local search have been applied to augment the performance of the algorithm. In this work, hydrological cycle (HC) algorithm has been utilized to solve the optimal reactive power problem. It imitates the circulation of water form land to sky and vice versa. Only definite number of water droplets is chosen for evaporation, and it is done through roulette-wheel selection method. In the condensation stage, water drops move closer, combine, and also collusion occurs as the temperature decreases.

An Effective Coordination Setting for Directional Overcurrent Relays Using Modified Harris Hawk Optimization

The relay optimization expresses quite a challenge for smooth and optimal operation of power system networks. The relay optimization is formulated as a mixed integer non-linear problem and is highly constrained. Furthermore, a reliable relaying system must be able to detect and isolate the faulted portion in a timely manner. Therefore, it is necessary to find optimal parameters for relay settings to be able to respond in a timely way to the encountered fault and at the same time keep in consideration the operational and coordination constraints. This paper proposes modified Harris hawk optimization (MHHO), which is based on the intelligent preying tactics of Harris hawks and the improvement of intended modifications, crowding distance and roulette wheel selection. The proposed algorithm has been tested on IEEE 8 and 15-bus systems, using MATLAB programming. The test systems are the distribution networks covering the medium level voltage for consideration. The simulation results verified the success of MHHO to find optimal settings for the relays. For IEEE 8-bus system, MHHO was able to give 35.45% improvement in the results in comparison to other algorithms. Furthermore, for the IEEE 15-bus system, MHHO showed 24.09% improvement on average. The comparison of the results obtained by MHHO with the other state-of-the-art algorithms proved that it is the strong candidate for optimization of the relay coordination problem.

A Method of Product Selection Based on Online Reviews

With the rapid development of information technology and market economy, global e-commerce platform develops rapidly. Recently, online reviews are widely available on e-commerce platforms to express customers’ experience of products. When ranking alternative products based on online reviews, how to make full use of the information in online reviews to represent the sentiment analysis results of online reviews is an important prerequisite for decision analysis. To this end, we propose a method for measuring the time utility and support utility of online reviews. Then a method for representing the sentiment analysis results of online reviews in the form of linguistic distribution is proposed. In addition, in view of the attributes and their weights being unknown, we propose a method for extracting product attributes from online reviews by using the Term Frequency-Inverse Document Frequency (TF-IDF) algorithm; and the objective weights of attributes are determined through the Criteria Importance through Intercriteria Correlation (CRITIC) method. Additionally, in order to highlight the differences between the alternatives, the roulette wheel selection algorithm is first used to randomly select product attributes. Then the alternative products can be ranked by the extended Multi-Attributive Border Approximation area Comparison (MABAC) method with mixed information. Finally, we illustrate the applicability of the proposed method through a case study of selecting a 5G mobile phone and simulation experiment.

Self-adaptively Commensal Learning-based Jaya Algorithm with Multi-populations and its Application

Jaya algorithm is an advanced optimization algorithm, which has been applied to many real-world optimization problems. Jaya algorithm has better performance in some optimization field. However, Jaya algorithm exploration capability is not better. In order to enhance exploration capability of the Jaya algorithm, a self-adaptively commensal learning-based Jaya algorithm with multi-populations (Jaya-SCLMP) is presented in this paper. In Jaya-SCLMP, a commensal learning strategy is used to increase the probability of finding the global optimum, in which the person history best and worst information is used to explore new solution area. Moreover, a multi-populations strategy based on Gaussian distribution scheme and learning dictionary is utilized to enhance the exploration capability, meanwhile every sub-population employed three Gaussian distributions at each generation, roulette wheel selection is employed to choose a scheme based on learning dictionary. The performance of Jaya-SCLMP is evaluated based on 28 CEC 2013 unconstrained benchmark problems. In addition, three reliability problems, i.e. complex (bridge) system, series system and series-parallel system are selected. Compared with several Jaya variants and several state-of-the-art other algorithms, the experimental results reveal that Jaya-SCLMP is effective.

Design and Development of a Genetic Algorithm Based on Fuzzy Inference Systems for Personnel Assignment Problem

<p class="Abstract">In today’s competitive markets, the role of human resources as a sustainable competitive advantage is undeniable. Reliable hiring decisions for personnel assignation contribute greatly to a firms’ success. The Personnel Assignment Problem (PAP) relies on assigning the right people to the right positions. The solution to the PAP provided in this paper includes the introducing and testing of an algorithm based on a combination of a Fuzzy Inference System (FIS) and a Genetic Algorithm (GA). The evaluation of candidates is based on subjective knowledge and is influenced by uncertainty. A FIS is applied to model experts’ qualitative knowledge and reasoning. Also, a GA is applied for assigning assessed candidates to job vacancies based on their competency and the significance of each position. The proposed algorithm is applied in an Iranian company in the chocolate industry. Thirty-five candidates were evaluated and assigned to three different positions. The results were assessed by ten staff managers and the algorithm results proved to be satisfactory in discovering desirable solutions. Also, two GA selection techniques (tournament selection and proportional roulette wheel selection) were used and compared. Results show that tournament selection has better performance than proportional roulette wheel selection.</p>

A Rule Based Classification for Vegetable Production Using Rough Set and Genetic Algorithm

This article describes how agriculture is the main occupation of India, and how the economy depends on agricultural production. Most of the land in India is dedicated to agriculture and people depend on the production of agricultural products. Therefore, forecasting the accuracy of future events based on extracted patterns plays a vital role in improving agricultural productivity. By considering the availability of micronutrients and macronutrients of the soil and water in a particular place, the growth of a plant is determined. This helps people to determine the crops to be cultivated at a certain place. In this article, the forecasting is carried out using rough sets and genetic algorithms. Rough sets are used to produce the decision rules whereas genetic algorithms are used to refine the rules and improve classification accuracy. Accuracy of the classification rules is analyzed using different selection methods and crossover operators. Results show that genetic algorithms with a roulette wheel selection and single point crossover provides better performance when compared with other existing techniques.

A Fuzzy Enabled Genetic Algorithm for Task Scheduling Problem in Cloud Computing

Background & Objective: Cloud computing emerges out as a new way of computing which enables the users to fulfill their computation need using the underlying computing resources like software, memory, computing nodes or machines without owning them purely on the basis of pay-per-use that too round the clock and from anywhere. People defined this as the extension of the existing technologies like parallel computing, distributed computing or grid computing. Lots of research have been conducted in the field of cloud computing but the task scheduling is considered to be the most fundamental problem which is still in infancy and requires a lot of attention and a proper mechanism for the optimal utilization of the underlying computing resources. Task scheduling in cloud computing environment lies into the category of NP-hard problem and many heuristics and Meta heuristics strategies have been applied to solve the problem. Methods: In this work, Fuzzy Enabled Genetic Algorithm (FEGA) is proposed to solve the problem of task scheduling in cloud computing environment as classical roulette wheel selection method has certain limitations to solve complex optimization problem. Results & Discussion: In this work, an efficient fuzzy enabled genetic algorithm based task scheduling mechanism has been designed, implemented and investigated. The efficiency of the proposed FEGA algorithm is tested using various randomly generated data sets in different situations and compared with the other meta-heuristics. Conclusion: The authors suggest that the proposed Fuzzy Enabled Genetic Algorithm (FEGA) to solve the task scheduling problem helps in minimizing the total execution time or makespan and on comparing with other Meta-heuristic like genetic algorithm and greedy based strategy found that FEGA outperforms the both in different set of experiments.