In this paper, we first propose a multi-objective task-scheduling optimization problem that minimizes both the makespans and total costs in a fog-cloud environment. Then, we suggest an optimization model based on a Discrete Non-dominated Sorting Genetic Algorithm II (DNSGA-II) to deal with the discrete multi-objective task-scheduling problem and to automatically allocate tasks that should be executed either on fog or cloud nodes. The NSGA-II algorithm is adapted to discretize crossover and mutation evolutionary operators, rather than using continuous operators that require high computational resources and not able to allocate proper computing nodes. In our model, the communications between the fog and cloud tiers are formulated as a multi-objective function to optimize the execution of tasks. The proposed model allocates computing resources that would effectively run on either the fog or cloud nodes. Moreover, it efficiently organizes the distribution of workloads through various computing resources at the fog. Several experiments are conducted to determine the performance of the proposed model compared with a continuous NSGA-II (CNSGA-II) algorithm and four peer mechanisms. The outcomes demonstrate that the model is capable of achieving dynamic task scheduling with minimizing the total execution times (i.e. makespans) and costs in fog-cloud environments
We introduce a generalized form of the Hankel transform, and study some of its properties. A partial differential equation associated with the problem of transport of a heavy pollutant (dust) from the ground level sources within the framework of the diffusion theory is treated by this integral transform. The pollutant concentration is expressed in terms of a given flux of dust from the ground surface to the atmosphere. Some special cases are derived.
The traditional differential evolution algorithm was originally, and still is mainly, used to solve continuous optimization problems. As a result, it has not commonly been considered as applicable for several real-world problems in the permutation-based domain. In this paper, a novel differential evolution algorithm, which incorporates several effective components, is introduced. These components increase search effectiveness by providing a good balance between exploration (discovering new solutions) and exploitation (further exploring current solutions) processes. Moreover, a dual representation of solutions, which has the capability to allow normal continuous handling of variables by differential evolution operators, and at same time provide binary variables for fitness measurement, is employed. To judge the performance of the proposed algorithm, 14 instances of 0-1 knapsack problems have been solved and the results have been compared with those obtained from 11 state-of-the-art algorithms. Results show that the proposed algorithm was able to outperform other algorithms in solving small and medium sized knapsack problems and is competitive in large-sized problems.
8 October 2022 in Expert Systems with Applications