.png){kind=icon}
返回
Feature assignment in multi-release work plan: Accelerating optimization using gene clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2018.02.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a novel method for solving the previously un-researched problem of multi-release work plan (MRWP). The research also suggests a technique for improving the run-time of metaheuristic search optimizations for this problem. The MRWP is required for many products and R&D projects that are characterized by a long-term planning horizon, spaced by intermediate releases. The intermediate releases enable the organization to keep its liquidity and survive and materialize the value for a given investment. The inclusion of features in a certain release impacts the value of the release, impacts the required workload, and impacts future development of other features. This problem is NP-hard. Thus, practical instances of this problem cannot be solved optimally in polynomial time. In this paper, we apply a clustering algorithm, based on novel similarity coefficients to reduce complexity and accelerate the convergence of a clonal selection search algorithm. Our goal is to provide a near-optimal yet simple method for quantitatively determining the feature content of all project releases. The four versions of the proposed algorithms are tested on a newly-developed set of instances and the results show the advantages of the combination of clustering mutations and random mutations over the pure cluster-based search. To examine the optimality-gap, a sample of benchmark MRWP solutions was generated. These solutions were obtained by a specially developed branch and bound algorithm developed for this study. The comparison of the optimal results to the metaheuristic results, proved that the metaheuristic yields optimal solutions in small problems, and their performance deteriorates slightly as the problem grows.
Keyword:
Combinatorial optimization
Scheduling
CLONALG
Clustering
Release
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏Combining technology roadmap and system dynamics simulation to support scenario-planning: A case of car-sharing service结合技术路线图和系统动力学仿真来支持场景规划: 以汽车共享服务为例
PREAI
分享收藏Metaheuristics for multi-mode capital-constrained project payment scheduling多模式资本约束项目付款计划的元启发式方法
PREAI
分享收藏
查看更多内容