摘要
集合划分问题是组合优化中典型的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.
出处
《价值工程》
2012年第6期150-150,共1页
Value Engineering
基金
泰州市社会发展计划项目(2011044)
贵州省教育厅科研项目(2010093)
关键词
差异演化算法
集合划分问题
组合优化
differential evolution algorithm
set partitioning problem
combinatorial optimization
