机组组合优化问题的穷举算法研究  

Study of Exhaustive Algorithm for the Unit Commitment Optimization

作　　者：张婷婷[1] 张凤丽[1] 盛建伦[1] 

机构地区：[1]青岛理工大学计算机工程学院,青岛266033

出　　处：《青岛理工大学学报》2011年第1期81-86,共6页Journal of Qingdao University of Technology

摘　　要：提出一种解决机组组合优化问题的通用穷举算法,把M台机组组合优化问题转化成从M个数组中各取一个数并且这M个数之和等于一个给定值的数学问题,在此基础上,利用递归回溯的方法搜索每个可能的组合.试验结果表明,该算法能够找出任意台机组在任意技术出力范围内的所有的组合方案,不会产生漏解.应用于经济调度问题时,以煤耗量为目标函数,证明该算法能够得到最优解.最后,分析了该算法的复杂性.This paper presents a way of general exhaustive algorithms to solve the problem of the unit commitment optimization.This paper transforms the unit combinatorial optimization problem into an algorithm problem.Then,the problem is to seek all combinations which include M element each taking from one of M arrays,and also to seek all combinations in which the sum of M element is a given number.The paper uses the recursive backtracking method to search for every possible combination.The experimental results show that this algorithm can find out all the combination programs of any unit within any scope of technical efforts and does not produce leakage solution.Applied to the economic dispatch problem and taking the coal consumption as an objective function,it is proved that the algorithm can get the optimal solution.In conclusion,the paper analyzes the complexity of the algorithm.

关 键 词：穷举法 机组组合 回溯算法 经济调度 算法复杂性 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]