The distributed schedule optimization of energy storage constitutes a challenge. Such algorithms often expect an input set containing all feasible schedules or respectively require to efficiently search the schedule space. It is hardly possible to accomplish this with energy storage due to its high flexibility. In this paper, the problem is introduced in detail and addressed by a metaheuristic algorithm, which generates a preselection of schedules. Three contributions are presented to achieve this goal: First, an extension for a distributed schedule optimization allowing a simultaneous optimization is developed. Second, an evolutionary algorithm is designed to generate optimized schedules. Third, the algorithm is extended to include an arbitrary local criterion. It is shown that the presented approach is suitable to schedule electric energy storage in real households and industries with different generator and storage types.
翻译:分配式节能储存优化是一个挑战。这种算法往往期望有包含所有可行时间表的投入集,或者分别需要有效搜索时间表空间。由于能源存储具有高度的灵活性,很难做到这一点。在本文中,这个问题由一种能预选时间表的计量算法详细提出和解决,提出三点意见以实现这一目标:第一,扩大分配式节能优化,允许同时优化。第二,进化式算法旨在生成优化时间表。第三,算法扩大,以包括任意的本地标准。这表明,所提出的方法适合于将电力存储安排在实际住户和不同类型发电机和储存的行业。