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

03/01/2022
by   Maryam Fadavian, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2022

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

This paper investigated the problem of embedding a simple Hamiltonian Cy...
research
08/04/2017

Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons

Given a graph G with n vertices and a set S of n points in the p...
research
10/05/2021

An Improved Genetic Algorithm and Its Application in Neural Network Adversarial Attack

The choice of crossover and mutation strategies plays a crucial role in ...
research
10/15/2021

Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete

The embedding is an essential step when calculating on the D-Wave machin...
research
10/11/2022

How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm

In 2020 Bang-Jensen et. al. generalized the Hajós join of two graphs to ...
research
11/24/2014

Solving the Periodic Timetabling Problem using a Genetic Algorithm

In railway operations, a timetable is established to determine the depar...
research
07/31/2010

Evolutionary Approach to Test Generation for Functional BIST

In the paper, an evolutionary approach to test generation for functional...

Please sign up or login with your details

Forgot password? Click here to reset