arrow
返回

A novel multi-objective bacteria foraging optimization algorithm(MOBFOA) for multi-objective scheduling

delete2018-05-01
delete58
PRE
AI
M
Mandeep Kaur
S
Sanjay Kadam *
DOI:10.1016/j.asoc.2018.02.011delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In grid and cloud computing environment, many users compete for the resources, so the schedule should be generated in the shortest possible time. To address this problem, there have been several research initiatives to use evolutionary and swarm based algorithms to find near-optimal scheduling solutions. The state-of-the-art evolutionary algorithms for handling single/multi-criteria scheduling of m jobs on n resources are still evolving, with efforts aimed at reducing their space/time complexity, maintaining diversity in the population and directing the search towards the true Pareto-optimal solutions. In this paper, we have proposed a multi-objective bacteria foraging optimization algorithm (MOBFOA) to address these objectives. We have attempted to modify the original BFOA to handle the multi-objective scheduling problems using Pareto-optimal front approach. The modification is in terms of selecting bacteria positions from both the dominant as well as non-dominant fronts to obtain diversity in the solutions obtained. The accuracy and speed of the convergence of the BFOA has been improved by introducing adaptive step size in chemotactic step. The proposed MOBFOA uses new fitness assignment method and bacteria selection procedure for simultaneous optimization of multiple objectives, where each solution evaluation is computationally expensive. This paper focuses on the scheduling of independent jobs considering multi-objective trade-offs among the objective functions desired by the users in grid/cloud environment. The performance of the proposed MOBFOA is discussed in terms of convergence towards the Pareto-optimal front and distribution of solutions in the search space. The paper also provides a comparative study of the results obtained by the proposed MOBFOA with other stochastic optimization algorithms, namely, the non-dominated sorting genetic algorithm-II (NSGA-II) and optimised multi-objective particle swarm optimization (OMOPSO). (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
BFOA
Scheduling
Cloud computing
Multi-objective
Makespan
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

C
centre for development of advanced computing
学者数:
276
论文数: 176
被引数: 0
S
Savitribai Phule Pune University
学者数:
4.4K
论文数: 2.9K
被引数: 4.4K
引用论文

引用论文

Quantitative T2 Measurements in Juvenile and Late Infantile Neuronal Ceroid Lipofuscinosis
err2012-12-23
err0
PREAI
errAlvaro Paniagua Bravo; N. D. Forkert; A. Schulz; U. Löbel; J. Fiehler; X. Ding; J. Sedlacik; M. Rosenkranz; E. Goebell
err分享
err收藏
err分享
err收藏
Determination of Pareto frontier in multi-objective maintenance optimization
err2011-07-01
err43
PREAI
errCerta, Antonella; Galante, Giacomo; Lupo, Toni; Passannanti, Gianfranco
err分享
err收藏
学者 查看更多内容