Skip to content

Research into genetic algorithms related to undirected point search in the plane

License

Notifications You must be signed in to change notification settings

jotoh98/evoSearch

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

javadoc maven DeepCode badge

How to run

  1. Install IntelliJ
  2. Clone the project fom Github using git
  3. Install the lombok plugin https://projectlombok.org/setup/intellij
  4. Enable 'Annotation processing' in Preferences > Build, Execution, Deployment > Compiler > Annotation Processors
  5. In the maven Tab on the right, hit refresh to download the dependencies
  6. Click on run

What is evoSearch?

This project arises in the course of my bachelor thesis, which examines the behavior of genetic algorithms on the following geometric problem: We choose a certain amount of equally distributed one-dimensional sub-spaces of the two-dimensional space, all sharing the origin as one element. In one of those sub-spaces we place a treasure point and get a list of distances which are transferred into points with corresponding distances to the origin. Now the problem is:

How do we distribute these points to find treasures efficiently?

About

Research into genetic algorithms related to undirected point search in the plane

Topics

Resources

License

Code of conduct

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published