{"id":23792498,"url":"https://github.com/se2p/sbse2020","last_synced_at":"2026-06-23T17:31:08.901Z","repository":{"id":80478195,"uuid":"311735892","full_name":"se2p/sbse2020","owner":"se2p","description":null,"archived":false,"fork":false,"pushed_at":"2021-01-27T09:59:18.000Z","size":13246,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"master","last_synced_at":"2025-02-21T13:30:34.076Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/se2p.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,"publiccode":null,"codemeta":null}},"created_at":"2020-11-10T17:31:38.000Z","updated_at":"2023-02-15T11:23:27.000Z","dependencies_parsed_at":"2023-02-27T13:16:06.875Z","dependency_job_id":null,"html_url":"https://github.com/se2p/sbse2020","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/se2p/sbse2020","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/se2p%2Fsbse2020","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/se2p%2Fsbse2020/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/se2p%2Fsbse2020/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/se2p%2Fsbse2020/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/se2p","download_url":"https://codeload.github.com/se2p/sbse2020/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/se2p%2Fsbse2020/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34700904,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-23T02:00:07.161Z","response_time":65,"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":[],"created_at":"2025-01-01T18:35:22.466Z","updated_at":"2026-06-23T17:31:08.884Z","avatar_url":"https://github.com/se2p.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Search-Based Software Engineering Course WS20/21\n\nFor now, the Jupyter notebooks are provided as is, and you will have to download and open them in Jupyter. Here's [how to install jupyter notebook on your machine](https://www.dataquest.io/blog/jupyter-notebook-tutorial/).\n\n\n## Chapter 1: Random and Local Search\n\nThe first chapter covers the coding examples from the first two weeks, on basic random search and local search algorithms.\n\n## Chapter 2: Evolutionary Search (Part 1)\n\nThis chapter covers basic evolutionary strategies and genetic algorithms.\n\n## Chapter 3: Evolutionary Search (Part 2)\n\nThis chapter looks at alternative search operators for genetic algorithms\nand their consequences on diversity and fitness.\n\n## Chapter 4: Multi-Objective Evolutionary Algorithms\n\nThis chapter considers how to extend evolutionary search to more than one\nobjective function.\n\n## Chapter 5: Search-Based Test Generation\n\nThis chapter looks at the basics of search-based test generation: How to\nencode simple problems, what are fitness functions, and how can we adapt\nsearch algorithms to work well on these problems.\n\n## Chapter 6: Genetic Programming\n\nThis chapter introduces the basics of Genetic Programming, starting with\nclassical, untyped syntax trees, up to Grammatical Evolution.\n\n## Chapter 7: Parameter Control and Adaptation\n\nWe have many algorithms to choose from, and each algorithm has multiple\nparameters that need to be set. We mainly used some reasonably common\ndefault values in previous chapters. In this chapter we consider the \nquestion of how we can optimise these parameters, and control and adapt\nthem throughout the search.\n\n## Chapter 8: Advanced Evolutionary Algorithms\n\nThis chapter covers more advanced versions of the evolutionary algorithms\nwe have covered, such as parallelised versions, memetic algorithms, as \nwell as differential evolution and the extension to estimation of \ndistribution algorithms.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fse2p%2Fsbse2020","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fse2p%2Fsbse2020","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fse2p%2Fsbse2020/lists"}