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

一种求解有供需图划分问题的蚁群优化算法

An Ant Colony Optimization Algorithm for Partitioning Graphs with Supply and Demand

Qatar Environment and Energy Research Institute(卡塔尔环境与能源研究所);Faculty of Computer Science, Megatrend University(Megatrend大学计算机学院);University of Hamburg(汉堡大学);Pontificia Universidad Católica de Valparaíso(瓦尔帕莱索天主教大学)

Raka Jovanovic, Milan Tuba, Stefan Voss

摘要:

在本文中,我们专注于寻找高质量的解决方案的问题的最大划分图与供应和需求(MPGSD)。由于MPGSD与配电系统领域出现的问题密切相关,特别是对于互连微电网的自适应优化,因此对MPGSD的兴趣越来越大。提出了一种求解该问题的蚁群优化算法。为了进一步改进算法,我们将其与先前开发的校正程序相结合。在我们的计算实验中,我们评估所提出的算法的性能上的树和一般的图形。测试表明,该方法设法找到最佳解决方案,在50%以上的问题的情况下,与已知的最佳解决方案相比,平均相对误差小于0.5%。

英文摘要:

In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD due to its close connection to problems appearing in the field of electrical distribution systems, especially for the optimization of self-adequacy of interconnected microgrids. We propose an ant colony optimization algorithm for the problem. With the goal of further improving the algorithm we combine it with a previously developed correction procedure. In our computational experiments we evaluate the performance of the proposed algorithm on both trees and general graphs. The tests show that the method manages to find optimal solutions in more than 50% of the problem instances, and has an average relative error of less than 0.5% when compared to known optimal solutions.

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

↑