{"id":20068556,"url":"https://github.com/tofull/mouvant","last_synced_at":"2025-03-02T11:21:56.423Z","repository":{"id":220589282,"uuid":"72887111","full_name":"Tofull/MouvAnt","owner":"Tofull","description":"Ant Colony Optimisation algorithm to solve combinatorial problems (NP-completeness)","archived":false,"fork":false,"pushed_at":"2016-11-04T23:09:49.000Z","size":75717,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-12T23:30:53.476Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Tofull.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2016-11-04T21:34:24.000Z","updated_at":"2022-06-08T02:47:28.000Z","dependencies_parsed_at":"2024-02-02T23:36:41.624Z","dependency_job_id":null,"html_url":"https://github.com/Tofull/MouvAnt","commit_stats":null,"previous_names":["tofull/mouvant"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tofull%2FMouvAnt","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tofull%2FMouvAnt/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tofull%2FMouvAnt/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tofull%2FMouvAnt/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Tofull","download_url":"https://codeload.github.com/Tofull/MouvAnt/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241495352,"owners_count":19972080,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-13T14:07:33.626Z","updated_at":"2025-03-02T11:21:56.407Z","avatar_url":"https://github.com/Tofull.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MouvAnt\nAlgorithm for solving combinatorial problems (NP-completeness)\n\n\nInspired from the ant colony optimization method.\n\nFind quickly the best subset of laser ranging stations in order to estimate the Earth Orientation Parameters. More accurate than genetic algorithms used until now.\n\n## Authors\n\n[Loic Messal](https://fr.linkedin.com/in/loicmessal \"Profil LinkedIn\") - French Student at National School of Geomatics : \u003cmessal.loic@gmail.com\u003e\n\n[Sylvain Jourdana](https://fr.linkedin.com/in/sylvain-jourdana-607265105 \"Profil LinkedIn\") - French Student at National School of Geomatics : \u003csylvain.jourdana@ensg.eu\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftofull%2Fmouvant","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftofull%2Fmouvant","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftofull%2Fmouvant/lists"}