Dragoon算法对k-中心问题的通用性评价
Evaluation of the general applicability of Dragoon for the k-center problem
摘要:
k中心问题是我们在考虑复杂服务系统时经常面临的一个基本问题。典型的挑战包括在物流中放置仓库或为内容分发网络定位服务器。我们以前已经提出了龙骑兵作为一个有效的算法来处理的k-中心问题。本文评估了Dragoon,重点是与其他技术相比的潜在最差情况行为。我们使用进化算法生成的k-中心问题,特别是具有挑战性的龙骑兵的实例。最终,我们的实验证实了Dragoon之前的良好结果,但是,我们也可以可靠地找到其他方法明显优于它的场景。
英文摘要:
The k-center problem is a fundamental problem we often face when considering complex service systems. Typical challenges include the placement of warehouses in logistics or positioning of servers for content delivery networks. We previously have proposed Dragoon as an effective algorithm to approach the k-center problem. This paper evaluates Dragoon with a focus on potential worst case behavior in comparison to other techniques. We use an evolutionary algorithm to generate instances of the k-center problem that are especially challenging for Dragoon. Ultimately, our experiments confirm the previous good results of Dragoon, however, we also can reliably find scenarios where it is clearly outperformed by other approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。