https://github.com/tofull/mouvant

Ant Colony Optimisation algorithm to solve combinatorial problems (NP-completeness)
https://github.com/tofull/mouvant

Last synced: over 1 year ago
JSON representation

Ant Colony Optimisation algorithm to solve combinatorial problems (NP-completeness)

• Host: GitHub
• URL: https://github.com/tofull/mouvant
• Owner: Tofull
• License: apache-2.0
• Created: 2016-11-04T21:34:24.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2016-11-04T23:09:49.000Z (over 9 years ago)
• Last Synced: 2025-01-12T23:30:53.476Z (over 1 year ago)
• Language: C
• Homepage:
• Size: 72.2 MB
• Stars: 1
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# MouvAnt

Algorithm for solving combinatorial problems (NP-completeness)

Inspired from the ant colony optimization method.

Find quickly the best subset of laser ranging stations in order to estimate the Earth Orientation Parameters. More accurate than genetic algorithms used until now.

## Authors

[Loic Messal](https://fr.linkedin.com/in/loicmessal "Profil LinkedIn") - French Student at National School of Geomatics : 

[Sylvain Jourdana](https://fr.linkedin.com/in/sylvain-jourdana-607265105 "Profil LinkedIn") - French Student at National School of Geomatics :