火电厂机组经济调度算法设计与分析-计算机应用技术专业论文.docxVIP

青岛理工大学T学硕士学位论文摘要 青岛理工大学T学硕士学位论文 摘要 研究火电厂机组经济调度优化算法问题，针对机组组合优化算法的通用性问 题，把M台机组的组合问题抽象成一个从M个数组中各取1个数并且这M个 数之和等于一个给定值的数学问题。在此基础上，提出并实现了一种新的具有通 用性的、能够适应任意变化机组数的机组组合优化的穷举算法，分析了算法复杂 性。采用递归回溯方法实现组合优化的穷举搜索。并通过实验验证了算法的正确 性和完备性，确实搜索到全部可能解，在应用于机组经济调度时能够找到最优解。 递归回溯方法的缺点是计算时间较长，只适用于机组数较少的情况。对应用混洗 蛙跳算法解决机组组合优化问题进行了探索研究。提出并实现了一种同样具有通 用性的、能够适应任意变化机组数的机组组合优化的混洗蛙跳算法，分析了算法 复杂性。该算法具有良好的全局搜索和局部更新策略。对所提出的两种算法的实 验结果进行了比较分析。用混洗蛙跳算法解决机组组合优化问题存在稳定性差、 不能保证得到最优解等缺点。当机组台数较少时，混洗蛙跳算法的计算时间比递 归回溯方法多。但是当机组台数较多时，混洗蛙跳算法的计算时间明显比递归回 溯方法缩短。 关键词 混洗蛙跳算法；穷举算法；算法复杂性；机组组合；经济调度 青岛理工大学工学硕十学位论文Abstract 青岛理工大学工学硕十学位论文 Abstract The optimization algorithm of unit combination for fossil fuel power plant is studied in this paper．To resolve the problem of general-purpose algorithm of unit combinatorial optimization，the combinatorial problem of M units is abstracted into all algorithm problem which is to take out a number from each of M arrays and the slam of these M numbers is equal to a given value．Based on this，a new enumerative algorithm of unit combination optimization is proposed，which is general-purpose and able to fit any varying number of units．The complexity of this algorithm is analyzed． The recursive backtracking method is used to search for every possible combination． The correctness and completeness of the algorithm are verified by experiment．A1l of the possible solutions are searched and the optimal solution Can be found．The drawback ofrecursive backtracking method is longer time of calculating．So it is only fit in fewer units．The exploring research for applying shuffled flog—leaping algorithm to resolve the unit combinatorial optimization is carried out．A shuffled flog·leaping algorithm(SFLA)of unit combination optimization is proposed，which is also general—purpose and able to fit any varying number of units．The complexity of this algorithm is analyzed．The algorithm has good global searching and local replacement tactics．The experimental results of the two algorithms proposed are compared and analyzed．Th