arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.07128math.OC
收藏

多目标机组组合的自适应方法

Adaptive Methods for Multiobjective Unit Commitment

Ece Tevruez, Aswin Kannan

AI总结:

针对多目标机组组合的混合整数优化问题,提出结合ε约束与自适应权重、辅以McCormick型松弛的可扩展数学优化框架,可显著降低计算复杂度、加快帕累托前沿估算。

摘要:

本工作研究多目标版本的机组组合问题,该问题旨在确定企业在给定时间段内、针对给定电网的最优发电调度方案。随着环境影响的重要性日益提升,除标准发电成本外,相关目标还包括CO₂排放水平和可再生能源渗透率。典型约束包括发电水平限制以及发电机组的开/停机时间约束,这进一步需要求解一个多目标混合整数优化问题。现有相关文献主要聚焦于用启发式算法(如遗传算法Genetic Algorithms)求解大规模问题实例。本工作的主要目的是提出可扩展的基于数学优化的方法,以加快估算底层帕累托前沿Pareto frontier的过程。我们的贡献属于计算层面,依托两个核心方案:其一,结合ε约束epsilon constraints和自适应权重的概念,求解一系列单目标优化问题;其二,为减轻计算负担,针对由所得公式类型产生的二次型约束,提出一种McCormick型松弛Mccormick-type relaxation方法。我们在来自[1,50]的真实电网数据上测试了所提出的计算框架,并将其与Gurobi等标准求解器进行对比。结果表明,部署所提框架后,计算复杂度(计算时间)显著降低。

英文摘要:

This work considers a multiobjective version of the unit commitment problem that deals with finding the optimal generation schedule of a firm, over a period of time and a given electrical network. With growing importance of environmental impact, some objectives of interest include CO2 emission levels and renewable energy penetration, in addition to the standard generation costs. Some typical constraints include limits on generation levels and up/down times on generation units. This further entails solving a multiobjective mixed integer optimization problem. The related literature has predominantly focused on heuristics (like Genetic Algorithms) for solving larger problem instances. Our major intent in this work is to propose scalable versions of mathematical optimization based approaches that help in speeding up the process of estimating the underlying Pareto frontier. Our contributions are computational and rest on two key embodiments. First, we use the notion of both epsilon constraints and adaptive weights to solve a sequence of single objective optimization problems. Second, to ease the computational burden, we propose a Mccormick-type relaxation for quadratic type constraints that arise due to the resulting formulation types. We test the proposed computational framework on real network data from [1,50] and compare the same with standard solvers like Gurobi. Results show a significant reduction in complexity (computational time) when deploying the proposed framework.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑