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

简单多边形内点集直线嵌入圈的遗传算法

A genetic algorithm for straight-line embedding of a cycle onto a given set of points inside simple polygons

Maryam Fadavian, Heidar Fadavian

摘要:

在本文中,我们研究了嵌入一个循环的n个顶点到一个给定的一组n个点内的一个简单的多边形。这个问题的目标是,循环必须嵌入没有弯曲,不相交本身和多边形。这个问题是一个特殊的情况下,开放的问题,找到一个(s,X,t)-简单的哈密尔顿路径内的一个简单的多边形,不相交本身和边的多边形。该问题的复杂性在本文中是开放的,但已证明类似问题是NP完全的。我们提出了一个基于遗传算法的元启发式算法,用于将具有最小交叉数的圈直线嵌入到简单多边形内的给定点集上。所提出的遗传算法的效率是由于变异操作的定义,如果有一个交叉点之间的嵌入边缘的循环,删除它。实验结果表明,使用该变异操作的算法比仅使用通常的两点变异操作的算法的结果效率高得多。

英文摘要:

In this paper, we have examined the problem of embedding a cycle of n vertices onto a given set of n points inside a simple polygon. The goal of the problem is that the cycle must be embedded without bends and does not intersect itself and the polygon. This problem is a special case of the open problem of finding a (s, X, t) - simple Hamiltonian path inside a simple polygon that does not intersect itself and the sides of the polygon. The complexity of the problem is examined in this paper is open, but it has been proved that similar problems are NP-complete. We have presented a metaheuristic algorithm based on a genetic algorithm for straight-line embedding of a cycle with the minimum numbers of intersections, onto a given set of points inside simple polygons. The efficiency of the proposed genetic algorithm is due to the definition of the mutation operation, which removes it if there is an intersection between the embedded edges of the cycle. The experimental results show that the results of the version of the algorithm that uses this mutation operation are much more efficient than the version that uses only the usual two-points mutation operation.

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

↑