4.7 Article

A discrete oppositional multi-verse optimization algorithm for multi-skill resource constrained project scheduling problem

期刊

APPLIED SOFT COMPUTING
卷 85, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2019.105805

关键词

Multi-verse optimization; Multi-skill; Project scheduling

资金

  1. National Natural Science Foundation of China [61973267, 61503331, 71671160]
  2. Zhejiang Provincial Natural Science Foundation of China [LY19F030007, LY19G010004]
  3. Zhejiang Key Laboratory of Solid State Drive and Data Security, PR China [2015E10003]

向作者/读者索取更多资源

In this paper, a discrete oppositional multi-verse optimization (DOMVO) algorithm is proposed to address multi-skill resource constrained project scheduling problem (MS-RCPSP). Firstly, the black/white holes phase in DOMVO algorithm is designed by integrating path relinking technique. Secondly, two improved path relinking methods are presented and embedded into the proposed scheme to enhance search abilities. Thirdly, the opposition-based learning (OBL) method is employed as a hybrid strategy to improve the quality of solutions. Moreover, a repair-based decoding scheme is developed to generate schedules more efficiently. Additionally, the design-of-experiment (DOE) method is carried out to investigate the influence of parameters setting. Finally, the effectiveness of DOMVO is evaluated on the intelligent multi-objective project scheduling environment (iMOPSE) benchmark dataset and the computational comparisons indicate the superiority of the proposed DOMVO over the state-of-the-art algorithms in solving MS-RCPSP. (C) 2019 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据