https://github.com/ncrashed/radio-problem

Genetic algorithm on binary strings that solves problem of placing radio towers to achieve best coverage of area
https://github.com/ncrashed/radio-problem

Last synced: 11 months ago
JSON representation

Genetic algorithm on binary strings that solves problem of placing radio towers to achieve best coverage of area

• Host: GitHub
• URL: https://github.com/ncrashed/radio-problem
• Owner: NCrashed
• License: mit
• Created: 2014-11-17T00:33:18.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2014-11-24T18:13:43.000Z (over 11 years ago)
• Last Synced: 2025-07-04T00:36:27.952Z (11 months ago)
• Language: Haskell
• Size: 379 KB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
radio-problem

=============

This is simple example of genetic algorithm for solving radio problem descirbed below. The GA uses

bit string representation of possible solution, three pointed crossover operator, mutation and

best solutions copying between generations.

The description of problem:

```

There are k possible location where a radio tower could be placed. What is minimal tower count

and where they should be placed to achieve maximum coverage of network?

```

There is also fancy vizualization using [Gloss](http://gloss.ouroborus.net/):

![Final solution](screenshot1.png)

This program is used in [BMSTU](http://www.bmstu.ru/en/) as practical task for investigating concepts

of genetic algorithms.

Example of large input data:

![Complex solution](screenshot2.png)

![Complex solution](screenshot3.png)