摘要
通过对2016年全国大学生数学建模竞赛D题的分析,建立了风电场值班安排的多目标0-1规划模型和贪婪算法模型,并对两种模型作简单的比较,为以后同类问题提供解决的思路和方法,并指出了各方法的适用范围。
Through the analysis of the question D of the 2016 China Undergraduate Mathematical Contest in Modeling, this paper builds Multi - objective 0 - 1 programming and greedy algorithm for watch schedule in the wind farm, we have compared the differences between these two algorithms. This paper provides solutions for similar problems, and pointed out the applicable scope of each method.
出处
《佳木斯大学学报（自然科学版）》
CAS
2017年第2期317-320,共4页
Journal of Jiamusi University：Natural Science Edition
关键词
多目标
0-1规划
贪婪算法
multi objective programming
0 -1 programming
greedy algorithm
