{"id":21433207,"url":"https://github.com/nemat-al/evolutionary_computing","last_synced_at":"2025-03-16T22:42:52.156Z","repository":{"id":234512759,"uuid":"789049644","full_name":"nemat-al/Evolutionary_Computing","owner":"nemat-al","description":"Tasks for Evolutionary Computing Course @ ITMO University.","archived":false,"fork":false,"pushed_at":"2024-04-19T17:01:00.000Z","size":83,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-23T08:44:32.209Z","etag":null,"topics":["evolutionary-algorithms","evolutionary-computation","optimization","queens-problem","queens-puzzle"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nemat-al.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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":"2024-04-19T15:56:32.000Z","updated_at":"2024-04-19T15:57:52.000Z","dependencies_parsed_at":"2024-04-22T18:00:56.168Z","dependency_job_id":null,"html_url":"https://github.com/nemat-al/Evolutionary_Computing","commit_stats":null,"previous_names":["nemat-al/evolutionary_computing"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemat-al%2FEvolutionary_Computing","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemat-al%2FEvolutionary_Computing/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemat-al%2FEvolutionary_Computing/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nemat-al%2FEvolutionary_Computing/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nemat-al","download_url":"https://codeload.github.com/nemat-al/Evolutionary_Computing/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243945526,"owners_count":20372893,"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":["evolutionary-algorithms","evolutionary-computation","optimization","queens-problem","queens-puzzle"],"created_at":"2024-11-22T23:26:41.740Z","updated_at":"2025-03-16T22:42:52.128Z","avatar_url":"https://github.com/nemat-al.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Evolutionary_Computing\nTasks for Evolutionary Computing Course at ITMO University\n\n----\n\n## Index\n1. [First Task : Function Optimization](#first-task--function-optimization)\n2. [Second Task]()\n\n## [First Task : Function Optimization](https://github.com/nemat-al/Evolutionary_Computing/blob/main/ec_lab1_Aloush.ipynb)\nThe goal is to play around basic implementation of Genetic Algorithm and tune it in a way that it will able to find approximate optimal solution of given function.\nThe target function is modification of [Rastrgin function](https://www.sfu.ca/~ssurjano/rastr.html). It is reversed, displaced and scaled in such a way that result values are in range [0.0, 10.0].  Possible range of input variables are [-5, 5] for all variables.\n\n[Deap](https://deap.readthedocs.io/en/master/) framework was used.\n\nIt was required that the algorithm must find solutions with fitness values around 9.9, and the algorithm successfully found solutions with best fitness value equal to 9.954.\n\n## [Second Task](https://github.com/nemat-al/Evolutionary_Computing/blob/main/ec_lab2_Aloush.ipynb)\nThe goal is to develop an Evolutionary algorithm to solve the queens puzzle. This is classic optimisation problem, where you have to allocate N queens across NxN chessboard in such a way, so they will not conflict to each other. The N is a parameter and can be varied. Try to think how to represent your solutions and how to perform mutation and crossover.\n\n[Deap](https://deap.readthedocs.io/en/master/) framework was used.\n\nThe solution is based on the following [tutorial](https://nbviewer.org/github/concision/n-queens/blob/master/notebook.ipynb).\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemat-al%2Fevolutionary_computing","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnemat-al%2Fevolutionary_computing","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnemat-al%2Fevolutionary_computing/lists"}