Day-ahead dispatch optimization, as an essential dynamic function required for the optimum energy management of integrated energy systems, is suffered from the curse of dimensionality and high computational cost when it faces with nonlinear, non-convex, and in particular high-dimensional situations. The critical one factor contributing to these phenomena is the dynamic constraints which are coupled in a time-series way. To this end, a new search strategy is proposed in this paper to handle the time-series constraints in harmony search (HS) based day-ahead dispatch problems, called as conductor harmony search (CHS). The CHS introduces a state matrix to record the values of time-series constraints. Moreover, when the variable values at a certain moment are altered during the improvement process, the variables at the coming moment are modulated to enable the corresponding values in state matrix remain unaffected. In contrast to existing constraint handling methods, the CHS guarantees the least impact on the dynamic boundaries of feasible regions in the remaining moments. Simulations reveal that the proposed CHS is effective and powerful to solve the day-ahead dispatch problem by comparing with some existing algorithms.

作为集成能源系统的最佳能源管理所必需的基本动态功能，提前调度最优化在面对非线性，非凸，尤其是高维情况时会遭受维度的诅咒和较高的计算成本。导致这些现象的关键因素之一是动态约束，它们以时间序列的方式耦合。为此，本文提出了一种新的搜索策略来处理基于和声搜索（HS）的日前调度问题中的时间序列约束，称为导体和声搜索（CHS）。CHS引入了一个状态矩阵来记录时间序列约束的值。此外，如果在改进过程中某个时刻的变量值发生变化，对即将到来的时刻的变量进行调制，以使状态矩阵中的相应值保持不受影响。与现有的约束处理方法相比，CHS保证在剩余时刻对可行区域的动态边界的影响最小。仿真表明，与现有算法相比，本文提出的CHS在解决日间调度问题方面是有效且强大的。