根据碳封存技术的实际应用背景和相关技术要求,采用数学模型描述了碳封存网络的优化问题,并运用模拟退火算法和最小支撑树算法对其进行求解。模拟退火算法是解NP完全问题的有效启发式算法,运用该算法对潜在CO_2汇点进行离散选址决策,并结合最小支撑树算法确定最优网络布局;并将该套算法优化得到的计算结果与商业运筹学软件CPLEX比较,显示该算法在解决规模较小的碳封存网络优化问题时,能在较短的运算时间内获得较高的精确性。
According to the practical application of carbon sequestration technology and relevant technical requirements,this paper uses mathematical models to describe carbon sequestration network optimization problems,and uses simulated annealing algorithm and the minimum spanning tree algorithm to solve them Simulated annealing algorithm is an effective heuristic algorithm for NP-complete problem. This paper uses the algorithm to make discrete location decisions for the potential CQ_2 sink points, combined with the minimum spanning tree algorithm to determine the optimal network layout;and compare the results from the algorithms with that from commercial operations research software CPLEX. It shows that the algorithm is able to solve smaller carbon sequestration network optimization problems, in a relatively short computing time.