International Open Access Journal Platform

差异演化算法解决集合划分问题的可行性探讨

The feasibility of differential evolution algorithm to solve the problem of set partition

Applied Mathematics Information / 2020,2(2)：45-49 / 2020-05-22 2217 3712

View Download PDF

• Authors: 华文     
• Information:

  山东大学，济南

• Keywords: 差异演化算法；集合划分问题；组合优化
• differential evolution algorithm; set partitioning problem; combinatorial optimization
• Abstract: 集合划分问题是组合优化中典型的NP难题，建立了集合划分问题模型， 采用差异演化算法对其进行求解。通过对其他文献中仿真实例的计算和结果对 比，表明了算法对求解集合划分问题的可行性和有效性。
• Set partitioning problem is the typical NP problem in combinatorial optimization. The article establishes a set partitioning problem model, and solves it by using differential evolution algorithm. By computing simulation cases in the literature and comparing the result, it indicates that the algorithm for solving set partitioning problem is feasible and effective.
• DOI: https://doi.org/10.35534/ami.0202007c
• Cite: 华文．差异演化算法解决集合划分问题的可行性探讨［J］．应用数学资讯，2020，2（2）：45-49．