【24h】

A New Pareto-Based Algorithm for Multi-objective Graph Partitioning

机译:一种新的基于Pareto的多目标图划分算法

获取原文
获取原文并翻译 | 示例

摘要

One significant problem of optimization which occurs in many real applications is that of graph partitioning. It consist of obtaining a partition of the vertices of a graph into a given number of roughly equal parts, whilst ensuring that the number of edges connecting vertices of different sub-graphs is minimized. In the single-objective (traditional) graph partitioning model the imbalance is considered a constraint. However, in same applications it is necessary to extend this model to its multi-objective formulation, where the imbalance is also an objective to minimize. This paper try to solve this problem in the multi-objective way by using a population version of the SMOSA algorithm in combination with a diversity preservation method proposed in the SPEA2 algorithm.
机译:在许多实际应用程序中发生的优化的一个重要问题是图形分区。它包括将图的顶点划分为给定数量的大致相等的部分,同时确保将连接不同子图的顶点的边的数量最小化。在单目标(传统)图分区模型中,不平衡被视为约束。但是,在相同的应用中,有必要将该模型扩展到其多目标公式化,其中不平衡也是最小化的目标。本文尝试通过将SMOSA算法的总体版本与SPEA2算法中提出的多样性保存方法结合使用,以多目标的方式解决此问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号