1,886 research outputs found
A WOA-based optimization approach for task scheduling in cloud Computing systems
Task scheduling in cloud computing can directly
affect the resource usage and operational cost of a system. To
improve the efficiency of task executions in a cloud, various
metaheuristic algorithms, as well as their variations, have been
proposed to optimize the scheduling. In this work, for the
first time, we apply the latest metaheuristics WOA (the whale
optimization algorithm) for cloud task scheduling with a multiobjective optimization model, aiming at improving the performance of a cloud system with given computing resources. On that
basis, we propose an advanced approach called IWC (Improved
WOA for Cloud task scheduling) to further improve the optimal
solution search capability of the WOA-based method. We present
the detailed implementation of IWC and our simulation-based
experiments show that the proposed IWC has better convergence
speed and accuracy in searching for the optimal task scheduling
plans, compared to the current metaheuristic algorithms. Moreover, it can also achieve better performance on system resource
utilization, in the presence of both small and large-scale tasks
Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues
Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm
inspired by the convergence mechanism to the center of potential generated
within a single well of a spatially co-located double-delta well setup. It
mimics the wave nature of candidate positions in solution spaces and draws upon
quantum mechanical interpretations much like other quantum-inspired
computational intelligence paradigms. In this work, we introduce a Chebyshev
map driven chaotic perturbation in the optimization phase of the algorithm to
diversify weights placed on contemporary and historical, socially-optimal
agents' solutions. We follow this up with a characterization of solution
quality on a suite of 23 single-objective functions and carry out a comparative
analysis with eight other related nature-inspired approaches. By comparing
solution quality and successful runs over dynamic solution ranges, insights
about the nature of convergence are obtained. A two-tailed t-test establishes
the statistical significance of the solution data whereas Cohen's d and Hedge's
g values provide a measure of effect sizes. We trace the trajectory of the
fittest pseudo-agent over all function evaluations to comment on the dynamics
of the system and prove that the proposed algorithm is theoretically globally
convergent under the assumptions adopted for proofs of other closely-related
random search algorithms.Comment: 27 pages, 4 figures, 19 table
Recommended from our members
A Clustering System for Dynamic Data Streams Based on Metaheuristic Optimisation
open access articleThis article presents the Optimised Stream clustering algorithm (OpStream), a novel approach to cluster dynamic data streams. The proposed system displays desirable features, such as a low number of parameters and good scalability capabilities to both high-dimensional data and numbers of clusters in the dataset, and it is based on a hybrid structure using deterministic clustering methods and stochastic optimisation approaches to optimally centre the clusters. Similar to other state-of-the-art methods available in the literature, it uses “microclusters” and other established techniques, such as density based clustering. Unlike other methods, it makes use of metaheuristic optimisation to maximise performances during the initialisation phase, which precedes the classic online phase. Experimental results show that OpStream outperforms the state-of-the-art methods in several cases, and it is always competitive against other comparison algorithms regardless of the chosen optimisation method. Three variants of OpStream, each coming with a different optimisation algorithm, are presented in this study. A thorough sensitive analysis is performed by using the best variant to point out OpStream’s robustness to noise and resiliency to parameter changes
Renyi’s entropy based multilevel thresholding using a novel meta-heuristics algorithm
Multi-level image thresholding is the most direct and effective method for image segmentation, which is a key step for image analysis and computer vision, however, as the number of threshold values increases, exhaustive search does not work efficiently and effectively and evolutionary algorithms often fall into a local optimal solution. In the paper, a meta-heuristics algorithm based on the breeding mechanism of Chinese hybrid rice is proposed to seek the optimal multi-level thresholds for image segmentation and Renyi’s entropy is utilized as the fitness function. Experiments have been run on four scanning electron microscope images of cement and four standard images, moreover, it is compared with other six classical and novel evolutionary algorithms: genetic algorithm, particle swarm optimization algorithm, differential evolution algorithm, ant lion optimization algorithm, whale optimization algorithm, and salp swarm algorithm. Meanwhile, some indicators, including the average fitness values, standard deviation, peak signal to noise ratio, and structural similarity index are used as evaluation criteria in the experiments. The experimental results show that the proposed method prevails over the other algorithms involved in the paper on most indicators and it can segment cement scanning electron microscope image effectively
A new two-stage algorithm for solving optimization problems
Optimization seeks to find inputs for an objective function that result in a maximum or minimum. Optimization methods are divided into exact and approximate (algorithms). Several optimization algorithms imitate natural phenomena, laws of physics, and behavior of living organisms. Optimization based on algorithms is the challenge that underlies machine learning, from logistic regression to training neural networks for artificial intelligence. In this paper, a new algorithm called two-stage optimization (TSO) is proposed. The TSO algorithm updates population members in two steps at each iteration. For this purpose, a group of good population members is selected and then two members of this group are randomly used to update the position of each of them. This update is based on the first selected good member at the first stage, and on the second selected good member at the second stage. We describe the stages of the TSO algorithm and model them mathematically. Performance of the TSO algorithm is evaluated for twenty-three standard objective functions. In order to compare the optimization results of the TSO algorithm, eight other competing algorithms are considered, including genetic, gravitational search, grey wolf, marine predators, particle swarm, teaching-learning-based, tunicate swarm, and whale approaches. The numerical results show that the new algorithm is superior and more competitive in solving optimization problems when compared with other algorithms
An improved swarm intelligence algorithms-based nonlinear fractional order-PID controller for a trajectory tracking of underwater vehicles
This paper presents a nonlinear fractional order proportional integral derivative (NL-FOPID) for autonomous underwater vehicle (AUV) to solve the path tracking problem under the unknown disturbances (model uncertainty or external disturbances). The considered controller schemes are tuned by two improved swarm intelligence optimization algorithms, the first on is the hybrid grey wolf optimization with simulated annealing (HGWO-SA) algorithm and an improved whale optimization algorithm (IWOA). The developed algorithms are assessed using a set of benchmark function (unimodal, multimodal, and fixed dimension multimodal functions) to guarantee the effectiveness of both proposed swarm algorithms. The HGWO-SA algorithm is used as a tuning method for the AUV system controlled by NL-FOPID scheme, and the IWOA is used as a tuning algorithm to obtain the PID controller’s parameters. The evaluation results show that the HGWO-SA algorithm improved the minimal point of the tested benchmark functions by 1-200 order, while the IWOA improved the minimum point by (1-50) order. Finally, the obtained simulation results from the system operated with NL-FOPID shows the competence in terms of the path tracking by 1-15% as compared to the PID method
- …