A comprehensive survey on cultural algorithms

Peer reviewedPostprin

Classification and Performance Study of Task Scheduling Algorithms in Cloud Computing Environment

Cloud computing is becoming very common in recent years and is growing rapidly due to its attractive benefits and features such as resource pooling, accessibility, availability, scalability, reliability, cost saving, security, flexibility, on-demand services, pay-per-use services, use from anywhere, quality of service, resilience, etc. With this rapid growth of cloud computing, there may exist too many users that require services or need to execute their tasks simultaneously by resources provided by service providers. To get these services with the best performance, and minimum cost, response time, makespan, effective use of resources, etc. an intelligent and efficient task scheduling technique is required and considered as one of the main and essential issues in the cloud computing environment. It is necessary for allocating tasks to the proper cloud resources and optimizing the overall system performance. To this end, researchers put huge efforts to develop several classes of scheduling algorithms to be suitable for the various computing environments and to satisfy the needs of the various types of individuals and organizations. This research article provides a classification of proposed scheduling strategies and developed algorithms in cloud computing environment along with the evaluation of their performance. A comparison of the performance of these algorithms with existing ones is also given. Additionally, the future research work in the reviewed articles (if available) is also pointed out. This research work includes a review of 88 task scheduling algorithms in cloud computing environment distributed over the seven scheduling classes suggested in this study. Each article deals with a novel scheduling technique and the performance improvement it introduces compared with previously existing task scheduling algorithms. Keywords: Cloud computing, Task scheduling, Load balancing, Makespan, Energy-aware, Turnaround time, Response time, Cost of task, QoS, Multi-objective. DOI: 10.7176/IKM/12-5-03 Publication date:September 30th 2022

Short term complex hydro thermal scheduling using integrated PSO-IBF algorithm

In this article, an integrated evolutionary technique such as particle swarm optimization (PSO) algorithm and improved bacterial foraging algorithm (IBFA) have been developed to provide an optimum solution to the scheduling problem with complex thermal and hydro generating stations. PSO algorithm is framed based on the intelligent behavior of the fish school and a flock of birds and the optimal solution in the multidimensional search region is achieved by assigning a random velocity to each potential solution (called the particle). BFA is designed by following the prey-seeking (chemotactic) nature of E. coli bacteria. This technique is followed in an improved manner to get the convergence rate in dynamic for a hyperspace problem by implementing a chemotactic step in a linearly decreased way instead of the static one. The effectiveness of this integrated algorithm is evaluated by using it in a complex thermal and hydro generating system. In this testing system, multiple numbers of cascaded reservoirs in hydro plants have a time coupling effect and thermal power units have a valve point loading effect. The simulation results indicate its merits by comparing it with other meta-heuristic techniques related to the fuel cost required to generate the thermal power.

Opposition-Based Barebones Particle Swarm for Constrained Nonlinear Optimization Problems

This paper presents a modified barebones particle swarm optimization (OBPSO) to solve constrained nonlinear optimization problems. The proposed approach OBPSO combines barebones particle swarm optimization (BPSO) and opposition-based learning (OBL) to improve the quality of solutions. A novel boundary search strategy is used to approach the boundary between the feasible and infeasible search region. Moreover, an adaptive penalty method is employed to handle constraints. To verify the performance of OBPSO, a set of well-known constrained benchmark functions is used in the experiments. Simulation results show that our approach achieves a promising performance

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field