{"id":23045403,"url":"https://github.com/mykeels/msearch","last_synced_at":"2025-08-09T02:12:49.937Z","repository":{"id":93602030,"uuid":"80329513","full_name":"mykeels/MSearch","owner":"mykeels","description":"A C# Library to aid programming for meta-heuristics","archived":false,"fork":false,"pushed_at":"2018-06-03T14:20:52.000Z","size":3698,"stargazers_count":30,"open_issues_count":1,"forks_count":6,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-03T03:11:22.967Z","etag":null,"topics":["algorithm","artificial-bee-colony","dotnet","flower-pollination","genetic-algorithm","hill-climbing","local-search","metaheuristics","simulated-annealing"],"latest_commit_sha":null,"homepage":null,"language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mykeels.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}},"created_at":"2017-01-29T05:00:38.000Z","updated_at":"2024-07-11T17:42:30.000Z","dependencies_parsed_at":"2023-03-13T17:16:08.291Z","dependency_job_id":null,"html_url":"https://github.com/mykeels/MSearch","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mykeels/MSearch","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mykeels%2FMSearch","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mykeels%2FMSearch/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mykeels%2FMSearch/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mykeels%2FMSearch/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mykeels","download_url":"https://codeload.github.com/mykeels/MSearch/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mykeels%2FMSearch/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269518731,"owners_count":24430644,"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","status":"online","status_checked_at":"2025-08-09T02:00:10.424Z","response_time":111,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithm","artificial-bee-colony","dotnet","flower-pollination","genetic-algorithm","hill-climbing","local-search","metaheuristics","simulated-annealing"],"created_at":"2024-12-15T21:20:17.353Z","updated_at":"2025-08-09T02:12:49.898Z","avatar_url":"https://github.com/mykeels.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MSearch\n\nA C# Library to aid programming for Meta-Heuristics.\n\nIn computer science and mathematical optimization, a meta-heuristic is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem, especially with incomplete or imperfect information or ... [see more](https://en.wikipedia.org/wiki/Metaheuristic)\n\n## Project Documentation\n\nPlease see the [project documentation](Documentation.md) here.\n\n## Algorithms and Samples\n\n- [Artificial Bee Colony (ABC)](MSearch/ABC)\n- [Flower Pollination Algorithm](MSearch/Flowers)\n- [Genetic Algorithm](MSearch/GA)\n- [HillClimbing Algorithm](MSearch/HillClimb)\n- [Simulated Annealing](MSearch/SA)\n\n## How to Use\n\n- Fork the project, or [download the zipped project](https://github.com/mykeels/MSearch/archive/master.zip)\n- Open MSearch.sln in [Visual Studio 2012](https://www.visualstudio.com/downloads) or later\n- Build the project to get a DLL in the bin/debug folder\n- Use the DLL in your project as the [license](LICENSE) allows\n\n## Installation\n\nYou can install MSearch in your .NET Project via:\n\n### Using Nuget Package Manager Console\n\n```ps\nPM\u003e Install-Package MSearch\n```\n\n### Using DotNet CLI\n\n```bash\ndotnet add package MSearch\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmykeels%2Fmsearch","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmykeels%2Fmsearch","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmykeels%2Fmsearch/lists"}