Skip to content
/ MouvAnt Public

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

License

Notifications You must be signed in to change notification settings

Tofull/MouvAnt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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 - French Student at National School of Geomatics : [email protected]

Sylvain Jourdana - French Student at National School of Geomatics : [email protected]

About

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

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published