首页> 外文期刊>Applied Soft Computing >Cooperative coevolution with an improved resource allocation for large-scale multi-objective software project scheduling
【24h】

Cooperative coevolution with an improved resource allocation for large-scale multi-objective software project scheduling

机译:具有改进的大型多目标软件项目调度的资源分配的合作协作

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The existing literature of search-based software project scheduling merely studied to schedule a small to medium-scale project in static scenarios, while little work has considered to schedule a large-scale software project with uncertainties. However, many real-world software projects involve a large number of tasks and employees. Meanwhile, they are confronted with uncertain environments. To tackle such problems, this paper constructs a mathematical model for the large-scale multi-objective software project scheduling problem, and proposes a cooperative coevolutionary multi-objective genetic algorithm to solve the established model. In our model, more practical features of human resources and tasks are captured in the context of large-scale projects than the previous studies. Two efficiency related objectives of duration and cost are considered together with robustness to uncertainties and employees' satisfaction to allocations subject to various realistic constraints. Three novel strategies are incorporated in the proposed algorithm, which include the problem feature-based variable decomposition method, the improved computational resource allocation mechanism and the problem-specific subcomponent optimizer. To evaluate the performance of the proposed algorithm, empirical experiments have been performed on 15 randomly generated large-scale software project scheduling instances with up to 2048 decision variables, and three instances derived from real-world software projects. Experimental results indicate that on most of the 15 random instances and three real-world instances, the proposed algorithm achieves significantly better convergence performance than several state-of-the-art evolutionary algorithms, while maintaining a set of well-distributed solutions. Thus, it can be concluded that the proposed algorithm has a promising scalability to decision variables on software project scheduling problems. We also demonstrate how different compromises among the four objectives can offer software managers a deeper insight into various trade-offs among many objectives, and enabling them to make an informed decision. (C) 2020 Elsevier B.V. All rights reserved.
机译:现有的基于搜索的软件项目调度文献仅限于静态方案中将一个小于中型项目安排,而几乎没有考虑使用不确定性的大规模软件项目。但是,许多现实世界的软件项目涉及大量的任务和员工。同时,他们面临着不确定的环境。为了解决这些问题,本文构建了大规模的多目标软件项目调度问题的数学模型,并提出了一种解决建立模型的协同共同走动多目标遗传算法。在我们的模型中,在大规模项目的背景下捕获了人力资源和任务的更实际的特征,而不是之前的研究。两个效率相关的持续时间和成本目标被认为是与不确定因素的稳健性和员工的满意,以遭受各种现实限制的分配。在所提出的算法中纳入了三种新颖策略,包括基于问题的可变分解方法,改进的计算资源分配机制和特定于问题的子组件优化器。为了评估所提出的算法的性能,对具有高达2048个决策变量的15个随机生成的大型软件项目调度实例进行了实证实验,以及从真实世界的软件项目中派生的三个实例。实验结果表明,在15个随机实例和三个实际情况下,所提出的算法比若干最先进的进化算法实现了明显更好的收敛性能,同时保持了一组良好的分布式解决方案。因此,可以得出结论,所提出的算法对软件项目调度问题的决策变量具有有希望的可扩展性。我们还展示了四个目标之间的不同妥协可以提供软件管理人员在许多目标中深入了解各种权衡,并使他们能够做出明智的决定。 (c)2020 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号