Boundary Evolution Algorithm for SAT-NP

12/22/2018
by   Zhaoyang Ai, et al.
0

A boundary evolution Algorithm (BEA) is proposed by simultaneously taking into account the bottom and the high-level crossover and mutation, ie., the boundary of the hierarchical genetic algorithm. Operators and optimal individuals based on optional annealing are designed. Based on the numerous versions of genetic algorithm, the boundary evolution approach with crossover and mutation has been tested on the SAT problem and compared with two competing methods: a traditional genetic algorithm and another traditional hierarchical genetic algorithm, and among some others. The results of the comparative experiments in solving SAT problem have proved that the new hierarchical genetic algorithm based on simulated annealing and optimal individuals (BEA) can improve the success rate and convergence speed considerably for SAT problem due to its avoidance of both divergence and loss of optimal individuals, and by coronary, conducive to NP problem. Though more extensive comparisons are to be made on more algorithms, the consideration of the boundary elasticity of hierarchical genetic algorithm is an implication of evolutionary algorithm.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/14/2012

Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem

The genetic algorithm includes some parameters that should be adjusted, ...
04/14/2016

An Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems

Bat algorithm is a population metaheuristic proposed in 2010 which is ba...
11/11/2012

Genetic Algorithm for Designing a Convenient Facility Layout for a Circular Flow Path

In this paper, we present a heuristic for designing facility layouts tha...
06/26/2013

Metaheuristics in Flood Disaster Management and Risk Assessment

A conceptual area is divided into units or barangays, each was allowed t...
03/01/2022

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

In this paper, we have examined the problem of embedding a cycle of n ve...
09/11/2009

Paired Comparisons-based Interactive Differential Evolution

We propose Interactive Differential Evolution (IDE) based on paired comp...
08/07/2017

Efficient Noisy Optimisation with the Sliding Window Compact Genetic Algorithm

The compact genetic algorithm is an Estimation of Distribution Algorithm...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.