جستجوی مقالات مرتبط با کلیدواژه "meta-heuristic" در نشریات گروه "مواد و متالورژی"

Cloud computing provides computing resources like software and hardware as a service by the network for several users. Task scheduling is one of the main problems to attain cost-effective execution. The main purpose of task scheduling is to allocate tasks to resources so that it can optimize one or more criteria. Since the problem of task scheduling is one of the Nondeterministic Polynomial-time (NP)-hard problems, meta-heuristic algorithms have been widely employed for solving task scheduling problems. One of the new bio-inspired meta-algorithms is Seagull Optimization Algorithm (SOA). In this paper, we proposed an energy-aware and cost-efficient SOA-based Task Scheduling (SOATS) algorithm. The aims of proposed algorithm to make a trade-off between five objectives (i.e., energy consumption, makespan, cost, waiting time, and load balancing) using a fewer number of iterations. The experiment results by comparing with several meta-heuristic algorithms (i.e., Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Whale Optimization Algorithm (WOA)) prove that the proposed technique performs better in solving task scheduling problem. Moreover, we compared the proposed algorithm with well-known scheduling Cost-based Job Scheduling (CJS), Moth Search Algorithm based Differential Evolution (MSDE), and Fuzzy-GA (FUGE). In the heavily loaded environment, the SOATS algorithm improved energy consumption and cost saving by 10 and 25%, respectively.

The resilient supply chain considers many capabilities for companies to overcome financial crises and to supply and distribute products. In this study, we address the allocation of inventory distribution for a distribution network, including a factory, a number of potential locations for distribution centers and a number of retailers. Customers demand is assumed to be certain and deterministic for all periods but time varying in the limited planning horizon. The proposed model in this research is a linear complex integer programming model with two-objective functions. The first objective function minimizes the total costs of the entire distribution system in the planning horizon, and the second objective function seeks to minimize the difference between the maximum and minimum distances traveled by vehicles over the planning horizon. Therefore, the model tries to satisfy the demand and at the same time reduce costs using the best route transportation option configuration and transportation option. The routing problem is developed, and as the problem is a NP-hard problem, a meta-heuristic method is used to solve it. In this model, the demand volume for each customer in a period of the network, vehicle capacity, factory capacity, constant transportation cost, variable transportation cost, etc., are considered as factors affecting the model. The results show that the model proposed in the network can be used as a lever to improve the performance of the financial economic supply network through saving in routes.

Task scheduling is one of the fundamental issues that attract the attention of lots of researchers to enhance cloud performance and consumer satisfaction. Task scheduling is an NP–hard problem that is challenging due to the several conflicting objectives of users and service providers. Therefore, meta-heuristic algorithms are the more preferred option for solving scheduling problems in a reasonable time. Although many task scheduling algorithms are proposed, existing strategies mainly focus on minimizing makespan or energy consumption while ignoring other performance factors. In this paper, we propose a new task scheduling algorithm based on the Discrete Pathfinder Algorithm (DPFA) that is inspired by the collective movement of the animal group and mimics the guidance hierarchy of swarms to find hunt. The proposed scheduler considers five objectives (i.e., makespan, energy consumption, throughput, tardiness, and resource utilization) as cost functions. Finally, different algorithms such as Firefly Algorithm (FA), Particle Swarm Optimization (PSO), Grasshopper Optimization Algorithm (GOA), and Bat Algorithm (BA), are used for comparison. The experimental results indicate that the proposed scheduling algorithm can improve up to 9.16%, 38.44%, 3.59%, and 3.44% the makespan in comparison with FA, BA, PSO, and GOA, respectively. Moreover, the results show dramatic improvements in terms of resource utilization, throughput, and energy consumption.